COURSE PLAN

For
Discrete Mathematical Structures (CSET106)

Faculty Name : Dr. Madhushi Verma, Dr. Madhuri Gupta,

Dr. Rajendra Choudhary, Dr. Anuj Kumar Bharti

Course Type : B.Tech Core

Semester and Year : II Semester and I Year

L-T-P : 3-1-0

Credits 4

School : SCSET

Course Level : UG

School of Computer Science Engineering and Technology

Bennett University
Greater Noida, Uttar Pradesh
 COURSE CONTEXT

VERSION NO. OF
CURRICULUM/SYLLABUS
SCHOOL SCSET THAT THIS COURSE IS A V1
PART OF
DATE THIS COURSE
DEPARTMENT WILL BE EFFECTIVE Jan–Jun,2022
FROM
VERSION NUMBER OF
DEGREE B.Tech. THIS COURSE 2

COURSE BRIEF
Discrete Mathematical
COURSE TITLE Structures PRE-REQUISITES NA
COURSE CODE CSET106 TOTAL CREDITS 4
COURSE TYPE Core L-T-P FORMAT 3-1-0

COURSE SUMMARY
Discrete mathematical structures deal with discrete mathematical foundation of computer science. The
main topics include-Propositional logic, Sets, Functions and Relations, Number Theory, Counting
Techniques, Group, Monoid, Ring, Field, Graph, Tree, Euler graph, Hamiltonian circuit, Clique and
Matching.

COURSE-SPECIFIC LEARNING OUTCOMES (CO)

By the end of this program, students should have the following knowledge, skills and values:
CO1: To explain logical notation to illustrate sets, relations, functions, and integers.
CO2: To examine induction hypotheses and prove elementary properties of modular arithmetic.
CO3: Experiment and solve critical examples of algebraic structures and graph theory.

How are the above COs aligned with the Program-Specific Objectives (POs) of the degree?
The course outcomes are aligned to inculcating inquisitiveness in understanding cutting edge areas of
computer science engineering and allied disciplines with their potential impacts.
CO - PO Mapping

COs POs PO1 PO2 PO3 PO4 PO5 PO6

CO1

CO2

CO3

Detailed Syllabus
Module 1 (11 hours)
Introduction and applications of Discrete mathematical structures, Proposition, Logical operators,
Converse, Inverse, Contrapositive, Compound propositions, Precedence of logical operators, Tautology,
Contradiction, Logical Equivalence, Derived implications, Well-formed formula, Tautological
Implication, Logical equivalence laws, Rules of inference, Predicates and Quantifiers, Nested
quantifiers, English to logic conversion, Direct proof, Proof by contradiction, Proof by induction,
Russell’s paradox.
Module 2 (11 hours)
Representation of Sets, Types of Sets, Power Set, Venn Diagrams, Operations on Sets, Partition of Sets,
Fuzzy Sets. Functions, Types of Functions, Sum and Product of Functions, Relation, Relation vs
Function, Different Types of Relations, Graphical Representation of Relations, Matrix Representation of
Relations, Closure of relations.

Module 3 (10 hours)

Representation of integers, Binary operations, Divisibility, Euclidean Theorem for GCD, Residue
classes, Linear congruence, Chinese remainder theorem, inclusion-exclusion principle, Binomial
coefficients, Permutation, and combination, Pigeonhole principle, Recurrence relations and generating
functions, semi-group, Monoid, and group, Abelian group, Cyclic group, Addition modulo m,
Multiplication modulo m, Ring, Field, and integral domain.
Module 4 (10 hours)
Partially ordered set, Elements of Posets, properties of lattices, Bounded, distributive, Complemented
Lattice, Graphs, Homomorphism and Isomorphism, Euler graph, Hamiltonian circuit, Handshaking
lemma (Havel Hakimi theorem), Graph Score Theorem, Bipartite graphs, Kionig’s Theorem, Graph
coloring, Chromatic number, Clique, Matching, Trees, forest, rooted trees, Binary trees, height of trees.

TEXTBOOKS/LEARNING RESOURCES:
1. Kenneth and H. Rosen, Discrete Mathematics, and Its Applications (8th ed.), McGraw Hill, 2021. ISBN
978-9390727353.
2. Bisht, R.K. and Dhami, H.S, Discrete Mathematics (1st ed.), Oxford University Press, 2015. ISBN 978-
0199452798.

REFERENCE BOOKS/LEARNING RESOURCES:

1. Jon Pierre Fortney, Discrete Mathematics for Computer Science (1st ed.), Oxford University
Press, 2020. ISBN 978-1000296806.

TEACHING-LEARNING STRATEGIES
The course will be taught using a combination of the best practices of teaching-learning. Multiple
environments will be used to enhance the outcomes such as seminar, self-learning, MOOCs, group
discussions and ICT based tools for class participation along with the classroom sessions. The teaching
pedagogy being followed includes more exposure to hands-on experiment and practical
implementations done in the lab sessions. To match with the latest trend in academics, case study,
advanced topics and research oriented topics are covered to lay down the foundation and develop the
interest in the students leading to further exploration of the related topics. To make the students aware of
the industry trends, one session of expert lecture will be organized to provide a platform to the students
for understanding the relevant industry needs.

EVALUATION POLICY

Components of Course Evaluation Percentage Distribution

Mid Semester Examination 20%

End Semester Examination 35%

Assignment 5%
Components of Course Evaluation Percentage Distribution

Quiz 20%

Continuous Evaluation 20%

Total 100%

Lecture Wise Plan

No. Content Planned

1 Course structure/handout Assessment mechanism (20)

Applications of Discrete mathematical structures (25)

2 Propositions (5)
Logical operators (5)
Converse, inverse, and contrapositive (15)
Compound propositions (10)
precedence of logical operators (10)

3 Tautology, Contradiction, Contingency (15)

Logical equivalence (15)
derived implications (10)
well-formed formula (10)

4 Tautological Implication (20)

Logical equivalence laws (30)

5 Rules of inference (50)

6 Predicates (20)
Universe of Discourse (10)
n-place Predicates (15)

7 Existential Quantifiers (25)

Universal quantifiers (25)

8 Nested quantifiers (15)

Language to logic conversion (20)
Fallacies (15)
No. Content Planned

9 Direct proof (20)

proof by contradiction (25)

10 Proof by mathematical induction (45)

Russell’s paradox (5)

11 Assessment 1/Buffer Lecture*

12 Representation of Sets (15)

Types of Sets (30)

13 Power Set (10)

Venn Diagrams (35)

14 Operations on Sets (30)

Partition of Sets (15)

15 Fuzzy Sets (50)

16 Relations (10)
Types of Relations (40)

17 Graphical Representation of Relations (20)

Matrix Representation of Relations (20)
Closure of relations (10)

18 Case study (50) *

19 Functions (10)
Types of Functions (40)

20 Relation vs Function (15)

Sum and Product of Functions (30)

21 Expert Lecture (50) *

22 Representation of Integers (10)

Binary operations (10)
Divisibility (10)
Euclidean theorem for GCD (15)

23 Residue classes (25)

Linear congruence (25)
No. Content Planned

24 Chinese remainder theorem (45)

25 Inclusion-exclusion principle (20)

Binomial coefficients (30)

26 Permutations (25)
Combinations (25)

27 Pigeonhole principle (20)

Recurrence Relation (10)
Generating Functions (20)

28 Semi-group (15)
Monoid (15)
Groups (15)

29 Assessment 2/ Buffer Lecture*

30 Abelian Groups (25)

Cyclic Groups (20)

31 Addition modulo m (20)

Multiplication modulo m (25)

32 Rings (15)
Fields (15)
Integral domains (15)

33 Buffer Lecture

34 Partially ordered set (20)

Elements of Posets (25)

35 Lattices (15)
Bounded lattice (10)
Complemented lattice (10)
Distributive lattice (10)

36 Graphs (25)
Homomorphism (10)
Isomorphism (10)

37 Euler Graph (10)

Hamiltonian circuit (10)
Handshaking lemma (10)
Graph Score Theorem (15)
No. Content Planned

38 Bipartite graphs (20)

Kionig’s Theorem (25)

39 Graph coloring, Chromatic number (10)

Clique, Matching (10)
Trees, forest, rooted trees (15)
Binary trees, height of trees (10)

40 Buffer Lecture

41 Buffer Lecture

Tutorial Wise Plan

No. Content Planned

1 Propositional Logic such as designing computer circuits, to construct computer programs, to build expert systems.

2 Cover word problems on the usage of Logical Operators, Tautology, Contradiction, Predicates and Quantifiers.

3 Compute the solution of word problems related to Direct proof and Proof by contradiction

4 Design stepwise solution for the word problems on Proof by mathematical induction

5 Understand the types of sets and Venn diagrams by generating solution for the related numerical

6 Identify the use of Fuzzy Sets in Decision Making.

7 Create the solution for the word problems on Relations and its types.

8 Interpret the numerical based on Functions & Sum and Product of Functions and generate appropriate solutions.

9 Solve critical examples related to Euclidean theorem & Chinese remainder theorem in Cryptography.
 No. Content Planned

10 Permutation, Combination, Pigeonhole principle, Generating functions and design appropriate solution.

11 Solve the examples from cryptography using Groups, partially ordered set, lattices.

12 Compute the necessary solution for the numerical based on applications of graphs and trees for solving various problems
such as path optimization / indexing in databases.

13 Buffer

14 Buffer

• Proposed Industry Talks: Shubhdeep Karan (facebook). tentatively in 3rd week of April.

• Startups related to the Course: memgraph

• Certification Mapping: Discrete Mathematics (Udemy). https://www.udemy.com/course/discrete-math/ , Discrete

Mathematics (coursera).https://www.coursera.org/learn/discrete-mathematics

• Software/Tools Used: Acadly(https://www.acadly.com/), graphonline (https://graphonline.ru/en/)

• Harware/Devices Used: NA

• Proposed Case Studies: Real-Life applications of the concepts like Google Maps

• Advanced Research Topics: complex network analysis