Documente Academic
Documente Profesional
Documente Cultură
Pilani Campus
Instruction Division
Date: 02/08/2017
In addition to Part-I (General Handout for all courses appended to the Timetable) this portion gives further
specific details regarding the course.
1. COURSE DESCRIPTION:
Sets & operation on sets; relations & equivalence relations; Proving techniques & strong form of
mathematical induction; principle of inclusion & exclusion, pigeonhole principle; recurrence relations &
generating functions; digraphs & graphs, graph isomorphism & sub-graphs, spanning trees, Euler &
Hamiltonian graphs, planar graphs, chromatic numbers & coloring; graph algorithms, algebraic structures,
Lagrange theorem, Finite state automata.
3. TEXT BOOK:
T1: Mott , Kandel, & Baker : Discrete Mathematics for Computer Scientists & Mathematicians, Pearson
Education, First Indian Print, 2015.
4. REFERENCE BOOKS:
R1: C L Liu: Elements of Discrete Mathematics, McGraw Hill, 2e, 1985
R2: K H Rosen: Discrete Mathematics & its Applications, TMH, 7e, 2011.
5. COURSE PLAN:
Modelling problems with Recursion and its applications R2: Ch 4.2-4.3 6-7
Recurrence relations & solving recurrence relations with generating
T1:Ch.3.2-3.4 8-9
functions
Method of characteristic roots for solving recurrence relations T1:Ch.3.5 10-11
Solving inhomogeneous & nonlinear recurrence relations T1:Ch.3.6 12-13
Relations & directed graphs, equivalence relations, partially ordered set,
T1:Ch. 4 14-17
totally ordered set, Hasse diagrams, well ordered set, applications
Graphs: Basic concepts T1:Ch.5.1 18-20
Isomorphism, Subgraphs, & special graphs T1:Ch.5. 2 21-23
Trees, spanning trees, Binary & directed trees T1:Ch.5.3-5.6 24-26
Planar graphs, multigraphs & Eulerian & Hamiltonian graphs T1:Ch.5.7-5.10 27-29
Algorithms and Graph Algorithms: Algorithms, the Growth of functions, R2: Ch 3.1 3.3
Complexity of Algorithms, Minimum Spanning Tree, Shortest Path, Graph 30-32
R2: Ch 8, 9
Matching, Graph Coloring
Group, group isomorphism, cyclic groups, subgroups & Lagrange theorem.
R1:Ch.11 33- 37
Rings, fields, & finite fields
Introduction to Finite State Automata R2: 12.2 12.4 38-41
6. EVALUATION SCHEME:
7. CHAMBER CONSULTATION HOUR: Wednesday 9th Hour (04:00 PM to 04:50 PM) in Chamber# 6120-H.
8. MAKE-UP Policy: For a component other than the Comprehensive Examination, prior permission (only in
genuine cases) is to be taken from the Instructor-In-Charge. For the make-up of comprehensive
examination one need to apply to the Dean, Instruction Division.
9. NOTICES: All notices related to the course will be put up on the course web- page (usually hosted on
Nalanda, the LMS server for on-campus students).
Instructorin-Charge
CS F222
_