Prerequisites: CS 010; CS 011/MATH 011; MATH 009C or MATH 09HC
Description: Study of discrete mathematical structures with emphasis on applications to computer science. Topics include asymptotic notation, generating functions, recurrence equations, elements of graph theory, trees, algebraic structures, and number theory.
Cross-listing: Cross-listed with CS 111.