BIRLA INSTITUTE OF TECHNOLOGY & SCIENCE, PILANI

INSTRUCTION DIVISION
FIRST SEMESTER 2016-2017
COURSE HANDOUT(PART-II)
Date: 01/08/2016
In addition to Part-I (General Handout for all courses appended to the Timetable) this portion
gives further specific details regarding the course.
Course No.
Course Title
Instructor In Charge
Team of Instructors

: CS F222
: Discrete Structures for Computer Science
: NAVNEET GOYAL (goel@)
: Mukesh Kumar Rohil (rohil@),
Ashutosh Bhatia (ashustosh.bhatia@)

1. COURSE DESCRIPTION:
Sets & operation on sets; relations & equivalence relations; weak & strong form of mathematical
induction; principle of inclusion & exclusion, pigeonhole principle; recurrence relations &
generating functions; digraphs & graphs, graph isomorphism & subgraphs, spanning trees, Euler
& Hamiltonian graphs, planar graphs, chromatic numbers & colouring; groups, finite groups,
Lagrange theorem, Rings, Fields, & Finite State Machines.
2. SCOPE & OBJECTIVE:
To develop logical and mathematical concepts necessary to appreciate computational systems. &
study of concepts, techniques, and skills necessary to comprehend the structure of problems
encountered in design and analysis of algorithms. To provide mathematical foundations for
courses in computer science that rely upon the comprehension of formal abstract concepts. To
study recursion and to write recursive definitions for certain sequences and collections of objects.
Graphs, directed graphs, planar graphs & their relevance to circuit design & map coloring
problems. Basic concepts of group theory and Finite State Machines.
3. TEXT BOOK:
Mott, Kandel, & Baker : Discrete Mathematics for Computer Scientists & Mathematicians
PHI, 2e, 2002.
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.
R3. Douglas West: Introduction to Graph Theory, Pearson, 2e, 2001.
5. COURSE PLAN:
Subject
Introduction & Overview

Ref.
-

Lecture #
1

Mathematical Induction, strong form of mathematical induction and

other proving techniques

Ch.1 (1.8, 1.10)

R2: Ch. 1, Ch. 4

2-3

Set Theory; Relations, equivalence relations, partially ordered set,

totally ordered set, Hasse diagrams, well ordered set; Functions

Ch.1 (1.2, 1.3), 4

R1: Ch. 1, 4
R2: Chs. 2, 7

4-9

Combinatorics&Counting

10

Recurrence relations & recursive algorithms: modelling, solving

recurrence relations with generating functions

Ch.2
R1. Ch. 3
R2. Ch. 5
Ch.3 (3.2-3.4)
R2. Ch. 4

Method of characteristic roots for solving recurrence relations

Ch.3 (3.5)

15

Solving inhomogeneous & nonlinear recurrence relations

Graphs: Basic concepts & modelling

Ch.3 (3.6)
Ch. 4
Ch.5 (5.1, 5.2)
R1: Ch. 5
R2: Ch. 8
R3: Ch. 1
Ch. 7
R2: Ch. 8
R3: Ch. 4

16-17
18-20

Ch.5 (5.3 5.6)

R1: Ch. 6
R2: Ch. 9
R3: Ch. 2
Ch.5 (5.7- 5.10)
R1: Ch. 5
R2: Ch. 8
R3: Ch. 6
Ch. 5 (5.11, 5.12)
R2: Ch. 8
R3. Ch. 5
R1: Ch. 11
R2: Ch. 11
Ch. 6
R2: Ch. 12

26-28

Connectivity and paths: cuts and connectivity, k-connected graphs,

network flows
Trees, spanning trees, Binary & directed trees

Planar graphs, multigraphs & Eulerian & Hamiltonian graphs

Graph Coloring & Matching Problems

Group, group isomorphism, cyclic groups, subgroups & Lagrange
theorem. Rings, fields, & finite fields
Finite State Machines

11-14

21-25

29-32

33-35
36-38
39-40

6. EVALUATION SCHEME:
Component
Midsem Test
Quiz +
Modelling
Problem
Comprehensive

Duration
90 mins.
50 mins.

Weightage (%)
35
15+5

3 hours

45

Date & Time

TBA

Remarks
CB
CB
12/12 (FN) - Partly Open

7. CHAMBER CONSULTATION HOUR: To be announced in class

8. MAKE-UP Policy: Prior permission needed for make-up.
9. NOTICES: All notices related to the course will be put up on NALANDA and CSIS NBs.

Instructorin-charge
CS F222