CS174 Course Description
This is an upper-division course on
discrete mathematics for computer scientists. Course content includes:
Predicate logic. Congruences, primality and cryptography. Permutations,
partitions and combinations. The principle of inclusion and exclusion.
Some results from Ramsey theory. Probability theory, expectation and
variance, Chebychev's inequality, Chernov bounds. Birthday paradox,
coupon collector's problem. Recurrence relations. Universal hashing,
random number generation, random graphs and probabilistic existence
bounds.
Administrative Details
- Lecture: MWF 11-12 in 101 Moffitt
-
- Section 101: Th 9-10 in 6 Evans
-
- Section 102: Th 11-12 in 75 Evans
-
- Section 103: Tu 3-4 in B1 Northgate
-
- Prerequisites: Math 55, CS170
-
- Credit: 4 units
-
Sections will meet in the first week.
- Instructor: John Canny, jfc@cs, 529 Soda, 642-9955
-
- Office hours: Tues 2-3, Weds 4-5
-
- TA: Edouard Servan-Schreiber, edss@eecs, 642-5840, 464 Soda
-
- Course Secretary: Liona Frankel, liona@cs, 719 Soda
Hall, 642-9575
-
Grading
Letter Grades
90% and above A+, 85-90% will be an A, decreasing in 5% increments
down to 35-40% for D-, and 0-35%, an F.
Late Policy
20% off the value of a homework for each day late. Your lowest homework
score will be dropped. Homeworks are to be handed in in class, or in the
TA's mailbox or class mailbox by 5pm on the due date.
Course Text:
"Discrete Mathematics" by H.F. Mattson, Jr. John Wiley and Sons publ.
Supplemented by notes available online and handed out in class.
Class Home Page:
Is http://www-inst.eecs.berkeley.edu/~cs174