Discrete Mathematics

This book is intended to be a textbook for the student pursuing B.E.B.Tech in Computer Science or MCAM Tech and NIELIT - B & C Level or equivalent courses. Topics included are self contained. Sequence is maintained in such a way that no prerequisite is necessary. This book contains topics ranging from set, relation, recurrence relation, generating function, posets, lattice, methods of proofs, Quine McKluskey Method, Floyd Warshall's algorithm, finite automata, bipartite graph etc. Only necessary theorems have been included, and wherever required, theirs applicability has been demonstrated using appropriate examples. Whenever required, a diagram is used to make the concept easily understood to the reader. It contains good number of solved examples and exercises for hands on practice.

Chapter 1 : Set

Chapter 2 : Relation

Chapter 3 : Number Theory

Chapter 4 : Function

Chapter 5 : Predicate Calculus

Chapter 6 : Poset

Chapter 7 : Lattice

Chapter 8 : Finite Boolean Algebra

Chapter 9 : Recursive Equations

Chapter 10 : Generating Function

Chapter 11 : Method Of Proofs

Chapter 12 : Permutations

Chapter 13 : Combinations

Chapter 14 : Group

Chapter 15 : Cyclic Group

Chapter 16 :  Permutation

Chapter 17 : Matrix

Chapter 18 : Graph

Chapter 19 : Path and Circuit

Chapter 20 : Graph Algorithms

Chapter 21 : Formal Language

Chapter 22 : Finite Automata

Chapter 23 : Galois Field

 

Dr. Vinay Kumar