BIRLA INSTITUTE OF TECHNOLOGY & SCIENCE, PILANI

WORK INTEGRATED LEARNING PROGRAMMES

COURSE HANDOUT

Part A: Content Design

Course Title DISCRETE STRUCTURES FOR COMPUTER SCIENCE
Course No(s) MATH ZC222
Credit Units 3
Course Author A. Somasundaram
Version No
Date

Course Objectives
No Objective
CO1 Develop familiarity in working with some of the mathematical structures, concepts and
notations used in discrete mathematics
CO2 Develop logical reasoning ability and have a training in the construction and understanding
of mathematical proofs.
CO3 Teach the basic concepts and results in logic, combinatorics, and graph theory.

Text Books
T1 Kolman, Busby and Ross Discrete Mathematical Structures, Pearson Education, 6 th Edition,
2009.
T2 Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata McGraw Hill, 7 th Ed.,
2012.

Reference Book(s) & other resources

R1 Goodaire & Parmenter : Discrete Mathematics & Graph Theory, Pearson Education, 2000.

Content Structure
1. Module Title Set Theory
1.1. Sub-module Title Introduction to set Theory
1.1.1. Topic Title Sets and Subsets
1.1.2. Topic Title Operations on Sets
1.1.3. Topic Title Sequences

2. Module Title Logic

2.1. Sub-module Title Propositional Logic
2.1.1. Topic Title Propositions and Propositional Variables
2.1.2. Topic Title Logical Connectives
2.1.3. Topic Title Conditional Statements
2.2. Sub-module Title Predicate Logic
2.2.1. Topic Title Propositional Functions
2.2.2. Topic Title Quantifiers
 2.3. Sub-module Title Logical Equivalence
2.3.1. Topic Title Determination of Logical equivalence

3. Module Title Induction, Recursion and Combinatorics

3.1. Sub-module Title Mathematical Induction
3.1.1. Topic Title Mathematical Statements and Methods of Proof
3.1.2. Topic Title Strong and Weak induction
3.2. Sub-module Title Counting
3.2.1. Topic Title Permutations and Combinations
3.2.2. Topic Title Pigeonhole Principle
3.3. Sub-module Title Recursion
3.3.1. Topic Title Recurrence Relations

4. Module Title Relations and Functions

4.1. Sub-module Title Relations
4.1.1. Topic Title Relations and Their Properties
4.1.2. Topic Title Representing Relations
4.1.3. Topic Title Digraphs
4.2. Sub-module Title Functions
4.2.1. Topic Title Permutation Functions
4.3. Sub-module Title Partial Ordering
4.3.1. Topic Title Partial Ordered Sets
4.3.2. Topic Title Lattices
4.3.3. Topic Title Boolean Algebra

5. Module Title Graph Theory

5.1. Sub-module Title Trees
5.1.1. Topic Title Introduction to Trees
5.1.2. Topic Title Labeled Trees
5.1.3. Topic Title Minimum Spanning Trees
5.2. Sub-module Title Topics in Graph Theory
5.2.1. Topic Title Introduction to Graph Theory
5.2.2. Topic Title Graph Isomorphism and Connectivity
5.2.3. Topic Title Eulerian and Hamiltonian Paths

6. Module Title Introduction to Cryptography

6.1. Sub-module Title Number Theory
6.1.1. Topic Title Divisibility and Modular Arithmetic
6.1.2. Topic Title Integer Representations and Algorithms
6.1.3. Topic Title Primes and Greatest Common Divisors

Learning Outcomes:
No Learning Outcomes
LO1 To be able to manipulate basic mathematical objects such as sets, functions, and relations
and to verify mathematical properties of these objects
LO2 Ability to express mathematical properties formally using propositional logic and predicate
logic.
LO3 Understand the meaning of proof and the logical and inductive processes used for it. Be
able to prove simple mathematical statements.
LO4 Be able to apply basic counting techniques to solve combinatorial problems.
LO5 To develop basic concepts of graph theory and understand their applications.
 Part B: Contact Session Plan
Academic Term First Semester 2018-2019
Course Title Discrete Structures for Computer Science
Course No MATH ZC222
Lead Instructor CHANDRADEW SHARMA

Glossary of Terms
1. Contact Hour (CH) stands for a hour long live session with students conducted either
in a physical classroom or enabled through technology. In this model of instruction,
instructor led sessions will be for 22 CH.
a. Pre CH = Self Learning done prior to a given contact hour
b. During CH = Content to be discussed during the contact hour by the course
instructor
c. Post CH = Self Learning done post the contact hour
2. Contact Hour (CS) stands for a two-hour long live session with students conducted
either in a physical classroom or enabled through technology. In this model of
instruction, instructor led sessions will be for 11 CS.
a. Pre CS = Self Learning done prior to a given contact session
b. During CS = Content to be discussed during the contact session by the course
instructor
c. Post CS = Self Learning done post the contact session
3. RL stands for Recorded Lecture or Recorded Lesson. It is presented to the student
through an online portal. A given RL unfolds as a sequences of video segments
interleaved with exercises
4. SS stands for Self-Study to be done as a study of relevant sections from textbooks and
reference books. It could also include study of external resources.
5. LE stands for Lab Exercises
6. HW stands for Home Work.
7. M stands for module. Module is a standalone quantum of designed content. A typical
course is delivered using a string of modules. M2 means module 2.

Teaching Methodology (Flipped Learning Model)

The pedagogy for this course is centered around flipped learning model in which the
traditional class-room instruction is replaced with recorded lectures to be watched at home as
per the student’s convenience and the erstwhile home-working or tutorials become the focus
of classroom contact sessions. Students are expected to finish the home works on time.

Contact Session Plan

o Each Module (M#) covers an independent topic and module may encompass more than one
Recorded Lecture (RL).
o Contact Sessions (2hrs each week) are scheduled alternate weeks after the student watches
all Recorded Lectures (RLs) of the specified Modules (listed below) during the previous week
 o In the flipped learning model, Contact Sessions are meant for in-classroom discussions on
cases, tutorials/exercises or responding to student’s questions/clarification--- may encompass
more than one Module/RLs/CS topic.
o Contact Session topics listed in course structure (numbered CSx.y) may cover several RLs;
and as per the pace of instructor/students’ learning, the instructor may take up more than one
CS topic during each of the below sessions.

Detailed Structure
Introductory Video/Document: << Introducing the faculty, overview of the course,
structure and organization of topics, guidance for navigating the content, and expectations
from students>>

 Each of the sub-modules of Recorded Lectures (RLx.y ) shall delivered via 30 – 60mins
videos followed by:
 Contact session (CSx.y) of 2Hr each for illustrating the concepts discussed in the videos with
exercises, tutorials and discussion on case-problems (wherever appropriate); contact sessions
(CS) may cover more than one recorded-lecture (RL) videos.

Contact Hour 1
Time Type Sequence Content Reference
Pre-CH
During CH CH1 CH 1.1 = Sets and Subsets T1 Chap 1.1, 1.2,1.3
CH 1.2 = Operations on Sets
CH 1.3 = Sequences
Post-CH SS1 Study T1 Chap 1
Sections 1.1, 1.2,.13
T1 1.2 Theorem 1
HW1 T1
Exercise 1.1
Nos 5,16,17,22,23
Exercise 1.2
Nos 3,5,10,13, 25, 27, 28, 29, 35,36, 47, 50
Lab Reference

Contact Hour 2
Time Type Sequence Content Reference
Pre-CH RL 1 RL 1.2 Propositional Logic
During CH CH2 CH2.1 = Propositions T1 Chap 2.1, 2.2
CH2.2 = Logical Connectives
CH2.3 = Truth Table
CH2.4 = Predicate Logic
Post-CH SS2 T2 Study Chap 2 Sections 2.1, 2.2
HW2 T2
Exercise 2.1
Nos 12, 13, 30, 33, 34, 35
Exercise 2.2
Nos 8, 21, 22
Lab Reference
 Contact Hour 3
Time Type Sequence Content Reference
Pre-CH RL 2 RL1.3 Propositional Equivalence
During CH CH3 CH3.1 = Equivalence T1 Chap 2.1, 2.2
CH3.2 = Tautologies and Contradictions
Post-CH SS3 T1 Section 2.2 Verify Theorems 1,2,3 and
4
Lab Reference

Contact Hour 4
Time Type Sequence Content Reference
Pre-CH RL 3 RL 2.1
During CH CH4 CH4.1 = Mathematical Statements TO BE ANNOUNCED
CH4.2 = Introduction to Proofs
Post-CH HW4 TO BE ANNOUNCED
Lab Reference

Contact Hour 5
Time Type Sequence Content Reference
Pre-CH RL 4 RL 2.2
During CH CH5 CH5.1 = Methods of Proof TO BE ANNOUNCED
CH5.2 = Mathematical Induction
Post-CH SS5 TO BE ANNOUNCED
HW5 TO BE ANNOUNCED

Lab Reference

Contact Hour 6
Time Type Sequence Content Reference
Pre-CH RL 5 RL4.1
During CH CH6 CH6.1 = Combinatorics
CH6.2 = Pigeonhole Principle
CH6.3 = Permutation and Combinations
Post CH SS6 TO BE ANNOUNCED
HW6 TO BE ANNOUNCED

Lab Reference

Contact Hour 7
Time Type Sequence Content Reference
Pre-CH RL 6 RL 4.2
During CH CH7 CH7.1 = Recurrence relations
Post-CH SS7 TO BE ANNOUNCED
HW7 TO BE ANNOUNCED
QZ7
Lab Reference
 Contact Hour 8
Time Type Sequence Content Reference
Pre-CH RL 7 and RL 3.3 3.4
8
During CH CH8 CH8.1 = Relations
CH8.1 = Representing Relations
Post-CH SS8 TO BE ANNOUNCED
HW8 TO BE ANNOUNCED

Lab Reference

Contact Hour 9
Time Type Sequence Content Reference
Pre-CH
During CH CH9 CH9.1 = Representing Relations
CH9.2 = Diagraphs
Post-CH SS9 TO BE ANNOUNCED
HW9 TO BE ANNOUNCED

Lab Reference

Contact Hour 10
Time Type Sequence Content Reference
Pre-CH RL 9 RL 3.2
During CH CH10 CH10.1 = Functions
CH10.2 = Applications in Computer
Science
Post-CH SS10 TO BE ANNOUNCED
HW10 TO BE ANNOUNCED

Lab Reference

Contact Hour 11
Time Type Sequence Content Reference
Pre-CH RL10 RL 3.5
During CH CH11 CH11.1 = Partial Order Sets
Post-CH SS11 TO BE ANNOUNCED
HW11 TO BE ANNOUNCED

Lab Reference

Contact Hour 12
Time Type Sequence Content Reference
Pre-CH
During CH CH12 CH12.1 = Partial Ordering
CH12.2 = Boolean Algebra
CH12.3 =Lattices
Post CH SS12 TO BE ANNOUNCED
HW12 TO BE ANNOUNCED

Lab Reference
 Contact Hour 13
Time Type Sequence Content Reference
Pre-CH RL11 RL5.4
During CH CH13 CH13.1 = Trees

Post-CH SS13 TO BE ANNOUNCED

HW13 TO BE ANNOUNCED

Lab Reference

Contact Hour 14
Time Type Sequence Content Reference
Pre-CH RL12 RL5.5
During CH CH14 CH 10.1 = Labelled Trees
CH10.2 = Spanning Trees
Post-CH SS14 TO BE ANNOUNCED
HW14 TO BE ANNOUNCED
LE14
QZ14
Lab Reference

Contact Hour 15
Time Type Sequence Content Reference
Pre-CH
During CH CH15 CH15.1 = Minimal Spanning Trees
CH15.2 =
Post CH SS15 TO BE ANNOUNCED
HW15 TO BE ANNOUNCED

Lab Reference

Contact Hour 16
Time Type Sequence Content Reference
Pre-CH RL13 RL 5.1
During CH CH16 CH16.1 = Graphs
Post-CH SS16 TO BE ANNOUNCED
HW16 TO BE ANNOUNCED

Lab Reference

Contact Hour 17
Time Type Sequence Content Reference
Pre-CH RL14 RL 5.2
During CH CH17 CH17.1 =Graph Isomorphism
CH17.2 =Connectivity
Post-CH SS17 TO BE ANNOUNCED
HW17 TO BE ANNOUNCED

Lab Reference

Contact Hour 18
Time Type Sequence Content Reference
Pre-CH RL15 RL6.1

During CH CH18 CH18.1 = Integers and Algorithms

Post-CH SS18 TO BE ANNOUNCED
HW18 TO BE ANNOUNCED

Lab Reference

Contact Hour 19
Time Type Sequence Content Reference
Pre-CH RL16 RL 6.2
During CH CH19 CH19.1 = Primes
CH19.2 =GCD
CH19.3 =Modular Arithmatic
CH19.4 =
Post-CH SS19 TO BE ANNOUNCED
HW19 TO BE ANNOUNCED

Lab Reference

Contact Hour 20
Time Type Sequence Content Reference
Pre-CH RL17 RL 6.3
During CH CH20 CH20.1 =Revision
CH20.2 =
CH20.3 =
CH20.4 =
Post-CH SS20 TO BE ANNOUNCED
HW20 TO BE ANNOUNCED

Lab Reference

Contact Hour 21, 22

Time Type Sequence Content Reference
Pre-CH
During CH CH21 CH21.1 = Revision
CH21.2 =
CH21.3 =
CH21.4 =
Post-CH SS21
HW21
LE21
QZ21
Lab Reference
Evaluation Scheme:

Legend: EC = Evaluation Component; AN = After Noon Session; FN = Fore Noon Session

No Name Type Duration Weight Day, Date, Session, Time
EC-1 Quiz-I/ Assignment- Online - 5% September 10 to 20, 2018
I
Quiz-II Online 5% October 20 to 30, 2018
Quiz-III/ Online 5% November 10 to 20, 2018
Assignment-II
EC-2 Mid-Semester Test Closed 2 hours 35% 29/09/2018 (FN)
Book 10 AM – 12 NOON
EC-3 Comprehensive Open 3 hours 50% 24/11/2018 (FN)
Exam Book 9 AM – 12 NOON
Note - Evaluation components can be tailored depending on the proposed model.

Important Information:
Syllabus for Mid-Semester Test (Closed Book): Topics in CS 1-5.
Syllabus for Comprehensive Exam (Open Book): All topics given in plan of study
Evaluation Guidelines:
1. For Closed Book tests: No books or reference material of any kind will be permitted.
Laptops/Mobiles of any kind are not allowed. Exchange of any material is not allowed.
2. For Open Book exams: Use of prescribed and reference text books, in original (not
photocopies) is permitted. Class notes/slides as reference material in filed or bound form is
permitted. However, loose sheets of paper will not be allowed. Use of calculators is permitted
in all exams. Laptops/Mobiles of any kind are not allowed. Exchange of any material is not
allowed.
3. If a student is unable to appear for the Regular Test/Exam due to genuine exigencies, the
student should follow the procedure to apply for the Make-Up Test/Exam. The genuineness of
the reason for absence in the Regular Exam shall be assessed prior to giving permission to
appear for the Make-up Exam. Make-Up Test/Exam will be conducted only at selected exam
centres on the dates to be announced later.
It shall be the responsibility of the individual student to be regular in maintaining the self-study
schedule as given in the course handout, attend the lectures, and take all the prescribed evaluation
components such as Assignment/Quiz, Mid-Semester Test and Comprehensive Exam according to the
evaluation scheme provided in the handout.