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 Warshalls 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.

1. Set
2. Relation
3. Number Theory
4. Function
5. Predicate Calculus
6. Poset
7. Lattice
8. Finite Boolean Algebra
9. Recursive Equations
10. Generating Function
11. Method Of Proofs
12. Permutations
13. Combinations
14. Group
15. Cyclic Group
16. Permutation
17. Matrix
18. Graph
19. Path and Circuit
20. Graph Algorithms
21. Formal Language
22. Finite Automata
23. Galois Field

Dr. Vinay Kumar