Scribd
Upload
18 views

Discrete mathematics 2023-27

Uploaded by

Ankit Kumar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
18 views

Discrete mathematics 2023-27

Uploaded by

Ankit Kumar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Course Category: Core Course

Course Name: Discrete Mathematics


Course Code: UCS2002
L-T-P: 4-0-0
rd
Semester: 3
Batch: 2023-27
Syllabus
Prerequisite:
The student should have the understanding of:
● Mathematical concepts such as set theory.
● Basic logical and analytical skills.
Course Outcomes:
At the end of the course, students will be able to:

CO1 To reproduce the fundamental concepts of sets, relations, and functions.


To understand the concept of groups and to evaluate the Lagrange’s
CO2 theorem.
CO3 To understand partial order relation, POSET and LATTICE.
To demonstrate the fundamental principles of boolean algebra and
CO4 propositional logic.
To apply graph theory concepts to solve real-world problem like shortest path
CO5 problem etc.

Unit CO No. of
No Topics No. Lecture
Set Theory: Introduction, Combination of sets, Multisets, 1 8
Ordered pairs. Proofs of some general identities on sets.
Relations: Definition, Operations on relations, Properties of
relations, Composite Relations, Equality of relations,
1 Recursive definition of relation, Order of relations.
Functions: Definition, Classification of functions,
Operations on functions, recursively defined functions.
Growth of Functions.
Algebraic Structures: Definition, Groups, Subgroups and 2 8
order, Cyclic Groups, Cosets, Lagrange's theorem, Normal
2 Subgroups, Permutation and Symmetric groups, Group
Homomorphisms
Partial order relation, Lattices: Definition, Properties of 3 8
3 lattices – Bounded, Complemented, Modular and Complete
lattice, Combinatorics: Introduction, Counting Techniques, 4 8
4 Pigeonhole Principle
Unit CO No. of
No Topics No. Lecture
Set Theory: Introduction, Combination of sets, Multisets, 1 8
Ordered pairs. Proofs of some general identities on sets.
Relations: Definition, Operations on relations, Properties of
relations, Composite Relations, Equality of relations,
1 Recursive definition of relation, Order of relations.
Functions: Definition, Classification of functions,
Operations on functions, recursively defined functions.
Growth of Functions.
Algebraic Structures: Definition, Groups, Subgroups and 2 8
order, Cyclic Groups, Cosets, Lagrange's theorem, Normal
2 Subgroups, Permutation and Symmetric groups, Group
Homomorphisms
Partial order relation, Lattices: Definition, Properties of 3 8
lattices – Bounded, Complemented, Modular and Complete
3 lattice, Combinatorics: Introduction, Counting Techniques,
Pigeonhole Principle
4 8
Boolean algebra: Introduction, basic operation, boolean
function, De’ Morgans theorem, Sum of Product and
Product of Sum, K-Map (2, 3 and 4 variables).
4
Propositional Logic: Proposition, well-formed formula, Truth
tables, Tautology, Satisfiability, Contradiction, Algebra of
proposition, Theory of Inference.
Graphs: Definition and terminology, Representation of 5 8
graphs, Multigraphs, Bipartite graphs, Planar graphs,
5 Isomorphism and Homeomorphism of graphs, Euler and
Hamiltonian paths.

Text Book:
1. Discrete Mathematics and Its Applications, Kenneth H. Rosen
2. A Textbook of Discrete Mathematics, 9th Edition, Sarkar, Swapan Kumar, S.
Chand Publishing
Reference Book:
1. D. S. Malik, M. K. Sen, “Discrete Mathematics” Cengage Learning, 2012
2. Tremblay J.P. and Manohar, R., “Discrete Mathematical Structures with
Applications to Computer Science” Tata McGraw Hill

You might also like