 |
||||
 |
Home> Course Search> |
|||
|
Search Results |
|||
|
||||
| Discrete Mathematics and Probability Theory -- Computer Science (Engineering) (COMPSCI) 70 [4 units] | ||||
| Course Format: Three hours of lecture per week, or three hours of lecture and two hours of discussion per week. | ||||
| Prerequisites: Sophomore mathematical maturity, and programming experience equivalent to that gained in 3 or the Advanced Placement Computer Science A course. | ||||
| Credit option: Students will receive no credit for 70 after taking Mathematics 55. | ||||
| 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. | ||||
| (F,SP) Papadimitriou, Rao, Sinclair, Trevisan, Vazirani, Wagner |
||||
| |
||||
 |
||||
 |
||||
Copyright 2007 UC Regents. All rights reserved. Contact us. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * |
||||
