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.