SCHOOL OF ENGINEERING & TECHNOLOGY

D E PAR T M E N T OF COMPUTER SCIENCE AND ENG

INEERING

Discrete Structures
CSE245
Instructor’s Name:-

Dr. Anjali Dr. Anuj Kumar

Dr. Megha Chhabra Dr. Rajendra Kumar Dr. Vasudha Arora
Mr. Ajeet Kumar Sharma Mr. Amit Pratap Singh Mr.
Anubhava Srivastava Mr. Dharm Raj
Mr. Murari Kumar Singh Mr. Shashank Singh
Ms. Ekta Singh Ms. Jyoti Pruthi
 SCHOOL OF ENGINEERING & TECHNOLOGY
D E PAR T M E N T OF COMPUTER SCIENCE AND ENG
INEERING

Index
✔ University Mission and Vision
✔ Department Mission and Vision
✔ Course Outcomes and Program Outcome
✔ Evaluation methods
✔ List of students
✔ Attendance criteria
✔ Syllabus of the subject
✔ Academic Calendar

✔ Scope of the subject in Computer Science & Engineering, its prerequisite and other related
subjects.
✔ Importance of the subject in Industry/Entrepreneurial Ventures
✔ About myself and your area of research
✔ Any other required material: Time Table
 SCHOOL OF ENGINEERING & TECHNOLOGY
D E PAR T M E N T OF COMPUTER SCIENCE AND ENG
INEERING

Vision and Mission of the University

Vision of the University

To serve the society by being a global University of higher learning in
pursuit of academic excellence, innovation and nurturing
entrepreneurship.

Mission of the University

1. Transformative educational experience.
2. Enrichment by educational initiative that encourage global outlook.
3. Develop research, support disruptive innovations and accelerate
entrepreneurship.
4. Seeking beyond boundaries.
 SCHOOL OF ENGINEERING & TECHNOLOGY
D E PAR T M E N T OF COMPUTER SCIENCE AND ENG
INEERING

Vision and Mission of the Department of Computer Science

Engineering

Vision of the Department

To be recognized as the fountainhead of excellence in technical knowledge and research

in computer science and engineering to attract students and scholars across the globe.

Mission of the Department

1. To strengthen core competency of students to be successful, ethical, effective

problem solver in Computer Science & Engineering through analytical
learning.
2. To promote interdisciplinary research & innovation-based activities in
emerging areas of technology globally.
3. To facilitate and foster the industry-academia collaboration to enhance
entrepreneurship skills and acquaintance with corporate culture.
4. To inculcate in them a higher degree of social consciousness and moral
values towards solving interdisciplinary societal problems using industry-
 SCHOOL OF ENGINEERING & TECHNOLOGY
D E PAR T M E N T OF COMPUTER SCIENCE AND ENG
INEERING
 SCHOOL OF ENGINEERING & TECHNOLOGY
D E PAR T M E N T OF COMPUTER SCIENCE AND ENG
INEERING

Program Educational Objectives (PEOs)

 SCHOOL OF ENGINEERING & TECHNOLOGY
D E PAR T M E N T OF COMPUTER SCIENCE AND ENG
INEERING

Attendance criteria conti…

As you all are aware that while a minimum of 75% attendance is required in each
course to be eligible to appear for the End Semester Examination, Students
are expected to have 100% attendance.

Please find the attendance requirement rule mentioned below:

• Attendance will be monitored course-wise.

• A student will be required to have at least 75% attendance in a course, to be
eligible to appear in end-term examination (ETE).
• Irrespective of whether a student has registered late or on time, calculation of
attendance shall be based on all the classes held, and not from the date on
which the student has registered, unless otherwise decided by the Registrar in
the case of fresh entrants only.
 SCHOOL OF ENGINEERING & TECHNOLOGY
D E PAR T M E N T OF COMPUTERSCIENCE AND
ENGINEERING

Course Objective

This course provides a mathematical foundation for subsequent study in

Computer Science, as well as developing the skills necessary to solve
practical problems.
Course Outcome

After the completion of this course, students will be able to:

CO-1. Apply the basic principles of sets and operations in sets.
CO-2. Classify logical notation and determine if the argument is or is not valid.
CO-3. Construct and prove models by using algebraic structures.
CO-4. Analyze basic principles of Boolean algebra with mathematical
description.
CO-5. Construct Permutations and combinations in counting techniques and
applications of Graph Theory.
CO-6. Compose computer programs in a formal mathematical manner.
 SCHOOL OF ENGINEERING & TECHNOLOGY
D E PAR T M E N T OF COMPUTERSCIENCE AND
ENGINEERING

SCOPE AND IMPORTANCE OF SUBJECT

🞆 This course provides a mathematical foundation for subsequent study in Computer Science, as well
as developing the skills necessary to solve practical problems.
🞆 This course is one of the core course of CSE area, without this subject degree of B.Tech is
meaningless. This course will be the Prerequisite course for Theory of Automata and formal
languages (to be studied in coming semester).
🞆 Many questions are asked in GATE exam from this course. In almost every interview, questions
from this subject will be asked.
 SCHOOL OF ENGINEERING & TECHNOLOGY
D E PA R T M E N T O F C O M P U T E R S C I E N C E A N D E N G I N E E R I N
G

Evaluation Method
Mode of Theory/Jury/Practical/Viva
examination
Weightage CA MTE ETE
Distribution
30% 20% 50%

• 5 quizzes will be conducted

• Assignments
• Project/ Case Study/ Presentation
• Regular Class Performance
• Certification/MOOC course based Evaluation
 Course Description
Unit 1 Introduction to Set Theory, Relations and Functions.
Set Theory: Introduction, Combination of sets, Multi sets, ordered
A
pairs, Set Identities.
Relations: Definition, Operations on relations, Properties of relations,
B
Composite Relations, Equality of relations, Order of relations.
Functions: Definition, Classification of functions, Operations on
C
functions, Recursively defined functions.
Unit 2 Logics and Mathematical Induction
Propositional Logic: Proposition, well formed formula, Truth tables,
A Tautology, Satisfiability, Contradiction, Algebra of proposition, Theory
of Inference, Natural Deduction.
Predicate Logic: First order predicate, well formed formula of
B
predicate, quantifiers, Inference theory of predicate logic.
Natural Numbers: Introduction, Mathematical Induction, Variants of
C
Induction, Induction with Nonzero Base cases.
Unit 3 Algebraic Structures
Definition, Groups, Subgroups and order, Cyclic Groups, Cosets, Lagrange's
A
theorem, Normal Subgroups,
Homomorphism’s, Definition and elementary properties of Rings and Fields,
B
Integers Modulo n.
Partial order sets: Definition, Partial order sets, Combination of partial order sets,
C
Hasse diagram.
Unit 4 Lattices and Applications
Definition, Properties of lattices – Bounded, Complemented, Modular and Complete
A
Lattice, Morphisms of lattices.
Boolean Algebra: Introduction, Axioms and Theorems of Boolean algebra,
Algebraic manipulation of Boolean expressions. Simplification of Boolean
B
Functions, Karnaugh maps, Logic gates, Digital circuits and Boolean algebra.
Combinational and sequential Circuits.
Recurrence Relation & Generating function: Recursive definition of functions,
C
Recursive algorithms, Method of solving recurrences.
Unit 5 Graph Theory and Applications.
A Trees: Definition, Binary tree, Binary tree traversal, Binary search tree.
Graphs: Definition and terminology, Representation of graphs, Multi graphs,
B Bipartite graphs, Planar graphs, Isomorphism and Homeomorphism of graphs, Euler
and Hamiltonian paths, Graph colouring.
C Combinatory: Introduction, Counting Techniques, Pigeonhole Principle
 Text book/s*
1) 1. C. L. Liu, Elements of Discrete Mathematics, second edition
1985, McGraw-Hill Book Company. Reprinted 2000.
2) Jean Paul Trembley, R Manohar, “Discrete Mathematical
Structures with Application to Computer Science”, McGraw-Hill.
3) K. H. Rosen, Discrete Mathematics and applications, fifth edition
2003, Tata McGraw Hill Publishing Company.
4) J .L. Mott, A. Kandel, T.P .Baker, Discrete Mathematics for
Computer Scientists and Mathematicians, second edition 1986,
Prentice Hall of India.
5) W.K. Grassmann and J.P.Trembnlay, Logic and Discrete
Mathematics, A Computer Science
 CO-PO and CO-PSO mapping with level of strength

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

Cond
Cours uct Proje Fami Unde
Desig Envir
e inves The ct liarit rstan Appl
Engi n/ onme Indiv
Objec Probl tigati Mode engin Com mana Life- y and d, y
neeri devel nt idual
tives em ons rn eer Ethic muni geme long pract analy stand
ng opme and and
analy of tool and s catio nt learn ical se ard
know nt of sustai team
sis comp usage societ n: and ing profi and Softw
ledge soluti nabili work
lex y finan cienc devel are
ons ty
probl ce y op
ems

CO1 2 3 3 1 _ 3 _ _ 3 _ _ 3 3 3 _
CO2 2 2 3 _ _ 2 _ _ _ _ _ 3 3 2 _
CO3 3 2 3 3 3 _ _ _ 2 _ _ _ _ 3 2
CO4 2 2 3 3 3 _ _ _ _ _ 3 3 3 _ 3
CO5 2 2 2 3 _ 3 _ _ 3 _ 3 3 _ 2 3
CO6 1 2 1 2 3 _ _ _ 3 _ 3 _ 3 3 2
 SS C
CHHO OO O LL O FF EE N
O NGG II N
N EE EE RR II N
NG G& & TT EE C
CH HN NO O LL O
OGGYY
D EE PPA
D ARR TT MM EE N
N TT O FF
O CCO OM M PP UU TT EE R
R SS C
C II EE N
NCC EE A AN
NDD EE N
NGG
II N
N EE EE R
R II N
NG G

THANK
YOU