COMPSCI70
Download as PDF
Discrete Mathematics and Probability Theory
Subject
COMPSCI
Course Number
70
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
4
Maximum
4
Grading Basis
Default Letter Grade; P/NP Option
Method of Assessment
Written Exam
Instructors
Papadimitriou, Rao, Sinclair, Trevisan, Vazirani, Wagner
American Cultures Requirement
No
Reading and Composition Requirement
None of the Reading and Composition Requirement
Prerequisite
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 the following the course(s) have already been completed.
-
Formats
Lecture, Discussion
Term
Fall and Spring
Duration (in weeks)
15
Minimum Hours
3
Maximum Hours
3
Outside Work Hours Min
9
Maximum Hours
9
Term
Summer
Duration (in weeks)
8
Minimum Hours
6
Maximum Hours
6
Minimum Hours
2
Maximum Hours
2
Outside Work Hours Min
14.5
Maximum Hours
14.5