Unit 1
Introduction to propositional logic, equivalence, quantifiers, types of proof, and common mistakes.
Duration: 3 Hours
Discrete Mathematics (MTH401)
Unit 2
Recurrence relations, homogeneous and non-homogeneous solutions, generating functions.
Duration: 2 Hours
Unit 3
Inclusion-exclusion, pigeonhole principle, relations and properties, lattices, Hasse diagrams.
Duration: 2 Hours
Unit 4
Graph types, representations, isomorphism, connectivity, and Dijkstra’s algorithm.
Duration: 2 Hours
Unit 5
Planar graphs, graph coloring, trees, spanning trees, decision trees, and expression notations.
Duration: 2 Hours
Unit 6
Modular arithmetic, GCD, Euclidean algorithm, congruence, CRT, and cryptography basics.
Duration: 2 Hours