Undergraduate Computer Science

CS U200: Discrete Structures

Introduces the mathematical structures and methods that form the foundation of computer science. Discusses structures such as sets, tuples, sequences, lists, trees, and graphs. Discusses functions, relations, ordering, and equivalence relations. Discusses inductive and recursive definitions of structures and functions. Discusses principles of proof such as truth tables, inductive proof, and basic logic. Finally, discusses the counting techniques and arguments needed to estimate the size of sets, the growth of functions, and the space-time complexity of algorithms.
Prerequisites:
A solid foundation in basic mathematical thinking.
Credit hours: 4 SH