DISCRETE MATHEMATICS [CS-503]

UNIT- I

Set Theory- Introduction, Elements & Description, Types, Venn-Euler Diagrams, Operations, Inclusion
and Exclusion Principle, Fuzzy sets, Functions- Introduction, Types, Range & Domain, Identity Function,
Relations- Binary relation, Types, Partial Order, Equivalence relation, Hasse Diagram.

UNIT- II

Principle of Mathematical Induction, Pigeonhole Principle, Mathematical Logic- Introduction,

propositional calculus, Logical operation, Statement, Converse, Inverse & Contra-positive Statement,
Tautologies, Contradiction, Quantifiers, Predicate calculus.

UNIT- III

Algebric Structures- Introduction, Mathematical Operations, Binary operations, Groups- Permutation

Groups, Cyclic Groups, Subgroup, Semigroup and Monoid, Homeomorphism and Isomorphism, Rings,
Fields, Poset and Lattices – Introduction, Chain, Lattice, Duality, Types of Lattices.

UNIT- IV

Graph Theory- Introduction, Types, Path, Cycles, Subgraph, Isomprphic Graph, Homeomorphic Graph,
Eularian and Hamiltonian graphs, Shortest Path Problem, Planar Graph, Graph Colouring and Chromatic
Polynomials, Trees- Introduction, Properties, Binary tree, Computer representation of General Trees,
Binary search Tree, Spanning Trees.

UNIT- V

Recurrence Relations and Generating Functions- Introduction, Linear Recurrence Relations with
Constant Coefficients, Methods of Solving Recurrence relations, Non-homogeneous Recurrence
Relations, Methods of Generating Functions.

Reference Book:

1. J K Sharma , “Discrete Mathematics”, Trinity Press, 4th Edition

2. C.L.Liu, “Elements of Discrete Mathematics” Tata Mc Graw-Hill Edition.
3. Trembley, J.P & Manohar; “Discrete Mathematical Structure with Application CS”, McGraw
Hill.
4. Kenneth H. Rosen, “Discrete Mathematics and its applications”, McGraw Hill.
5. Lipschutz; Discrete mathematics (Schaum); TMH