MTH-2500 - Introduction to Discrete Math (3)

Prerequisite: MTH 1200

On completion of this course students will work as individuals and small teams to explain and apply the basic methods of discrete (noncontinuous) mathematics in computer science and use these methods in subsequent courses in the design and analysis of algorithms, computability theory, software engineering, and computer systems. Students will reason mathematically about basic data types and structures such as numbers, sets, graphs and trees used in computer algorithms and systems. Rigorous definitions and conclusions from merely plausible ones are distinguished. Computational processes are modeled and analyzed using analytic and combinatorial methods. Applications include principles of discrete probability to calculate probabilities and expectations of simple random processes.

View Course Sections