Education and Career Forum

It includes fundamental counting principles, permutations and combinations, binomial theorem, inclusion and exclusion principles, derangements, function generation, integer partition, summation operator, recurrence relations (first and second order), methods of generating functions, introduction to graphs, definitions, paths, cycles, planar graphs, Euler’s tours and formula, kuratowski’s theorem, Hamiltonian graphs, trees and properties, weighted trees, prefix codes, sorting, articulation points and biconnected components, algorithms (Bellman-Ford, Dijkstra’s shortest path, FloyedWarshall).

Paper Pattern: Question Paper is divided into 2 parts A and B. In part A, 5 questions will be given which are subdivided into 3 each and carry 2 marks each. No choice will be provided in the part A. In part B, 5 more questions will be given which are subdivided into 2 each. Alternatively, any one out of two can be attempted. Each of them carry 4 marks. All are subjective type.

Time allotted and Maximum Marks: The exam is of 3 hours and the full marks for this paper is 50.

Key Points: Majority of the part A will be occupied with definitions and small theorems. In part B mostly the theorems were being asked.