[ news | information | lectures | problem sets | links ]

CS55 - Spring 2005
MW 2:45-4: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.
  • April 26: The final is at 2PM on Tuesday, May 10. It will be closed book, but open 2 double-sided 8.5x11" pages of notes in your own handwriting.
  • April 26: Corrected version of ps12 posted.
  • March 30: The second midterm will be in class on Wednesday, March 30. It will be open one double-sided 8.5x11" page of notes in your own handwriting.
  • February 10: The first midterm will be in class on Wednesday, February 23. It will be open one double-sided 8.5x11" page of notes in your own handwriting.
  • February 3: Shiri will have office hours on Mondays from 7-8:30PM in the Unix lab (Andrew 252)
  • Information

    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:45-4:00 in Andrew 157.

    The final is at 2PM on Tuesday, May 10.

  • Administrivia <ps><pdf>
  • Lectures

    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.1-1.2
    (Wed) 1/26 predicate logic 1.3-1.4 ps1
    3 (Mon) 1/31 topics in CS (intro to neural networks)
    basic number theory
    (Wed) 2/2 proof techniques 2.1-2.2 ps2
    4 (Mon) 2/7 more mathematical induction 2.2
    (Wed) 2/9 even more induction
    2.4 ps3
    5 (Mon) 2/14 proofs, algorithms 2.5
    (Wed) 2/16 asymptotics pages 307-311 ps4
    6 (Mon) 2/21 review, miscellaneous
    (Wed) 2/23 Midterm I "cheat sheet"
    7 (Mon) 2/28 expand-guess-check, recursion tree
    master method
    (Wed) 3/2 master method, sets 3.1 ps5
    8 (Mon) 3/7 sets, counting 3.1-3.2
    (Wed) 3/9 counting 3.3-3.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

    Problem Sets

  • PS1 handed out 1/19, due 2:45PM 1/26 <tex> <ps> <pdf>
  • PS2 handed out 1/26, due 2:45PM 2/2 <tex> <ps> <pdf>
  • PS3 handed out 2/2, due 2:45PM 2/9 <tex> <ps> <pdf>
  • PS4 handed out 2/9, due 2:45PM 2/16 <tex> <ps> <pdf>
  • PS5 handed out 2/23, due 2:45PM 3/2 <tex> <ps> <pdf>
  • PS6 handed out 3/2, due 2:45PM 3/9 <tex> <ps> <pdf>
  • PS7 handed out 3/9, due 2:45PM 3/23 <tex> <ps> <pdf>
  • PS8 handed out 3/23, due 2:45PM 3/28 <tex> <ps> <pdf>
  • PS9 handed out 4/4, due 2:45PM 4/6 <tex> <ps> <pdf>
  • PS10 handed out 4/6, due 2:45PM 4/13 <tex> <ps> <pdf>
  • PS11 handed out 4/13, due 2:45PM 4/20 <tex> <ps> <pdf>
  • PS12 handed out 4/20, due 2:45PM 4/27 <tex> <ps> <pdf>
  • PS13 handed out 4/27, due 2:45PM 5/2 <tex> <ps> <pdf>
  • Links

  • some pages discussing LaTeX, the best way to format anything containing mathematical equations.
  • A simple latex document that creates the file <ex1.pdf>
  • A fast introduction to LaTeX written by Tony Roberts.
  • The Not So Short Introduction to LaTeX2e, also known as LaTeX2e in 129 minutes by Oetiker, Partl, Hyna, and Schlegl. (This is an evolving document, at the moment they're on version 4.12, dated April 2003.)

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