Discrete Mathematics and Probability Theory
Fall 2013

Previous sites: http://inst.eecs.berkeley.edu/~cs70/archives.html

Instructor and Lecture


Dates to remember:


CS70 will be using Pandagrader to manage homework submissions. You should by now have received an email with instructions from Pandagrader. If you haven't, email help@pandagrader.com.

Every week, there will be two homework parties attended by some of the TAs and readers one will be from 2-5 on Thursday and one will be held on Friday from 1:30-4:30pm. Both will take place in the Wozniak Lounge. Feel free to drop by for any help on homework and/or other questions you might have.

Homework Regrade Policy:

You may ask for a regrade on particular questions or the entire homework using pandagrader if you feel your homework was not graded correctly.
Please don't abuse the system, though, as we may be forced to regrade entire homework with stricter partial credit policies.

Other Important Homework Policies:

Homework Assignments:

Practice Problems



Lecture Slides

Discussion Handouts

Online Homework

The Online homework is meant to help you understand the material better. Therefore there is no penalty for wrong submissions.

You should start working on your online homework as early as possible after it is posted, and in any case by the due date Fridays at 1 pm. It will help you follow the material in lectures that week. It will also make it easier for you to work on the written homework.

To access the online homework use this address: http://cs70-anari.rhcloud.com.

Grading Policies:

The final grad will be calculated using the following percentages:

Office Hours:

Feel free to attend any of the office hours listed in the table below:

Discussion Sections:

You may swap between discussion sections as long as there is room in your new discussion section.

Links and GSI Contact Info:

The best way to find more information about the course or get in touch with a TA is to use piazza.

If you are human feel free to replace any --at-- and --dot-- with the obvious punctuation marks below:


Discrete mathematics and probability theory provide the foundation for many algorithms, concepts, and techniques in the field of Electrical Engineering and Computer Sciences. Induction is closely tied to recursion and is widely used, along with other proof techniques, in theoretical arguments that are critical to understanding the foundations of many things from algorithms to control to learning to signal processing to communication to artificial intelligence. Similarly for modular arithmetic and probability theory. EECS70 will introduce you to these and other mathematical concepts. By the end of the semester, you should have a firm grasp of the theoretical basis of these concepts and their applications to general mathematical problems. In addition, you will learn how they apply to specific, important problems in the field of EECS.

This course is divided into five main units, each of which will introduce you to a particular mathematical concept as well as its applications. The units are as follows:

These units will now be described in more detail.

Induction Proofs

Modular Arithmetic


Counting and Probability

Diagonalization, Self-Reference and Logic