Friday, January 13, 2012
Mathematics For Computer Science
This course provides an introduction to discrete mathematics, with a focus on topics that are relevant for computer science and engineering. Material is presented through a complete set of course notes and lecture slides, as well as in-class problems, problem sets, and exams, all with solutions. Topics covered in the course include sets, proofs, relations, modular arithmetic, graphs, state machines, counting, and discrete probability theory.
Instructors: Professor Albert Meyer, Professor Ronitt Rubinfeld
Start with: The Lecture Notes page for links to the slides used in lecture and the problems solved in class
Other Mathematics Books