UNIT 1:
Propositional equivalences
Predicates and Quantifiers
Proof methods and strategy
Proof methods and strategy
UNIT 2:
Inclusion and exclusion principle and its applications.
Strong induction and well ordering
The basics of counting – The pigeon hole principle
Strong induction and well ordering
Permutations and combinations
Solving linear recurrence relations
Solving linear recurrence relations
UNIT 3:
Graph terminology and special types of graphs
Graph terminology and special types of graphs
Matrix representation of graphs and graph isomorphism
Matrix representation of graphs and graph isomorphism
Matrix representation of graphs and graph isomorphism
UNIT 4:
Normal subgroup and cosets
Normal subgroup and cosets
UNIT 5:
Partial ordering – Posets
Lattices as algebraic systems
Direct product and homomorphism