Chapter 1: Logic and Proof:
1,2: Propositions. Conditional Propositions. Logical Equivalence.
3: Quantifiers. Generalised De Morgan’s Laws.
4, 5: Proofs: Definitions, Contradiction, Contrapositive, Cases, Arguments.
6,7: Mathematical Induction.

Chapter 2: Sets, Relations and Functions:
1,2: Set Properties.
3,4: Relations: Properties (RAST), Orders, Inverses, Matrices.
5: Functions

Chapter 3: Algorithms:
1: Introduction and Notation.
2: Euclidean Algorithm.
3: Recursive Algorithms.
4,5,6: Complexity of Algorithms, Worst Case Euclidean.

Chapter 5: Recurrence Relations:
1: Definitions, Examples: Compound Interest, Velocity, n-bit Strings.
2: Towers of Hanoi Example. Solution by Iteration.
3,4: Solution by Characteristic Equation.
5: Analysis of Algorithms: Selection Sort, Binary Search, Merging Two Sequences.
6: Merge Sort

Chapters 6 & 7: Graphs and Trees:
1: Introduction to Graphs: Path, Directed, Weighted, Similarity.
2: Special Graphs: Complete, Bipartite. Paths and Cycles.
3: Euler Cycles. Tree Definitions.
4: Huffman Code. Tree Terminology.
5: Spanning Trees: Breadth and Depth First, Minimal Spanning Trees.
6: Binary Trees.
7: Tree Traversals.

Chapter 9: Combinatorial Circuits:
1: Gates and Boolean Expressions.
2: Properties of Combinatorial Circuits. Miniterms. Disjunctive Normal Form.
3: Minimal Representation. Karnaugh Maps.
4: Karnaugh Maps (contd). Algebra for d.n.f. Functionally Complete.
5: Half Adder, Full Adder.