DISCRETE STRUCTURES L T P C TOTAL
SMTB1212 (ONLY FOR CSE SPL )
3 * 0 3 100
COURSE OBJECTIVES:
The Objective of this Course is to identify, reflect upon, evaluate and achieve conceptual understanding
and knowledge of traditional Calculus to form independent judgements.
The purpose of this course is for modeling the Engineering problems and obtaining its solutions
mathematically.
This helps in understanding Science, Engineering and Computer Science analytically and logical
thinking is attained.
UNIT- I LOGIC 9Hrs
Statements – Truth Tables – Connectives – Equivalent Propositions – Tautological Implication – Normal Forms
– Inference Theory – Consistency and Inconsistency of Premises.Proportional Functions – Quantifiers – Universal
and Existential – Inference Theory – Rules of Inference Theory - Problems
UNIT-II ALGEBRAIC STRUCTURES 9Hrs
Algebraic system – Semigroups – Monoids (definitions and examples only) – Groups – Cyclic groups – Subgroups
– Cosets – Lagrange’s Theorem
UNIT- III COMBINATORICS 9 Hrs
Mathematical Induction – Recurrence Relation – Solving Recurrence Relations by using Particular Solutions –
Generating Functions – Solution to Homogeneous and Non – Homogeneous Recurrence Relation by Generating
Function.
UNIT-IV LATTICES AND BOOLEAN ALGEBRA 9 Hrs
Partial order relation – Hasse Diagram –Lattices – Properties of Lattices – Duality of Lattices – Special Lattices
– Modular lattices – Complemented Lattices – Distributive Lattices- Boolean Identities – Atomic Boolean Algebra
– Boolean Functions – Simplification of Boolean Functions
UNIT- V GRAPH THEORY 9 Hrs
Introduction to Graphs – Graph Terminology – Cycles – Paths – Complete and Bipartite Graphs – Matrix
Representation of Graphs – Graph Isomorphism – Connectivity – Trees – Euler and Hamiltonian Graphs
CCourse Outcomes: After completing this course, students will understand the following concepts thoroughly and
will be able to apply it in academic problems and industry/ real life problems.
Apply logic and truth tables to solve problems on Inference theory for propositional calculus and predicate
calculus. Distinguish PCNF and PDNF
Understand the basics of group properties and cosets. Apply the above concepts to derive Lagrange’s
theorem.
Appraise the solution of mathematical induction and pigeonhole principle. Develop the recurrence relation
and generating functions
Distinguish PCNF and PDNF. Analyze properties of functions and groups
Develop Euler, Hamiltonian paths. Identify graph isomorphism.
Illustrate the generality of tree, binary tree and tree expression.
TEXT/REFERENCE BOOKS:
1. Kenneth H.Rosen, Discrete Mathematicsandits applications, 6thEdition, McGraw- Hill,2007.
2. Veerarajan T., Discrete mathematics with Graph Theory and Combinatorics, Tata Mcgraw Hill Publishing
Co., NewDelhi, 2006.
3. NarasinghDeo, Graph Theory with application to Engineering and Computer Science, Prentice Hall India,
2010.
4. Tremblay, J., Manohar, R. (1975). Discrete Mathematical Structures with Applications to Computer
Science. Germany: McGraw-Hill, 1975.
5. Jongsma, Calvin. Introduction to Discrete Mathematics Via Logic andProof. Germany, Springer
International Publishing, 2019.
