Mathematical Foundations of Information Technology

Unit-wise Important Topics for Preparation

Date: 25-Mar-21

Unit I

1. Truth tables
2. Logical equivalence
3. Quantifiers, English sentence to quantified expressions and predicates
4. Rules of Inference.

Unit II

1. Relations – definitions, properties and examples.

2. Equivalence Relations and Partial Ordering Relations.
3. Representation of relations using matrices and digraphs.
4. Hasse diagrams
5. Functions – definitions, types of functions, function composition

Unit III

1. Sum rule, product rule, and examples/exercise on permutations/combinations.

2. Permutations and combinations with repetition –( bars and stars method for
combinations with repetitions)
3. Binomial theorem, finding coefficients of variables in binomial expression
4. Pigeonhole principle: definition, generalized pigeonhole principle, examples.
5. Principle inclusion and exclusion – formula, examples, and alternate form of PIE

Unit IV

1. Solving homogeneous recurrence relations of degree one, two and three.

2. Solving non-homogeneous recurrence relations
3. Generating functions – counting problems, finding coefficients, closed form for a
given series.

Unit V

1. Graphs – definitions, terminology, types of graphs

2. Graph representations – Adjacency list and adjacency matrix
3. Graph Isomorphism – definitions, examples.
4. DFS and BFS
5. Prim’s and Kruskal’s algorithm to obtain Minimum Cost Spanning Trees.
6. Euler’s formula for planar graphs.
7. Euler path/circuit and Hamiltonian path/circuit
8. Chromatic Number, graph colouring examples.

MD Asrar Ahmed.