COMPSCI70
Download as PDF
COMPSCI 70 - Discrete Mathematics and Probability Theory
Subject
COMPSCI
Course Number
70
Department
Course Level
Undergraduate
Course Title
Discrete Mathematics and Probability Theory
Course Description
Logic, infinity, and induction; applications include undecidability and stable marriage problem. Modular arithmetic and GCDs; applications include primality testing and cryptography. Polynomials; examples include error correcting codes and interpolation. Probability including sample spaces, independence, random variables, law of large numbers; examples include load balancing, existence arguments, Bayesian inference.
Minimum Units
4
Maximum Units
4
Grading Basis
Default Letter Grade; P/NP Option
Method of Assessment
Written Exam
Instructors
Papadimitriou, Rao, Sinclair, Trevisan, Vazirani, Wagner
Prerequisites
Sophomore mathematical maturity, and programming experience equivalent to that gained in 3 or the Advanced Placement Computer Science A course.
Repeat Rules
Course is not repeatable for credit.
Credit Restriction Courses. Students will receive no credit for this course if following the course(s) have already been completed.
-
Formats
Lecture, Discussion
Term
Fall and Spring
Weeks
15 weeks
Weeks
15
Lecture Hours
3
Lecture Hours Min
3
Lecture Hours Max
3
Outside Work Hours
9
Outside Work Hours Min
9
Outside Work Hours Max
9
Term
Summer
Weeks
8 weeks
Weeks
8
Lecture Hours
6
Lecture Hours Min
6
Lecture Hours Max
6
Discussion Hours
2
Discussion Hours Min
2
Discussion Hours Max
2
Outside Work Hours
14.5
Outside Work Hours Min
14.5
Outside Work Hours Max
14.5