University of Chicago CSPP 50202 - General Information
CSPP 50202: Mathematics for Computer Science II
Summer 2009
General Information
Goal
CSPP 50202 is a sequel to CSPP 50201, an introductory course in discrete
mathematics oriented toward computer science. CSPP 50202 begins with
recursion and then studies counting,
including recurrences and methods of solving recurrences.
Discrete probability theory, including conditional probability and
independence, random variables, expectation, and variance, are studied.
Distribution and density and the binomial distribution are discussed.
Prerequisites
CSPP 50201 or placement is a prerequisite; calculus is not required.
There are no computer science prerequisites.
Textbook
The required text for the course is
Discrete Mathematics and its Applications. 6th ed.
(New York: McGraw-Hill, 2007) by Kenneth H. Rosen (ISBN 0072880082).
The text also may be purchased at reduced prices in used condition.
Warning: Some paperback versions of the textbook are missing the
chapter on discrete probability, which will be covered in CSPP 50202. You
are advised not to purchase a version of the textbook missing this chapter.
There is a
website for this book with additional problems and information.
Recommended problem book:
Schaum's Outline of Discrete Mathematics
(Second Edition) by Seymour Lipschutz et al. (ISBN 0070380457), also available at
reduced prices in
used
condition.
Syllabus
| week | topics
|
| 1 | recursion
|
| recursive algorithms
|
| 2 | recurrences
|
| methods of solving recurrences
|
| 3 | counting methods
|
| permutations, combinations, and the binomial theorem
|
| 4 | graph theory
|
| trees
|
| 5 | introduction to discrete probability theory
|
| conditional probability; independence
|
| 6 | random variables and expected value
|
| variance
|
| 7 | final exam
|
|
|
Note: The instructor may change the detailed structure of the syllabus based
on class progress.