Syllabus

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)
Credit Units 3
II Semester, 2018 – 19

Course Description
Introduction to discrete mathematical structures; Formal logic and predicate calculus; Sets, relations
and functions; Proof techniques; Graphs and trees; Primes, factorization, greatest common divisor,
residues and application to cryptology; Permutations, combinations and partitions; Recurrence
relations.
Course Objectives
No Objective

CO1 To understand the logic which is the basis for programming

CO2 To understand techniques for analysis of algorithms- Recurrence relations

CO3 To learn the basics required for cryptology and Graph Theory

Text Book(s)
No Author(s), Title, Edition, Publishing House
T1 Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata McGraw Hill, 7th Ed.,
2011.

Reference Book(s) & other resources

No Author(s), Title, Edition, Publishing House
R1 Kolman, Busby, Ross and Rehman, Discrete Mathematical Structures for Computer Science,
Pearson Education, 6th Edition, 2017.
R2 D.S. Malik and M.K. Sen, Discrete Mathematical Structures: Theory and Applications,
Thomson, 2004.
R3 Goodaire & Parmenter : Discrete Mathematics & Graph Theory, Pearson Education, 3rd Edition
 2002.
R4 C.L. Liu, Elements of Discrete Mathematics, 2nd Edition, McGraw Hill, 1986.

Content Structure

Content Structure
No Title of the Module References
M1 Module1: Logic
 Propositional Logic, Propositional Equivalence, Predicate Logic
 Introduction to logic; basic concepts in propositional logic, operators on
propositions, knowledge representation in propositional logic,
propositional equivalence using truth tables, equivalence laws, and
fundamentals of predicate logic, quantifier expressions, knowledge
representation in predicate logic.

M2
Module: Proof Methods
 Inference Rules, Proof Methods, Strong & Weak induction
 Inference rules, proof methods – direct proof, indirect proof, vacuous
proof, trivial proof, proof by cases, proof by contradiction and strong /
weak induction.
M3 Module 3:Sets, Functions and Relations
 Set theory, Functions, Relations – Equivalence Relations, Partial Order
Relations, Lattices.
 Introduction to set theory, set relations, set operators, cardinality of sets,
Cartesian product of sets, fundamentals of functions – range, domain,
injection, surjection, bijection of functions, fundamentals of relations,
reflexive, symmetric and transitive properties in relations, representing
relations, applications of relations, equivalence relations, partial order
relations, lattices.
M4 Module 4: Combinatory, Recursion, Recurrence relation
 Combinatorics, Pigeonhole principle, Recursion, Recursively defined
functions, Recurrence relations
 Combinatorics: sum and product rules, inclusion/exclusion principle,
pigeonhole principle, recursion, recursively defined functions, recurrence
relations.
M5 Module 5:Graph Theory
 Introduction to graph theory, Trees, Minimum Spanning Trees.
 Introduction to graph theory, directed and undirected graphs, handshaking
theorem, special graph structures, graph representations and isomorphism
of graphs, connectedness, components, Euler, Hamilton paths and cycles,
trees, binary trees, binary search tree, spanning trees, minimum spanning
trees – Prim’s and Kruskal’s algorithms.
M6 Module 6:Introduction to Cryptography
 Basic Number Theory, Introduction to Cryptography, RSA Algorithm
 Basic concepts in number theory, prime factorization theorem, division
algorithm, primality, modular congruence, Euclid’s algorithm for GCD,
hash functions, modular exponential problem, Chinese remainder
theorem, RSA algorithm.
Learning Outcomes:
No Learning Outcomes

LO1 Student will be able to understand the logic behind the validation of statements in programming

L02 Student should be confident of analyzing algorithms in particular using recurrence relations

LO3 Students are confident of Graph theory concepts so that understanding data structures becomes
very simple

Part B: Contact Session Plan

Academic Term II semester 2017 - 18

Course Title DISCRETE STRUCTURES FOR COMPUTER SCIENCE

Course No SEWP ZC252 / CSIW ZC132

Lead Instructor Applied Mathematics Group

Course Contents
Contact Session-1, Module 1:Logic
Time Type Description References
Pre-CS-1 RL1.1, RL 1.2, Propositional Logic, Propositional Equivalence,Predicates and T1 –1.1,1.2, 1.3
RL 1.3 Quantifiers

During CS- CS-1 Discuss Examples: T1 – 1.1: 7, 8, 9, 10,12,18,19, 14, 15,18,19 T1 –1.1,1.2, 1.3
1 Solve Exercises: T1 – 1.1 - 3,7,17,31,55,56,57,58,59.
Discuss Examples: T1 – 1.2: 5, 6, 7, 8 Solve Exercises:
T1 – 1.2: 9,23,31,43 and 45Discuss Examples: T1 – 1.3: 3,
4, 7, 8, 12, 13, 15, 16, 17, 20, 22, 26, 27Solve Exercises: T1 –
1.3: 7,9,25,27,33,41,55

Post-CS-1 HW Exercises of T1 – 1.1: 5, 13,19, 21, 33, 35, 37, 43,47, 63 T1 –1.1, 1.2, 1.3
Exercises of T1 – 1.2: 7, 11, 15, 17, 25, 27Exercises of T1 –
1.3: 3, 6, 11, 13, 29, 34, 37, 39, 43, 57

Contact Session-2, Module 1& 2; Logic , Proof Methods

Time Type Description References
Pre-CS-2 RL 1.4, RL 2.1 Nested Quantifiers, Inference Rules, Introduction to proofs T1 –1.4, 1.5, 1.6
During CS- CS-2 Discuss Examples: T1 – 1.4: 2,4,8,12,15 T1 –1.4, 1.5, 1.6
2 Solve Exercises: T1 – 1.4: 1,7,19,30,37T1 – 1.5: 3, 4, 7, 8, 9,
13,15, 16, 17.
Solve Exercises: T1 – 1.5: 4,9,15,23,30,35
Discuss examples T1 – 1.6: 2, 4, 6,7,8, 9, 11, 12,14, 15, 18
Solve Exercises: T1 – 1.6: 5,11,22,27,28,39
Post-CS-2 HW Exercises of T1 – 1.4: 4,12,13,23,31,33,40,45 T1 –1.4, 1.5, 1.6
Exercises of T1 – 1.5: 5, 7, 11, 13, 17, 19, 23, 25, 29, 31
T1 -1.6: 4,9, 13,16, 17, 23,15,31,38

Contact Session-3, Module 2&Module 3: Sets, Functions and Relations

Time Type Description Reference
Pre-CS-3 RL 2.2, RL 3.1 Mathematical Induction, Sets, Operation on Sets T1 –4.1, 4.2,
2.1, 2.2,
During CS- CS-3 Discuss examples T1 – 4.1: 4,6,8, 9,14 T1 –4.1, 4.2,
3 Solve Exercises: T1 – 4.1: 3,7,12,21 2.1, 2.2,
Discuss examples T1 – 4.2: 1, 3,4
Solve Exercises: T1 – 4.2: 1,2,5,14Discuss examples T1 – 2.1:
13, 14, 18,20
Solve Exercises: T1 – 2.1:1,6,9,20,28,30,41,44
Discuss examples T1 - 2.2: 10,11,14,18, 19, 20
Solve Exercises: T1 – 2.2:16,18,27,30,39,46,50,55,59
Post-CS-3 HW T1 - 4.1: 6,9,19,35, 27, 37 T1 –4.1, 4.2,
T1 - 4.2: 3, 7, 9, 13Exercises of T1 – 2.1: 7,12,17,19, 21, 29,43 2.1, 2.2,
Exercises of T1 – 2.2: 2,17,22,25,38,41, 45, 49, 51, 53,57

Contact Session-4, Module 3: Sets, Functions and Relations

Time Type Description References
Pre-CS-4 RL 3.2, RL 3.3 Functions, Relations T1 –2.3, 7.1, 7.2
During CS- CS-4 Discuss examples T1 – 2.3: 9,10, 12, 13, 17, 18, 19,26, 27, 28 T1 –2.3, 7.1, 7.2
4 Solve Exercises: T1 – 2.3: 4,15,19,27,39,55,57,65,70,73,77
Discuss examples T1 – 7.1: 6, 7, 8, 9, 11, 12, 13, 14, 15, 16,20
Solve Exercises: T1 – 7.1: 3,6,29,37,39,48,54
Discuss examples T1 – 7.2: 10, 11,12
Post-CS-4 HW Exercises of T1 - 2.3: 3,12, 21, 23, 29, 31,42,47,54,57,58. T1 –2.3,7.1, 7.2
Exercises T1 - 7.1: 4,5, 7,8, 15, 23, 29,37,39,41, 42, 45, 47
,48,54
 R2 – 7.2: 13, 15
Lab

Contact Session-5, Module 3:Sets, Functions and Relations

Time Type Description References

Pre-CS-5 RL 3.4, RL 3.5 Representing Relations, Equivalence Relations, Partial T1 –7.3, 7.4,
Orderings 7.5, 7.6
During CS- CS-5 Discuss examplesT1 – 7.3: 1, 2, 3 T1 –7.3, 7.4,
5 Solve Exercises: T1 – 7.3: 3,11,13,16 7.5, 7.6
Discuss examplesT1 – 7.4: 1, 2
Discuss examplesT1 – 7.5: 3,6, 7, 9,10,14.
Solve Exercises: T1 – 7.5: 35,43,49,48,57
Theorem 1 of 7.5 in T1
Discuss examples T1 – 7.6: 2, 3, 4, 5, 12, 14, 17, 18, 22, 23, 24
Solve Exercises: T1 – 7.6: 4,19,31,35,43,47,62,65
Post-CS-5 HW ExercisesT1 – 7.3: 5, 7, 9,14 T1 –7.3, 7.4,
Exercises T1 – 7.4 : 1, 3 7.5, 7.6
Exercises T1 – 7.5: 2,11, 13, 15, 24,25, 29,36,41
Exercises T1 – 7.6: 3, 5, 7, 23, 29, 33, 49, 51.
Lab
Syllabus for Mid-Semester Test: Topics covered in the first 5contact session

Contact Session-6, Module 4: Combinatorics, Recursion, Recurrence relation

Time Type Description Content
Reference
Pre-CS-6 RL 4.1, RL 4.2 Combinatorics, Recurrence Relations T1 – 5.1, 5.2,
6.1, 6.2
During CS- CS-6 Discuss examplesT1- 5.1: 3, 4,5, 8, 10, 12 ,18,19,21 T1 – 5.1, 5.2,
6 Solve Exercises: T1 –5.1: 3,7,11,20,30,40,53 6.1, 6.2
Discuss examplesT1 – 5.2: 4,6, 8, 9, 11, 13
Solve Exercises: T1 –5.2: 2,4,17,23,30
Discuss examplesT1 – 6.1: 1, 2, 6, 7,8
Solve Exercises: T1 –6.1: 1,5,8,19,22,31,34,36,48
Discuss examplesT1 – 6.2: 1, 2, 3, 5, 6,9
Solve Exercises: T1 –6.2: 1,3
Theorem 1 to Theorem 5 of 6.2 of T1
Post-CS-6 HW ExercisesT1 – 5.1 :16,17, ,23,35, 39, 45, 47,49,53,61 T1 – 5.1, 5.2,
Exercises T1 – 5.2: 5, 7, 11, 12,15, 20,23,25,30,34 6.1, 6.2
Exercises T1 – 6.1: 11, 13, 23, 25, 27, 29, 33, 41
Lab

Contact Session-7, Module 5: Graph Theory

Time Type Description Reference
Pre-CS-7 RL 5.1, RL 5.2 Introduction to Graph Theory, Graph Isomorphism, T1 –8.1, 8.2, 8.3
During CS- CS-7 Discuss examplesT1 – 8.1: 2, 3,4, 5,7, 8,10 T1 –8.1, 8.2, 8.3
7 Solve Exercises: T1 –8.1:10,12,15,19,27,33
Discuss examplesT1 – 8.2: 4, 10, 11, 14,15
Solve Exercises: T1 –8.2: 5,18,24,60
Discuss examplesT1 – 8.3: 2, 4, 6, 10, 11 of 8.3 in T1
Solve Exercises: T1 –8.3: 28,39,43,64
Post-CS-7 HW ExercisesT1 – 8.1: 1, 11, 16,21, 29 T1 –8.1, 8.2, 8.3
Exercises T1 – 8.2: 18,26, 27,31, 43,53.
Exercises T1 – 8.3: 9, 21,25, 29, 44,45,53,63
Lab

Contact Session-8, Module 5:Graph Theory

Time Type Description References
Pre-CS-8 RL 5.3, RL 5.4 Connectivity, Euler and Hamilton Paths, Trees T1 –8.4, 8.5, 9.1
During CS- CS-8 Discuss examplesT1 – 8.4: 3, 4, 5, 8, 15 T1 –8.4, 8.5, 9.1
8 Solve Exercises: T1 –8.4: 28,36,49,53
Discuss examplesT1 – 8.5: 4, 5, 7,8
 Solve Exercises: T1 –8.5: 5,21,34
Discuss examplesT1 – 9.1: 5, 7, 9, 10, 11
Solve Exercises: T1 –9.1: 9,14,23,36,47
Post-CS-8 HW Exercises T1 – 8.4: 33, 35, 41, 43,54,55 T1 –8.4, 8.5, 9.1
Exercises T1 – 8.5: 7,14,17,24, 41
Exercises T1 – 9.1: 9, 11, 13, 16,25, 31,37,48
Lab

Contact Session-9, Module 5:Graph Theory

Time Type Description References
Pre-CS-9 RL 5.4, RL 5.5 Spanning Trees, Minimum Spanning Trees T1 –9.2, 9.4, 9.5
During CS- CS-9 Discuss examplesT1 – 9.2: 1,3,5,7 T1 –9.2, 9.4, 9.5
9 Solve Exercises: T1 –9.2: 9,25,19,42
Discuss examplesT1 – 9.4: 1, 2, 3,5,6,7
Solve Exercises: T1 –9.4: 6,23
Discuss examplesT1 – 9.5: 1, 2, 3
Solve Exercises: T1 –9.5: 17,18
Post-CS-9 HW Exercises T1 - 9.2: 1, 3, 9,20,33,37 T1 –9.2, 9.4, 9.5
Exercises T1 – 9.4: 15, 27
Exercises T1 – 9.5: 1,15, 19, 27, 29
Lab

Contact Session-10, Module 6: Introduction to Cryptography

Time Type Description Content
Reference
Pre-CS-10 RL 6.1, RL Primes, GCD, Integers and Algorithms, RSA Cryptosystem T1 –3.4, 3.5,
6.2, RL 6.3 3.6, 3.7
During CS- CS-10 Discuss examplesT1 – 3.4: 3,4,5, 6, 8, 9 T1 –3.4, 3.5,
10 Discuss examplesT1 - 3.5: 4, 7, 11, 13,14, 15 3.6, 3.7
Discuss examplesT1 – 3.6: 11, 12
Discuss examplesT1- 3.7: 3, 4, 6, 9, 10, 11, 12
Post-CS-10 HW ExercisesT1 – 3.4: 13, 10,21, 23,25, 29, 31, 32 T1 –3.4, 3.5,
Exercises T1 – 3.5: 6,9, 11,21,25,30,33, 37 3.6, 3.7
Exercises T1 – 3.6: 19, 21, 23, 25
T1 – 3.7: 9, 13, 17, 21, 23, 41, 45, 47
Syllabus for Comprehensive Exam (Open Book) All topics given in Plan