Course Description
Discrete Mathematics
Logic and Proof Techniques
- Propositional and predicate logic
- Logical equivalences and arguments
- Proof methods: direct, contrapositive, contradiction, induction
Set Theory and Functions
- Sets, subsets, operations on sets
- Functions: one-to-one, onto, inverses, composition
- Relations and equivalence relations
Combinatorics and Probability
- Counting principles: permutations and combinations
- Basic probability concepts and applications
- Inclusion-exclusion principle
Graph Theory and Networks
- Graph terminology and types of graphs
- Eulerian and Hamiltonian paths
- Graph coloring and applications
Algorithms and Complexity
- Algorithm basics and pseudocode
- Searching and sorting algorithms
- Introduction to computational complexity and Big-O notation