CMSC 57 - Discrete Mathematical Structures in Computer Science II
Course Description
Principles of combinatorics, probability, algebraic systems, and graph theory
Course Learning Outcomes
After completion of the course, the student should be able to:
- perform combinatorial analysis to solve counting problems;
- apply the theory of probability in order to compute the probability of the given event for a given
random experiment;
- demonstrate how abstract mathematical ideas like graphs, trees, and finite-state machines relate to
real-world computational problems
Course Outline
UNIT 1. Counting basics
UNIT 2. Advanced Counting Techniques
UNIT 3. Discrete Probability
UNIT 4. Graphs
UNIT 5. Trees