COURSE PLAN

For
Discrete Mathematical Structures (CSET106)

Faculty Name : Dr. Satyam Omar (Co-ordinator)

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, 2024
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:
h
1. Kenneth H. Rosen, Discrete Mathematics, and Its Applications (8 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

End Semester Examination 50%

Mid Semester Examination 20%

Continuous Tutorial Evaluation 20%

Lecture Quiz 10%

Total 100%