DISCRETE MATHEMATICAL STRUCTURES

(Common to CSE & IT)

II Year I Semester
Lecture: 3 +1* Internal Marks : 40
Credits: 4 External Marks: 60

Course Objectives:
Comprehend the structure of statements (and arguments) involving predicates and
quantifiers.
Understand the applications of graph theory to various practical problems.
Know how to solve a recursive problem.
Course Outcomes:
Students will be able to:
apply the concept of Mathematical logic in software development process.
n log n
use the concept of Pigeon hole principle to derive the lower bound.
apply the concepts of group theory in robotics, computer vision & computer graphics.
use the concepts of graph theory to provide solutions for routing applications in
computer networks.
apply the recurrence relation for analyzing recursive algorithms.

UNIT - I: Mathematical Logic

Propositional Calculus: Statements and Notations, Connectives, Truth Tables, Tautologies,
Equivalence of Formulas, Tautological Implications, Theory of Inference for Statement
Calculus, Consistency of Premises. Concept of Quantifiers.

UNIT - II: Relations & Functions

Relations: Properties of Binary Relations, Equivalence, Compatibility and Partial order
relations, Hasse Diagram Functions: Inverse, Composite and Recursive functions, Pigeon
hole principle and its application.

UNIT - III: Algebraic Structures

Algebraic Systems and Examples, general properties, semi group, Monoid, Groups,
Subgroups, Lattice and properties.

UNIT - IV: Graph Theory - I: (Theorems without proofs).

Concepts of Graphs, Sub graphs, Multi graphs, Matrix Representation of Graphs: Adjacency
Matrices, Incidence Matrices, Isomorphic Graphs.,.

UNIT - V: Graph Theory - II: (Theorems without proofs).

Paths and Circuits, Eulerian Graph, Hamiltonian Graph, Planar Graphs, Chromatic number
of a graph.

UNIT - VI: Combinatorics and Recurrence Relations:

Basics Counting Principles Generating functions, Solving linear homogeneous recurrence
Relations by substitution, The Method of Characteristic Roots, Solving Inhomogeneous
Recurrence Relations
Text Books:
1 J.P.Trembley, R Manohar, Discrete Mathematical Structures with Applications to
Computer Science, Tata McGraw Hill, New Delhi.
2 Mott, Kandel, Baker, Discrete Mathematics for Computer Scientists &
Mathematicians, 2nd edition, PHI.
3 Rosen, Discrete Mathematics and its Application with combinatorics and graph
theory: 7th editon, Tata McGraw Hill, New Delhi.
Reference Books:
1 S.Santha, Discrete Mathematics, Cengage publications.
2 J K Sharma, Discrete Mathematics, 2nd edition, Macmillan Publications.