The purpose of this course is to understand and use (abstract) discrete structures that are backbones of computer science. In particular, this class is meant to introduce logic, proofs, sets, relations, functions, counting, and probability, with an emphasis on applications in computer science.
At the end of the course, students should be able to:
- Understand the notion of mathematical logic & proofs and be able to apply them in problem solving.
- Solve problems which involve discrete data structures such as discrete relations and its associated properties.
- Apply basic counting techniques and combinatorics in the context of discrete probability.
- Demonstrate knowledge of fundamental concepts in graphs, trees and its properties using various modeling techniques.
- Solve problems on number theory and its applications.
Syllabus