Computer Science and EngineeringCSE 290F Applications of Combinatorics

Combinatorial mathematics, including summation methods, working with binomial coefficients, combinatorial sequences (Fibonacci, Stirling, Eulerian, Harmonic, Bernoulli numbers), generating functions and their uses, Bernoulli processes, and other topics in discrete probability. Oriented toward problem solving, applications mainly to computer science, but also physics. (Formerly Computer Science 290F.)

Requirements

Prerequisite(s): CSE 16 and AM 10. Enrollment is restricted to graduate students and upper-division undergraduates.

Credits

5

Repeatable for credit

Yes