DSGT Syallbus

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 3

KIET School of Engineering & Technology, Ghaziabad

Department of Information Technology (NBA Accredited)


(An ISO 9001: 2008 Certified & A Grade accredited Institution by NAAC)

NCS-302: DISCRETE STRUCTURES AND GRAPH THEORY

Unit-I
Set Theory: Introduction, Combination of sets, Multisets, Ordered pairs, Set Identities.
Relations: Definition, Operations on relations, Properties of relations, Composite Relations,
Equality of relations, Order of relations.
Functions: Definition, Classification of functions, Operations on functions, Recursively
defined functions.
Natural Numbers: Introduction, Mathematical Induction, Variants of Induction, Induction
with Nonzero Base cases.
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,Morphisms of lattices.
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. Combinational and sequential Circuits

Unit-IV
Propositional Logic: Proposition, well formed formula, Truth tables, Tautology, Satisfiability,
Contradiction, Algebra of proposition, Theory of Inference ,Natural Deduction.
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.
Combinatorics: Introduction, Counting Techniques, Pigeonhole Principle

REFERENCES :
1. Liu and Mohapatra, Elements of Distcrete Mathematics, McGraw Hill
2. Jean Paul Trembley, R Manohar, Discrete Mathematical Structures with Application to
Computer Science, McGraw-Hill
3. Y. N. Singh, Discrete Mathematical Structures, Wiley India, New Delhi, First Edition, August 2010.
4. R.P. Grimaldi, Discrete and Combinatorial Mathematics, Addison Wesley,
5. B. Kolman, R.C. Busby, and S.C. Ross, Discrete Mathematical Structures, PHI Learning Private Limited,
Delhi India.
6. Biswal ,Discrete

Mathematics and Graph Theory, PHI Learning Private Limited, Delhi India.

7. Goodaire and Parmenter, Discrete Mathematics with Graph Theory, PHI Learning Private Limited,
Delhi India.
8. Lipschutz Discrete Mathematics McGraw Hill

9. Deo N., Graph Theory with Applications to Engineering and Computer Science, PHI Learning Private
Limited, Delhi India.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy