Discrete Structures and Theory of Logic notes pdf | DSTL quantum pdf | DSTL MCQ aktu pdf download

Unit 1: 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 2: Algebraic Structures: 

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.

 Unit lII : Lattices: 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, Logicgates, Digital circuits and Boolean algebra.

Unit IV: Propositional Logic:

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

 Unit V: Trees: 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.

Text books: 

1.Koshy, Discrete Structures, Elsevier Pub. 2008 Kenneth H. Rosen, Discrete Mathematics and Its Applications, 6/e, McGraw-Hill, 2006. 

2. B. Kolman, R.C. Busby, and S.C. Ross, Discrete Mathematical Structures, 5/e, Prentice Hall, 2004.

3.E.R. Scheinerman, Mathematics: A Discrete Introduction, Brooks/Cole, 2000.

 4.R.P. Grimaldi, Discrete and Combinatorial Mathematics, 5/e, Addison Wesley, 2004

 5.Liptschutz, Seymour, " Discrete Mathematics", McGraw HillL. 

6.Trembley, J.P & R. Manohar, "Discrete Mathematical Structure with Application to Computer Science", McGraw Hill. 4. Deo,

 7.Narsingh, "Graph Theory With application to Engineering and Computer.Science.", PHI. 

8. Krishnamurthy, V., "Combinatorics Theory & Application", East-West Press Pvt. Ltd., New Delhi.