|
Courses
CS 294-5 Great Algorithms -- Computer Science (Engineering) (COMPSCI) 294-5 [3 units]
Description:See website.
CS 174 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.
CS 199 Supervised Independent Study -- Computer Science (Engineering) (COMPSCI) 199 [1-4 units]
Course Format: Individual conferences.
Prerequisites: Consent of instructor and major adviser.
Credit option: Enrollment is restricted; see the Introduction to Courses and Curricula section of this catalog.
Grading Option: Must be taken on a passed/not passed basis.
Description: Supervised independent study. Enrollment restrictions apply.
(F,SP) Staff
CS 299 Individual Research -- Computer Science (Engineering) (COMPSCI) 299 [1-12 units]
Course Format:
Credit option: Course may be repeated for credit.
Description: Investigations of problems in computer science.
Back to top
|