Discrete Mathematics
Definition: Discrete Mathematics equips students with mathematical foundations essential for computer science, emphasizing logical reasoning, proofs, sets, counting, algebraic structures, and graph theory.
Available PYQs:
2019
2020
2024
Praxian Analysis 2025
To add PYQs: Click Here
Detailed Syllabus
Module 1: Logic and Proofs
- Propositional logic, predicates.
- Proof techniques.
Module 2: Sets and Relations
- Operations, functions.
- Equivalence, partial orders.
Module 3: Counting
- Permutations, combinations.
- Pigeonhole principle.
Module 4: Graph Theory
- Graphs, paths, trees.
- Connectivity, coloring.
Module 5: Algebraic Structures
- Groups, rings basics.
- Boolean algebra.
Module 6: Recurrences
- Solving recurrences.
- Generating functions.