Programme: Course Title: Course Code:

B. Tech. (CSE) Discrete Mathematics CSE 219

Type of Course: Prerequisites: Total Contact Hours:
Institute Core NA 40Hrs.
Year/Semester: Lecture Hrs/Week: Tutorial Hrs/Week: Practical Hrs/Week: Credits:
1/Even 3 0 0 3

Learning Objective:
Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than
continuous. In contrast to real numbers that have the property of varying smoothly, the objects studied in
discrete mathematics (such as integers, graphs, and statements in logic) do not vary smoothly, but have
distinct, separated values. Research in discrete mathematics substantially increased in the late twentieth
century partly due to the development of digital computers, which operate in discrete steps and store data
in discrete bits. The objective of this course is to introduce the students to the fundamentals of discrete Jaipur
LNMIIT,
mathematics as used in the field of computer science. It will be attempted to teach the subject in such a
Department
way that is interesting and fruitful for both the students having a natural affinity for the of Computer
beauty of abstract Science & En
reasoning as well as for the students who are primarily interested in its practical applications.

Course outcomes (COs):

On completion of this course, the students will have the ability to: Bloom’s
Level
CO-1 Understand the concepts of formal statements and prove them using 2
proof techniques.
CO-2 Understand the concepts of Sets, Functions and Relation and Discrete 2
Structures
CO-3 Apply concepts from combinatorics to relevant problems. 3
CO-4 Analyze graphs and its properties using mathematical proofs. 4

Course Topics Lecture CO

Hours Mapping
UNIT-I (MATHEMATICAL LOGIC)
Propositional logic: Proposition logic, logical connectives, truth tables, tautologies,
contradiction, normal forms (conjunctive and disjunctive), modus ponens, modus
6
tollens, validity and satisfiability
Predicate logic: Predicates, Quantifiers, Rules of Inference for Quantified Statements. CO1
Notion of proof: Proof by implication, converse, inverse, contrapositive, negation
and contradiction, direct proof, proof by using truth table, proof by counterexample. 3
Induction over natural numbers
UNIT – II (SET THEORY, FUNCTIONS AND RELATIONS)
Set Theory: Definition of Sets, Venn Diagrams, Cartesian products, Power sets, 2 CO2
Cardinality and Countability (Countable and Uncountable sets)
 Function: Domain, Range, One-to-One, Onto Inverses and Composition One-to-One 2
Correspondence

2
Relation: Definition, types of relation, composition of relations, domain and range of
a relation, pictorial representation of relation, properties of relation, partial ordering
relation.
UNIT – III (DISCRETE STRUCTURES)
Groups: Groups, Isomorphism, Homomorphism, and Subgroups 3 CO2
Introduction to Rings, Fields, and Lattices.
UNIT – IV (COMBINATORICS)

Foundations of Counting: Basic rules of Counting, Pigeonhole principle,

Permutations, Derangements, Combinations, Permutations and combinations with 5
repetitions, The Binomial Theorem, Inclusion-Exclusion Principle, Binomial
coefficients, and Pascal's triangle.
LNMIIT, Jaipur
Inductions & Algorithms: The division algorithm, Divisibility Properties,Department of Computer Science & En
Mathematical Inductions (Weak & Strong), algorithms Correctness, The growth of
functions. CO3
5
Number Theory: Modular Arithmetic, Prime Numbers and GCD, Linear Congruence
Equations and Chinese Remainder Theorem, Fermat's Little Theorem, Primality
Testing.
Recursion: Recursively defined functions, solving recurrence relation, Master method,
5
Generating Functions, and its applications.
UNIT-V (GRAPHS AND TREES)
Graph Theory: Graph and subgraphs, paths, cycles, Euler and Hamiltonian
graphs, bipartite graphs, graph isomorphism, planar graphs on graphs, undirected 7 CO4
graphs, directed graphs, graph isomorphism.

Textbook:
1. Discrete mathematics and its applications, Kenneth H. Rosen. Tata McGraw Hill
Education Private Limited, 2012, Seventh editions.

Reference books:
1. Discrete Mathematics with Applications, Thomas Koshy. Elsevier.
2. Discrete mathematical structures, Bernard Kolman, Robert C. Busby, and Sharon Cutler Ross: Prentice Hall
PTR, 2005.
3. Foundations of Discrete Mathematics, Joshi K. D., New Age International (P) limited.
4. Number Theory, David M. Burton:. 6th Edition, Tata McGraw Hill Education Private Limited,
2007.
5. An Introduction to the Theory of Numbers, G.H. Hardy, and Edward M. Wright:. Oxford University Press.
ISBN: 9780198533108.
6. Graph Theory with Applications to Engineering and Computer Science, Deo Narsingh:. Prentice Hall of
 India Private Limited, 2001.
Additional Resources: Follow NPTEL lecture series on Discrete Mathematics

Evaluation Method
Item Weightage (%)
Assignment 1 2
Assignment 2 2
Assignment 3 2
Quiz-1 10
Quiz-2 10
Quiz-3 10
Mid Term 24
End Term 40 LNMIIT, Jaipur
*Please note, as per the existing institute’s attendance policy the student should have a minimum of 75%
Department of Computer Science
attendance. Students who fail to attend a minimum of 75% lectures will be debarred from the End
& En
Term/Final/Comprehensive examination.

CO and PO Correlation Matrix B.Tech CSE

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 3 1 2 1 3 3 1 1
CO2 3 3 2 1 2 1 3 3 1 1
CO3 3 3 1 1 2 1 3 3 1 1
CO4 3 2 1 1 2 1 3 3 1 1

CO and PO Correlation Matrix B.Tech CSE dual degree

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 3 1 2 1 3 3 1 1
CO2 3 3 2 1 2 1 3 3 1 1
CO3 3 3 1 1 2 1 3 3 1 1
CO4 3 2 1 1 2 1 3 3 1 1

CO and PO Correlation Matrix B.Tech CCE

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 3 1 2 1 3 3 1 1
CO2 3 3 2 1 2 1 3 3 1 1
CO3 3 3 1 1 2 1 3 3 1 1
CO4 3 2 1 1 2 1 3 3 1 1

Last Updated On: 22/11/2023

Updated By: Dr. Sudheer K. Sharma and Dr. Indra Deep Mastan