18001025661 / 8527794500

Syllabus | B. Tech. Electronics & Communication Engineering | Discrete Mathematics

13040303 Discrete Mathematics Learning Schedule
Pre-requisites: Fundamental of Mathematics 3 1 0 4



The Ideas of Discrete Mathematics are the fundamental to the science and technology specific to the computer age. This subject provides an introduction to some fundamental concepts in Discrete Mathematics for the students. The topics covered include: mathematical logic, proof techniques, especially mathematical induction, set theory, functions, and relations, procedures, recursion, and operation counts, recurrence relations, analysis of algorithms, counting methods, permutations and combinations, graphs and trees.


The objective of this course is to:

  1. develop a foundation of set theory concepts and notation
  2. explore a variety of various mathematical structures by focusing on mathematical objects, operations, and resulting properties
  3. develop formal logical reasoning techniques and notation
  4. demonstrate the application of logic to analyzing and writing proofs
  5. develop techniques for counting, permutations and combinations
  6. develop the concept of relation through various representations (digraphs, matrices, lists).


At the end of the course student will be able to:

  1. Construct proofs using direct proof, proof by contraposition, proof by contradiction, proof by cases
  2. Construct mathematical arguments using logical connectives and quantifiers and verify the correctness of an argument using propositional and predicate logic and truth tables.
  3. Demonstrate the ability to solve problems using counting techniques and combinatory in the context of discrete probability.
  4. Solve problems involving recurrence relations and generating functions.
  5. Perform operations on discrete structures such as sets, functions, relations and sequence


Unit I: Set Theory

Introduction, Combination of sets, Multisets, Ordered pairs. Proofs of some general identities on sets. Relations: Definition, Operations on relations, Properties of relations, Composite Relations, Equality of relations, Recursive definition of relation, Order of relations. Functions: Definition, Classification of functions, Operations on functions, Recursively defined functions, Growth of Functions, Natural Numbers: Introduction, Mathematical Induction, Variants of Induction, Induction with Nonzero Base cases. Proof Methods, Proof by counter – example, Proof by contradiction.

Unit II: Algebraic Structures

Definition, Groups, Subgroups and order, Cyclic Groups, Cosets, Lagrange’s theorem, Normal Subgroups, Permutation and Symmetric groups, Group Homomorphisms, Definition and elementary properties of Rings and Fields, Integers Modulo n.

Unit III: Partial order sets

Definition, Partial order sets, Combination of partial order sets, Hasse diagram. Lattices: Definition, Properties of lattices – Bounded, Complemented, Modular and Complete lattice. Boolean Algebra: Introduction, Axioms and Theorems of Boolean algebra, Algebraic manipulation of Boolean expressions. Simplification of Boolean Functions, Karnaugh maps, Logic gates, Digital circuits and Boolean algebra.

Unit IV: Propositional Logic                                                                                                  

Proposition, well-formed formula, Truth tables, Tautology, Satisfiability, Contradiction, Algebra of proposition, Theory of Inference Predicate Logic: First order predicate, well-formed formula of predicate, quantifiers, Inference theory of predicate logic.

Unit V: Trees                                                                                                                            

Definition, Binary tree, Binary tree traversal, Binary search tree. Graphs: Definition and terminology, Representation of graphs, Multigraphs, Bipartite graphs, Planar graphs, Isomorphism and Homeomorphism of graphs, Euler and Hamiltonian paths, Graph coloring Recurrence Relation & Generating function: Recursive definition of functions, Recursive algorithms, Method of solving recurrences. Combinatory, Introduction, Counting Techniques, Pigeonhole Principle


  1. Elements of Distcrete Mathematics – Liu and Mohapatra, McGraw Hill Publications
  2. Discrete Mathematical Structures – B. Kolman, R.C. Busby, and S.C. Ross, PHI Publications 


  1. Discrete Mathematical Structures with Application to Computer Science – Jean Paul Trembley and R Manohar, McGraw-Hill Publications
  2. Discrete and Combinatorial Mathematics – R.P. Grimaldi, Addison Wesley
  3. Discrete Mathematics and Its Applications – Kenneth H. Rosen, McGraw-Hill