Discrete Math

This course introduces students to the fundamental concepts of discrete mathematics, which form the mathematical backbone of computer science. Students will explore core topics such as sets, functions, relations, logic, and proofs, including techniques like induction and proof by contradiction. The course also covers methods of counting, permutations, combinations, and the pigeonhole principle, helping students understand how to approach complex problems in a logical and structured way. Learners will study modular arithmetic, recurrence relations, and the basic properties of graphs and trees, focusing on practical applications in computing. This course will emphasize the importance of developing precise reasoning, abstract thinking, and the ability to model and analyze real-world scenarios using formal mathematical tools. By the end of the course, students will know how to apply mathematical reasoning in a range of contexts, including algorithm analysis, data structures, and logical problem-solving.