Discrete Mathematics for Cross-Disciplinary

Counting in finite sets; Binomial Theorem. Asymptotic order of functions; exponential, polynomial, and logarithmic relationships. Algorithm as a functional input-output map; specification, elementary analysis of running time. Recursion in functions, algorithms, and trees. Recurrences in modeling and algorithm analysis; linear recurrences; Master Theorem. All topics will center around appropriate problem solving exercises. Not open to CSCI majors and minors.

Credits

3 credits

Course Code

CSCI 120