Discrete StructuresThis book has been written according to the latest syllabi for B. Tech. & M.C.A. courses of Punjab Technical University and other technical universities of India. The previous years' university questions papers have been solved systematically and logically in each chapter. It is intended to help students better understand the concepts and ideas of discrete structures. |
Contents
Propositions and logic operations Connectives Tautologies | 8 |
Chapters Pages | 8 |
PUNJAB TECHNICAL UNIVERSITY JALANDHAR | 8 |
COURSE CONTENTS | 15 |
Relations | 46 |
Functions | 100 |
4A Mathematical Induction | 142 |
4B Basic Counting Principles | 155 |
InclusionExclusion Principle | 183 |
Recurrence Relations and Generating Functions | 194 |
SECTION C | 204 |
Groups | 224 |
Other editions - View all
Common terms and phrases
A₁ antisymmetric B₁ B₂ binary operation binary tree Boolean algebra Boolean expression C₁ C₂ called circuit commutative Commutative law Complement law Consider contains cycle defined denoted Determine directed graph Distributive law domain elements equivalence relation Example 11 F F F F T F Find the number finite set function f given graph G graph shown Hasse diagram Hence proved identity Induction integral domain inverse lattice Let f matrix minsets multiplication natural numbers node number of permutations number of students one-one ordered pairs P₁ P₂ path planar graph Proof q₁ R₁ recurrence relation reflexive Required number Show shown in Fig solution subgroup of G symmetric Theorem total number transitive closure true truth table V₁ V₂ Venn diagram vertex vertices W₁ x₁ zero divisors