Discrete Mathematics for Computer Science - Spring 2005
Review Questions and Information on the Final

The final will concetrate on the material from the second half of the course, but will also include some material from before the midterm. You may bring ONE PAGE OF NOTES. Some things you probably want on your page of notes:

Review some proofs by induction, pidgeon-hole proofs, and combinatorial arguements for identites involving C(n,k) such as Theorem 4 on page 333. For practice, you can look at the following problems: