[ news  information  lectures  problem sets  links ]
CS55  Spring 2005
MW 2:454:00 in Andrew 157
Prof. Chen
5/17/2005: I've archived all of the notes and problem sets (ie,
most of the links below don't work) and am
only leaving up the syllabus for reference. If you're looking for the
material, you may be able to find a link to a more recent offering of
the class here or
here.
Please check here regularly for assorted announcements. You are
responsible for being aware of information posted here.
CS55 is an introduction to discrete mathematics for computer
scientists. In particular, we will study finite mathematical
structures and ways to build them, count them, and analyze them. The
topics and examples will be chosen to relate to concepts of interest
in the design and analysis of computer algorithms.
No programming experience is required (or assumed). However,
precalculus mathematics and an interest in applications of math
to computer science is a prerequisite.
CS55 satisfies the PAC 3 requirement.
The lectures are on Mondays and Wednesdays from 2:454:00 in Andrew 157.
The final is at 2PM on Tuesday, May 10.
Any topic that's listed for a date in the future should be taken as
tentative. Any topic that's listed for a date at least 2 days in the
past is what was actually covered in that lecture.
Week  Date  In class  Readings  Assignments due 
1  (Wed) 1/19  introduction, motivation, logic  

2  (Mon) 1/24  propositional logic  1.11.2 

(Wed) 1/26  predicate logic  1.31.4  ps1

3  (Mon) 1/31  topics in CS (intro to neural networks)
basic number theory 

(Wed) 2/2  proof techniques  2.12.2  ps2

4  (Mon) 2/7  more mathematical induction  2.2 

(Wed) 2/9  even more induction recurrences  2.4  ps3

5  (Mon) 2/14  proofs, algorithms  2.5 

(Wed) 2/16  asymptotics  pages 307311  ps4

6  (Mon) 2/21  review, miscellaneous  

(Wed) 2/23  Midterm I   "cheat sheet"

7  (Mon) 2/28  expandguesscheck, recursion tree
master method  

(Wed) 3/2  master method, sets  3.1  ps5

8  (Mon) 3/7  sets, counting  3.13.2 

(Wed) 3/9  counting  3.33.4  ps6

9  (Mon) 3/14 
No class  Spring Break

(Wed) 3/16   

10  (Mon) 3/21  counting, probability  3.5 

(Wed) 3/23  conditional probability, expected value  3.5  ps7

11  (Mon) 3/28  review   ps8

(Wed) 3/30  Midterm II   "cheat sheet"

12  (Mon) 4/4  compression  5.4 

(Wed) 4/6  functions, relations  4.1,4.4  ps9

13  (Mon) 4/11  functions, graphs  4.4, 5.1 

(Wed) 4/13  planarity, chromatic number, isomorphism, etc  5.1  ps10

14  (Mon) 4/18  Euler circuits, Hamilton cycles  6.2 

(Wed) 4/20  NP, connectivity  5.2, 6.4  ps11

15  (Mon) 4/25  trees, weighted graphs  5.2 

(Wed) 4/27  minimum spanning trees  6.3  ps12

16  (Mon) 5/2  graphs and the web   ps13

(Wed) 5/4  review  

"Computers do not solve problems, they execute
solutions"
Laurent Gasser