CSE290F: 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.)

 

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

5 credits

Year	Fall	Winter	Spring	Summer

Comments

Formerly CMPS 290F

While the information on this web site is usually the most up to date, in the event of a discrepancy please contact your adviser to confirm which information is correct.