BITS PILANI, DUBAI CAMPUS

ACADEMIC-UNDERGRADUATE STUDIES DIVISION

First Semester 2021 – 2022
Course Handout (Part – II)

Date: 05-Sep-2021
In addition to Part I (General Handout for all courses appended to the Time Table) this portion gives further
specific details regarding the course.

Course No. : CS F222 (3 0 3)

Course Title : Discrete Structures for Computer Science
Instructor-in-charge : A Somasundaram
Course Instructors : A Somasundaram, S Baskaran

Scope and Objective of the Course:

To develop logical and mathematical concepts necessary to appreciate computational systems and 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
those rely upon the comprehension of formal abstract concepts. To study recursion and to write recursive
definitions for certain sequences and collections of objects. To study Graphs, directed graphs, planar
graphs & their relevance to circuit design & map coloring problems and basic concepts of group theory.
Course Pre/Co- requisite (if any)& Catalogue / Bulletin Description: Given in the Bulletin 2021– 2022

Study Material:
Text Book:
Mott , Kandel, & Baker : Discrete Mathematics for Computer Scientists & Mathematicians, Pearson, 2e,
2015
Reference books:
C L Liu: Elements of Discrete Mathematics, McGraw Hill, 2e, 1985
K H Rosen: Discrete Mathematics & its Applications, TMH, 6e, 2007.
Course Plan / Schedule:
Sl.# Learning objectives Topics to be covered Chapter No No. of
lectures
Sets and Operations of Sets, Self
1 Introduction & Overview Ch.1 art. 1-3
Relations and Functions study
Pigeonhole principle,
Ch.1 art.7 &10 3
2 Mathematical Induction, Strong Methods of Proof
Form of Mathematical Induction
Principles of inclusion &
3 Elementary Combinatorics Ch. 2 art 8 3
exclusion,
Calculating Coefficient of
4 Generating Functions
Generating Function Ch.3 art. 2 2
Recurrence Relations & Solving
3
5 Recurrence Relations with Recurrence Relations Ch.3 art. 3-4
Generating Functions
Method of Characteristic Roots
6 For Solving Recurrence Characteristic Roots Method Ch.3 art. 5 2
Relations
Solving Inhomogeneous &
7 Nonlinear Recurrence Solving Recurrence Relation Ch.3 art. 6 2
Relations
Relations and Directed Graphs,
Equivalence Relations, Partially
Ch. 4 art. 1-5
8 Ordered Set, Totally Ordered Relations and Graph
6
Set, Hasse Diagram, Well Ordered
Set
9 Graphs Basic Concepts Basics of Graph Ch.5 art. 1 2
Isomorphism, Subgraphs,
10 Non-Directed Graphs Ch.5 art. 2 3
Special Graphs
11 Trees, Spanning Trees, Directed Trees and their Properties Ch.5 art. 3-6 4
 Trees and Binary Trees
Planar Graphs, Multigraph,
Eulerian and Hamiltonian
12 Planar and Non-Planar Graphs Ch.5 art. 7-12 5
Graphs, Chromatic Numbers &
graph coloring
Group, Group Isomorphism,
Cyclic Groups, Subgroups,
13 Lagrange Theorem Rings and Introduction to Group Theory C.L.Liu 7
Fields, Definition, Examples,
Finite Fields
Total no. of classes planned 42

Evaluation scheme:
EC Evaluation Components Duration Weightage Date & Time Venue
No
1 Test - I (Closed book) 50 minutes 25% 03-Oct-21 Su2
2 Quiz – I (Closed book) 20 minutes 10% 26-Oct-21 T3

announced
3 Quiz – II (Closed book) 20 minutes 10% 16-Nov-21 T3

To be
4 Mini Project Take home 15% Last date for
submission
15-Dec-21
5 Comprehensive Exam (Open book) 3 hours. 40% 26-Dec-21 AN

Mid-Sem Grading:
Mid-semester grading will be displayed on 03-Nov-2021.

Note: A student is likely to get “NC”, if he / she doesn’t appear / appear for the sake of appearing for the
evaluation components / scoring zero in comprehensive examination.

Makeup and Attendance policies:

Make-ups are not given as a routine. It is solely dependent upon the genuineness of the circumstances
under which a student fails to appear in a scheduled evaluation component. In such circumstances, prior
permission should be obtained from the Instructor-in-Charge (I/C). Students with less than 60% of
attendance will not be allowed to avail the make-ups. The decision of the I/C in the above matter will be
final.
Attendance: Every student is expected to be responsible for regularity of his/her attendance in the classes
to appear in scheduled tests and examinations and fulfill all other tasks assigned to him/her in every class.
A student should have a minimum of 60% of attendance to be eligible to appear for the Comprehensive
Examination. For the students under the purview of Academic Counseling Board (ACB), the Board shall
prescribe the minimum attendance requirement on a case-to-case basis. Attendance in the course will be a
deciding factor in judging the seriousness of a student which may be directly / indirectly related to grading.

General timings for consultation: Th9

General instructions:
Students should come prepared for classes and carry the prescribed text book(s) or material(s) as advised
by the Course Faculty to the class.

Notices:
All notices concerning the course will be displayed on the CS department Notice Board.

Instructor In-Charge

Instructors’ Contact Details:

A Somasundaram-Chamber No: G11; Tel. No: 2753788; Email: asomasundaram@dubai.bits-pilani.ac.in
S Baskaran - Chamber No: 135; Tel. No: 2753700 ext. 226; Email: baskaran@dubai.bits-pilani.ac.in