 |
||||
 |
Home> Course Search> |
|||
|
Search Results |
|||
|
||||
| Combinatorics and Discrete Probability -- Computer Science (Engineering) (COMPSCI) 174 [4 units] | ||||
| Course Format: Three hours of lecture and one hour of discussion per week. | ||||
| Prerequisites: 170. | ||||
| Description: Permutations, combinations, principle of inclusion and exclusion, generating functions, Ramsey theory. Expectation and variance, Chebychev's inequality, Chernov bounds. Birthday paradox, coupon collector's problem, Markov chains and entropy computations, universal hashing, random number generation, random graphs and probabilistic existence bounds. | ||||
| (F,SP) Bartlett, Papadimitriou, Sinclair, Vazirani |
||||
| |
||||
 |
||||
 |
||||
Copyright 2007 UC Regents. All rights reserved. Contact us. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * |
||||
