This course introduces the advanced concepts of discrete mathematics as they apply to computer science. Topics include basics of counting, discrete probability, recurrence relations, graphs and trees.
Course Outcomes (COs): At the of the course, the students are able to:
CLO1. Solve real-world computing problems that require mapping to permutations, combinations of a set, and modular arithmetic.
CLO2. Compute the event probabilities using counting and Bayes Theorem of a sample computing problem
CLO3. Solve equations involving recurrence and relate them to recursive algorithms
- Enrolled students: No students enrolled in this course yet