CS 202: Data Structures and Discrete Mathematics II
Fall 2010
Homework 1 (Due September 8 in Class) Solutions (prepared by Nick D. Shaskevich) 3.
10 points (5+5) (a) If n is a multiple of 3, how many
CS 202: Data Structures and Discrete Mathematics II
Fall 2010
Homework 2-1 (Due September 22 in Class) No Late Submissions 1.
(14=3+3+3+5 points) Binomial Theorem: (a) Find the 6th term in the expansi
CS 202: Data Structures and Discrete Mathematics II
Fall 2010
Homework 3 () Solutions 1.
Recurrences (60 points) (a) Find an exact solution to the following recurrence: an = an-1 + 2an-2 + 3n2 - 16n +