Cs-201 Assignments

Assignment 1 Assignment 2 Assignment 3 Assignment 4 Assignment 5

Iron rusts from disuse, stagnant water loses its purity, and in cold weather becomes frozen, even so does inaction sap the vigor of the mind. -Leonardo Da Vinci, painter, engineer, musician, and scientist (1452-1519)

Note:  Exercises that are in bold underline (typed like this) are to be handed in.  Do the others (typed like this) on separate paper so that you hand in only those exercises in bold underline. This 1st assignment can be handed in as a group on a trial basis. Make sure all names are on the front sheet. People should do equal or all work. All get the same grade.
_________________________________________________________________________

Reading: 

• Section 2.1 (pages 66-70).
• Sections 2.2, 2.4.
• Sections 2.3 - 2.4.

Exercises:

•   Section 2.1, page 70:  3a, 3b, 3c, 4a, 4d, 4e, 4f, 5 (all but 5b)
  
  
•   Section 2.2, pages 73-74:  1, 2, 3-7.
  
  
•   Section 2.3, page 76:  1, 2, 3a-d, 4a, 4b
  
  
•   Section 2.4, pages 81-82:   1, 2, 4, all parts are good exercises, but I will
                                             ;          collect:   1(b,c), 2(c,d), 4(c,e).
  
•   Section 2.4, pages 81-82:   5, 7, 8.  All are good exercises, but I will
                                             ;          collect:   5(b,c), 7(a, b, d), 8(b, c, d)
  
• Section 2.4, Page 81:  6a, 6c
  
  

***


Reading:

• Section 2.5 (pages 82-88).
• Section 2.6 (pages 88-92).
• Section 2.7 (pages 92-95). Don't worry about last paragraph on p. 95.

Exercises:

• Section 2.5, page 88: 2 (a, b, c, d), 3, 4, 5(a), 5(b, c)
• Section 2.6, page 92: 1a, 1b, 1c, 2b, 3c, 3e, 3f
• Section 2.7, page 96: 1a, 1d, 2a, 2c, 2d, 3a, 3b, 3c, 4a, 5, 9a

and:

•   Section 2.7, page 96:  Prove the statement in #9a is TRUE.  
  
  Note:  This proof is not in the book, but is covered in class.  Do this now without your notes.  If you need to peek, that's ok, but then do it again without your notes.  This will be a fair test question.  Recall the definitions of even and odd:   An integer n is even if there exists an integer k such that n = 2k.     An integer n is odd if there exists an integer k such
  that n = 2k + 1.
  
  
•   **Extra Credit** 
  
  You are walking on a road and come to a fork in the road.  You have to decide whether to take the left road or the right road.  One of the roads leads to treasure, and the leads to a horrible death.  Two guards stand before the fork in the road.  They are identical in every respect except one:  one of the guards always tells the truth and the other one always lies.  You may ask only one question to only one of the guards, and the answer must be a YES or NO.   If it is not a YES/NO question, the guard will not answer.  What question do you ask?
  ****Do NOT get any help from others in the class or books or the web, and do not give your answer away to others.

Reading: 

• Section 2.8 (pages 96-99).

Exercises:

• Section 2.8, page 102:  1a, 1b, 1c, 1d, 2, 3, 4
  
  Note:  For all of these exercises, if the argument is invalid, then you must provide a truth assignment to the variables that causes all the predicates to evaluate to TRUE, and the conclusion to evaluate to FALSE.  (Such an assignment proves the argument is invalid.)

Assignment 2 due 2/21/02.

Assignment 3 due 3/12/02

Assignment 4 due 4/2/02

Assignment 5 due 4/23/02 but presented earlier

Assignment 2.

You have done the following already, but didn't turn in:

• Section 2.5, page 88:   2 (a, b, c, d),  3,  4,   5(a), 5(b, c)
• Section 2.6, page 92:   1a, 1b, 1c,  2b, 3c, 3e, 3f
• Section 2.7, page 96:  1a, 1d, 2a, 2c, 2d, 3a, 3b, 3c, 4a, 5, 9a

Reading: 

• Read Section 1.1, 1.2
• Section 7.1 (pages )

Exercises:



• Section 1.1, Page 11:  1, 3b, 3c.
• Section 1.1, page 11:  3d (use division algorithm and show work), 5a, 5b, 5c.
• Section 1.1, page 11 and 12:  6-9, 11 all parts; I will collect:  6d, 7d, 8d, 9d, 11a(iii), 11b(i).
• Section 1.2, page 23, 1-10 all parts;  I will collect:  1b, 2b, 2d, 3b, 4b, 5b, 5f, 6b, 7b, 8b, 8d, 9b, 9d, 10a, 10b
• Section 7.1, 2

Choose team mates for assignment 5.

Assignment 3.

Reading: 

•   Read Section 3.1, 1.3 , case 1b, case 1d

Exercises:

1.   p.36: 8 a, b, c, d, e, f; 10 a-c
2.   p. 51: 2 a-c; 4
3.   p. 62: 2, 5
4.   (not collected) Prove by induction:  For all n in the natural numbers, 2ⁿ > n.
5.   (not collected) Prove by induction:  For all n in the natural numbers,
                           1 + 2 + 3 + . . . + n   =   n(n + 1)/2.
6. to be collected:  Prove by induction:  For all n in the natural numbers,
                           1² + 2² + 3² +  . . .  + n²    =    n(n + 1)(2n + 1)/6.
7. to be collected:  Prove by induction:  For all n in the natural numbers,
                           1 + 3 + 5 + 7 + . . . + (2n - 1)   =    n².

Reading: 

•     Sections 3.2, 3.3.
•     Section 3.4

Exercises:

•     Section 3.3, pages 138-139:  All are good exercises to practice.  I will collect:  2, 4, 6, 8, 9, 10, 12.
  
  
•    Section 3.4 pages 143-144:  Do 1-8, 11-13.  I will collect:   2, 5, 6, 8, 12, 13, plus generate by hand rows 0 through 9 of Pascal's triangle.

Describe your intended project for assignment 5. Every one of your team mates should have an assigned portion. Need approval to go ahead. Need also a projected date for presentation.

Assignment 4

Reading: 

•   Pages 151 - 154 (Inclusion - Exclusion)
•   Page 179 (Theorem 4.1), Page 190, Page 192.

Exercises:

•   Section 3.5, pages 155-156:  #16, #4, #17, #18 .
•   Section 4.1, pages 185-186:  #6, 7, 5, 9, 10.
•   Section 4.2, pages 193-194:  3c, 4c, 6.
•   Section 4.3, page 202:  4, 5. 

 

Assignment 5.

Final student project: This will be a team project you should work on throughout the semester as you learn new features and discover what you'd like to do. Part of your assignment 3 would be to describe what you intend to do in this project, and get approval from me.

Find some team mates you'd like to work with or work on your own. The last few classes will be devoted to presenting your project to the class.

To return to Netiva Caftori's page

For messages to Dr. Caftori her.

Last updated 1/31/02