Assignment 2. Due 12:15 on Wednesday, December 12.
Textbooks and notes:
Discrete Mathematics and Its Applications, 7th edition, by
K. Rosen,
McGraw Hill, 2013. Same textbook as used for Discrete Methods.
This textbook will be used most, and we start with it.
Introduction to Algorithms, 3rd edition, by T. Cormen, C.
Leiserson, R.
Rivest, and C. Stein, MIT Press, 2009.
Same textbook as used for Algorithms and Data Structures.
Extra notes (available from Course Materials in Blackboard):
This includes chapter 13 from Algorithm Design, byt J. Kleinberg
and É. Tardos, Addison Wesley, 2005.
Lecture notes and problems for discussions sections:
Note 1. This includes general information about the course.
Slides from lecture 1.
Note 8. No slides used. Slides with most of what I covered from chapter 13 in Kleinberg
and Tardos can be found on Kevin Wayne's homepage at Princeton. It says
that they are the official slides from the publisher Pearson, for the
textbook.
Pearson's slides for chapter 13.