Fall 2021

Carnegie Mellon University

This course provides a comprehensive introduction to Discrete Mathematics, emphasizing the application of these concepts in Computer Science. Topics include counting, recurrence relations, combinatorial games, Polya theory, and more.

No data.

This course delves into key concepts in Discrete Mathematics and demonstrates their applications in Computer Science problem-solving. The subject matter spans basic counting, recurrence relations, and more advanced topics like combinatorial games and Polya theory of counting.

The aim of this course is to introduce the student to some of the most important ideas in Discrete Mathematics. A subsidiary goal is to show how these ideas can be used to solve problems in Computer Science.

No data

Course notes available at Course notes

No videos available

Homework and solutions available at Homework

No other materials available