CMSC 27100
Discrete MathematicsPrerequisites: CMSC 15300, or placement into MATH 15100 or equivalent. This is a directed course in mathematical topics and techniques needed by students taking CMSC 27200. Required of computer science concentrators.
Catalog Description: This course emphasizes mathematical discovery and rigorous proof, which are illustrated on a refreshing variety of accessible and useful topics. Basic counting is a recurring theme and provides the most important source for sequences, another recurring theme. Further topics include proof by induction; recurrences and Fibonacci numbers; graph theory and trees; number theory, congruences, and Fermat's little theorem; counting, factorials and binomial coefficients; combinatorial probability; random variables, expected value and variance; and limits of sequences, asymptotic equality, rates of growth.
Instructors: C. KlivansQuarter offered: Autumn
Last Verified by Sharon Salveter on 8 April, 2003.