Name of Department: Computer Science and Engineering

Course Handout

Course Code UGCSE203

CourseTitle DISCRETE MATHEMATICS
LTPC Structure 3-0-0-3
Course Type Core
Name of Faculty Member Dipti Joshi
Designation Assistant Professor
Contact Number 6378826662
Email [Link]@[Link]
This discrete mathematics course covers propositional logic,
proof methods, sequences, counting principles (permutations,
combinations, recurrence relations), relations, group theory
(subgroups, Lagrange's theorem), graph theory (connectivity,

Course Description paths, coloring), lattice theory (Boolean algebras, duality),

and coding theory (binary coding, error detection). Essential
for computer science, it emphasizes foundational concepts
and analytical skills necessary for advanced studies and
practical applications.

This course aims to provide students with a thorough

understanding of foundational concepts in discrete
mathematics essential for computer science. By the end of the
course, students will be equipped with analytical skills and
Scope and Objective theoretical knowledge necessary for tackling complex
computational problems, ensuring they are prepared for
advanced coursework and practical applications in fields
requiring rigorous mathematical reasoning.
Program Outcomes (PO):

After successful completion of the program, the graduate will be able to:

PO 1: Engineering knowledge: Apply the knowledge of mathematics, science,

engineering fundamentals, and an engineering specialization for the solution of
complex engineering problems.

PO 2: Problem analysis: Identify, formulate, research literature, and analyze complex

engineering problems reaching substantiated conclusions using first principles of
mathematics, natural sciences, and engineering sciences.

PO 3: Design/Development of Solutions: Design solutions for complex engineering

problems and design system components or processes that meet the specified needs
with appropriate consideration for public health and safety, and cultural, societal, and
environmental considerations.

PO 4: Conduct investigations of complex problems: Use research-based knowledge

and research methods including design of experiments, analysis and interpretation of
data, and synthesis of the information to provide valid conclusions.

PO 5: Modern tool usage: Create, select, and apply appropriate techniques, resources,
and modern engineering and IT tools including prediction and modelling to complex
engineering activities with an understanding of the limitations.
 PO 6: The engineer and society: Apply reasoning informed by the contextual
knowledge to assess societal, health, safety, legal, and cultural issues and the
consequent responsibilities relevant to the professional engineering practice.

PO 7: Environment and sustainability: Understand the impact of the professional

engineering solutions in societal and environmental contexts, and demonstrate the
knowledge of, and the need for sustainable development.

PO 8: Ethics: Apply ethical principles and commit to professional ethics and

responsibilities and norms of the engineering practice.

PO 9: Individual and team work: Function effectively as an individual, and as a

member or leader in diverse teams, and in multidisciplinary settings.

PO 10: Communication: Communicate effectively on complex engineering activities

with the engineering community and with the society at large, such as being able to
comprehend and write effective reports and design documentation, make effective
presentations, and give and receive clear instructions.

PO 11: Project management and finance: Demonstrate knowledge and

understanding of the engineering and management principles and apply these to one’s
work, as a member and leader in a team, to manage projects and in multidisciplinary
environments.

PO 12: Life-long learning: Recognize the need for, and have the preparation and
ability to engage in independent and life-long learning in the broadest context of
technological change.

Program Specific Outcomes:

PSO1: Core Engineering Skills: Exhibit fundamental concepts of Data Structures,

Databases, Operating Systems, Computer networks, Theory of Computation,
Advanced Programming, and Software Engineering.
 PSO2: Standard Software Engineering practices: Demonstrate an ability to design,
develop, test, debug, deploy, analyze, troubleshoot, maintain, manage and secure
software.

PSO3: Future Endeavors: Recognize the need to have knowledge of higher education
institutions/organizations/companies related to computer science & engineering.

SYLLABUS

Name of Program: Computer Science and Engineering Semester: III

Course Code: UGCSE203

Course Name: DISCRETE MATHEMATICS
L-T-P-C: 3-0-0-3 MM:100

Course Outcomes (CO):

At the end of the course the student will be able to:

CO1: Apply formal logic, propositional equivalence, and proof strategies to solve
mathematical problems.
CO2: Understand and analyze relations, group structures, and algebraic properties for
mathematical modeling.
CO3: Apply graph theory concepts such as paths, trees, and graph coloring to solve
engineering problems.
CO4: Understand and evaluate lattice structures and Boolean algebra in the context of
logic and computation.
 CO5: Apply coding theory principles to encode, detect, and correct errors in binary
information.

OUTLINE OF THE COURSE

Module Title of Module Time Required for Module (Hours)

No

0 Introductory 3

1 Formal Logic 9

2 Relation and Group 9

3 Graph Theory 8

4 Lattice theory 8

5 Coding Theory 8

Detailed Syllabus:

Unit Unit Details

No.

1 Logic & Counting

Logic : Propositional equivalence, predicates and quantifiers, Methods of proofs,

proof strategy, sequences and summation, mathematical induction, recursive
definitions and structural induction, program correctness.

Counting: The basics of counting, the pigeonhole principle, permutations and

combinations, recurrence relations, solving recurrence relations, generating
functions, inclusion-exclusion principle, application of inclusion-exclusion.

2 Relations & Group Theory

Relations: Relations and their properties, n-array relations and their applications,
representing relations, closure of relations, equivalence of relations, partial orderings.

Group theory: Groups, subgroups, generators and evaluation of powers, cosets and
Lagrange's theorem, permutation groups and Burnside's theorem, isomorphism, auto
 orphisms, homomorphism and normal subgroups, rings, integral domains and fields.

3 Graph theory

Introduction to graphs, graph terminology, representing graphs and graph

isomorphism, connectivity, Euler and Hamilton paths, planar graphs, graph coloring,
introduction to trees, application of trees.

4 Lattice theory

Lattices and algebras systems, principles of duality, basic properties of algebraic

systems defined by lattices, distributive and complimented lattices, Boolean lattices
and Boolean algebras, uniqueness of finite Boolean expressions, prepositional
calculus.

5 Coding theory

Coding of binary information and error detection, decoding and error correction

Text and Reference Books

S. Reference and Text Book Author Publication Nomenclature

No. and Edition

1 Discrete Mathematical VBL Chaurasia Genius T-1

Structures and Amber Publication
Srivastava

2 Elements of Discrete C. L. Liu Tata McGraw T-2

Mathematics Hill Publication

3 A Text Book of Discrete Swapan Kumar S. Chand T-3

Mathematics Sarkar Publication

4 Discrete Mathematics and K.H. Rosen Tata McGraw R-1

its application Hill Publication
5 Discrete Mathematical G. Shankar Rao New Age R-2
Structure Publisher

6 Discrete Mathematics M. K. Gupta Krishna R-3

Publication

CO-PO Mapping

COs
and PO PO PO PO PO PO PO PO PO PO PO PO
POs -1 -2 -3 -4 -5 -6 -7 -8 -9 -10 -11 -12

CO1 3 3 2

CO2 3 3

CO3 3 2

CO4 3

CO5 3 2

CO-PSO Mapping

COs and PSOs PSO-1 PSO-2 PSO-3

CO1 1 ─ ─

CO2 1 ─ ─

CO3 2 ─ ─

CO4 2 ─ ─

CO5 1 ─ ─
 Lecture Plan

Lectu Title of the Date of Date of Pedagogy Additional Referen

re No. Lecture Planni Implementati topics to be ce
ng on discussed
(topics
beyond the
syllabus
and may be
four to five
topics
against
every 10
lecture
topics)

Module0: Introduction

L-(1- Introductory Aug25 Peer to Introduction

3) Classes peer of course
(Introduction interaction with its
of course, application
vision,
mission,
COs, Pos)

Module 1: Logic & Counting

L-4 Propositional Aug 25 Lecture, Introduction T1, R1

equivalence Problem- to Set
Solving Theory and
Session(Pe Basic Logic
L-5 Predicates Aug 25 T1, R1
er to Peer),
and
Interactive
quantifiers
Quizzes,
Assignme
L-6 Methods of Aug 25 nts T1, R1
proofs, proof
strategy

L-7 Mathematica Aug 25 T1, R1

l induction
L-8 The basics Aug 25 T1, R1
of counting,
the
pigeonhole
principle
L-9 Permutation Aug 25 T1, R1
s and
Combinatio
ns
L-10 Recurrence Aug 25 T1, R1
relations,
solving
recurrence
relations
L-11 Generating Aug 25 T1, R1
functions
L-12 Inclusion Aug 25 T1, R1
exclusion
principle,
application
of
inclusion-
exclusion.
Module2: Relations & Group Theory

L-13 Relations and Sept25 Lecture, Introduction T1, R1

their Problem- of Abstract
properties, Solving Algebra
Session(Pe
er to Peer),
L-14 Closure of Sept25 Interactive T1, R1
relations, Quizzes,
equivalence Assignme
of relations, nts

L-15 Partial Sept25 T1, R1

orderings.

L-16 Groups, Sept25 T1, R3

subgroups

L-17 Generators Sept25 T1, R3

and
evaluation of
 powers,

L-18 Cosets and Sept25 T1, R3

Lagrange's
theorem,
permutation
groups

L-19 Burnside's Sept25 T1, R3

theorem,
isomorphism,
auto
orphisms,
homomorphi
sm and
normal
subgroups

L-20 Rings Sept25

L-21 Integral Sept25 T1, R3

domains and
fields.

Module3: Graph Theory

L-22 Introduction Sept25 Lecture, Basic T3, R2

to graphs Problem- Discrete
L-23 Graph Sept25 T3, R2
Solving Structures &
terminology Session(Pe Combinatori
L-24 Representin Sept25 T3, R2
er to Peer), cs
g graphs
L-25 Graph Oct25 Interactive T3, R2
isomorphis Quizzes,
m, Assignme
connectivity nts
L-26 Euler and Oct25 T3, R2
Hamilton
paths
L-27 Planar Oct25 T3, R2
graphs,
L-28 Graph Oct25 T3, R2
coloring
L-29 Introduction Oct25 T3, R2
to trees,
application
of trees
Module4: Lattice Theory
L-30 Lattices Oct25 Lecture, Basics of T3, R1
Problem- Set theory
L-31 Algebras Oct25 T3, R1
Solving and
systems
L-32 Principles Oct25 Session(Pe Algebric T3, R1
of duality er to Peer), Structures
L-33 Basic Oct25 Interactive T3, R1
properties Quizzes,
of algebraic Assignme
systems nts
defined by
lattices
L-34 Distributive Oct25 T3, R1
and
compliment
ed lattices
L-35 Boolean Nov 25 T3, R1
lattices
L-36 Boolean Nov 25 T3, R1
algebras
L-37 Uniqueness Nov 25 T3, R1
of finite
Boolean
expressions,
prepositiona
l calculus.
Module5: Coding

L-38 Coding of Nov 25 Lecture, Basics of T2, R1

binary Problem- Information
information Solving Theory and
L-39 Coding of Nov 25 T2, R1
Session(Pe elementary
binary
er to Peer), algebra
information
L-40 decoding Nov 25 Interactive T2, R1
Quizzes,
L-41 decoding Nov 25 Assignme T2, R1
nts
L-42 error Nov 25 T2, R1
detection
L-43 error Nov 25 T2, R1
detection
L-44 error Nov 25 T2, R1
correction
L-45 error Nov 25 T2, R1
correction
 Course Assessment Plan: CAP

Assignment Mid Term End Term

COs Description of COs BTL
Weightage Weightage Weightage
Apply formal logic, propositional
4% in I
CO1 equivalence, and proof strategies L2 3.75% 10%
Mid
to solve mathematical problems.
Understand and analyze relations,
group structures, and algebraic 4% in I
CO2 L2 3.75% 10%
properties for mathematical Mid
modeling.
Apply graph theory concepts such 4% (2% I
CO3 as paths, trees, and graph coloring L3 3.75% Mid & 2% 10%
to solve engineering problems. II Mid)
Understand and evaluate lattice
structures and Boolean algebra in 4% in II
CO4 L2 3.75% 10%
the context of logic and Mid
computation.
Apply coding theory principles to
4% in II
CO5 encode, detect, and correct errors L2 3.75% 10%
Mid
in binary information.

EvaluationScheme:

Component Duration Maximum Date&Time Mode

Marks
Mid Term I-Examination 1.30 hr 20 October 2025 offline

Assignment-I - 7.5 24 August 2025 ERP-LX

Assignment-II - 7.5 20 September 2025 ERP-LX
Assignment-III - 7.5 10 October 2025 ERP-LX
Assignment-IV - 7.5 10 November 2025 ERP-LX
Assignment-V - 7.5 28 November 2025 ERP-LX
Quiz-I 1 hr 7.5 22 Sept 2025 ERP-LX
Quiz-II 1 hr 7.5 25 November 2025 ERP-LX
Mid-term II -Examination 1.30 hr 20 December 2025 offline

End Term Examinations 3 hr 50 December 2025 offline

 Signature
Name of Faculty Member with Designation,
Department: Dipti Joshi(Assistant Professor)
Contact No.:6378826662