BIRLA INSTITUTE OF TECHNOLOGY & SCIENCE, PILANI
INSTRUCTION DIVISION
FIRST SEMESTER 2018-2019
COURSE HANDOUT(PART-II)
Date: 01/08/2018
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. : CS F222
Course Title : Discrete Structures for Computer Science
Instructor In Charge : NAVNEET GOYAL (goel@)
Instructor : Ashutosh Bhatia (ashustosh.bhatia@)
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. Trees and their applications. Basic algebraic structures and their applications.
3. TEXT BOOK:
Mott, Kandel, & Baker : Discrete Mathematics for Computer Scientists & Mathematicians ,
PHI, 2e, 2002.
4. REFERENCE BOOKS:
R1. K H Rosen: Discrete Mathematics & its Applications, TMH, 7e, 2011.
R2. Douglas West: Introduction to Graph Theory, Pearson, 2e, 2001.
S.No Topic Sub-Topics Description Ref. Lecture
#
1. Overview Course • Introduction 1-2
Overview and • Importance of Discrete
Introduction Structures
2. Induction Induction • Mathematical Induction Ch.1 (1.8, 1.10) 3-4
and • Using mathematical induction to R1: Ch. 4.1, Ch.
Recursion prove the theorems or 4.2
statements
• Strong induction and well
ordering
Recursion • Recursive or Inductive R1: Ch. 4 (4.3, 5-7
definitions of functions, sets, 4.4)
and structures
• Structural induction, proofs
using structural induction
• Problem solving using Recursion
• Recursive Algorithms
• Recursion vs Iteration
3. Relations Properties of • Mathematical definitions of Ch.4 (4.1, 4.2, 8-9
Relations relations 4.5)
• n-ary relations R1: Ch. 7 (7.1,
• Properties: reflexive, symmetric, 7.2)
transitive, antisymmetric, and
asymmetric
• Operations on Relations
Representing • Matrices Ch. 4.7 10-11
Relations • Diagraphs R1: Ch. 7.3
Closures of • Reflexive, Symmetric, and Ch. 4.6 12-14
Relations Transitive closures R1: Ch. 7.4
• Warshall’s Algorithm
Equivalence • Equivalence Relations and Ch. 4 (4.3, 4.4) 15-18
Classes and Classes R1: Ch. 7.3
Partial Ordering • Partial Ordering Relations
• Hasse Diagram
4. Graphs Introduction to • Basic Concepts Ch. 5.1 19-20
Graph Theory • Special Graphs R1: Ch.8 (8.1,
• Elementary Theorems on Graphs 8.2, 8.3)
• Graph Representation: Adjacency
& Incidence Matrices
• Problem modeling
Graph • Path and Cycles Ch. 5 (5.1, 5.2) 21-25
Isomorphism • Isomorphism in Graphs R1: Ch. 8 (8.3,
and Connectivity • Connected graphs, connected 8.4)
components, cut-vertices, and
cut-edges
• Applications
Euler and • Definitions, Conditions (necessary Ch. 5 (5.9, 5.10) 26-27
Hamiltonian and sufficient) for existence of R1: Ch. 8.5
Graphs Euler path and Hamiltonian cycles
Planar Graphs • Planar Graphs, Euler formula for Ch. 5 (5.7, 5.11) 28-31
and Graph planer graphs, characterization of R1: Ch. 8 (8.7,
Coloring planar graphs, 8.8)
• Graph Coloring: Vertex and Edge
coloring, Chromatic graphs
chromatic number. Basic bounds
on chromatic number. Five color
theorem
• Applications of Graph planarity
• Applications of graph coloring
Matching • Matching and Covering in Bi- R2. Ch. 3 32-33
partite graph, Perfect Matching,
• Applications
Graph • Graph Traversal: BFS, DFS R1: Ch. 8.6 34-36
Algorithms • Spanning Tree: Prim, Kruskal
• Shortest Path: Dijkstra, Bellman
Ford
5. Trees Introduction • Introduction, Application, Ch. 5.3 37-38
Terminology and Theorems, Tree R1: Ch. 9.1
Traversal Algorithms
Spanning Trees • Spanning and Minimum Spanning Ch. 5.4 39
Tree R1: Ch. 9.4
6. Algebraic Introduction to • The structure of algebra, Types of R1: Ch. 11 (11.1, 40-42
Structures Algebraic algebraic systems: Semi-group, 11.2, 11.3, 11.4,
Structures monoid, group, generator of a 11.5)
group
• Rings, Fields, & Vector Spaces
EVALUATION SCHEME:
Component Duration Weightage (%) Date & Time Remarks
Midsem Test 90 mins. 30 10/10 CB
4.00 – 5.30 pm
Quiz + Modelling 45 mins. 15+15 13/09 (Th. 2) CB
Problem 25/10 (Th. 2)
Comprehensive 3 hours 40 05/12 (AN) Partly Open
7. CHAMBER CONSULTATION HOUR: Sec. 1 (MW 5.45 - 6.30 PM), Sec. 2 (MWF 5.00 – 5.45 PM)
8. MAKE-UP Policy: Prior permission needed for make-up.
9. NOTICES: All notices related to the course will be put up on NALANDA.
Instructor–in-charge
