|
Tutoring
Tutoring Schedule
Course Surveys
EE Professors
EE Teaching Assistants
EE Courses
CS Professors
CS Teaching Assistants
CS Courses
Online Exams
HKN Online Exams
More Student Services
Undergraduate Notes
Graduate School Info
CS GRE Review Notes
Industrial Relations
Useful Links
|
| Title | Discrete Mathematics and Probability Theory |  |
|---|
| Instructor in Charge | Christos Papadimitriou |
|---|
| Units | 4 |
|---|
| Prerequisites | Sophomore mathematical maturity, and programming experience equivalent to that gained in 3 or the Advanced Placement Computer Science A 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. |
|---|
| Exam Files | Available |
|---|
Hint: You can click on the colored rating bars to see detailed statistics on a particular rating.
Powered by GoodProfOrNot.
|