|Number of Pages||450 Pages|
This book is intended to be a textbook for the student pursuing B.E.B.Tech in Computer Science or MCAM Tech, DOEACC-B 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, Floyed Warshall's algorithm, finite automata, bipartite graph etc. Only necessary thorems have been included, and wherever required, theirs applicability has been demonstrated using apropriate 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 experience. Table of Contents Chapter 1. Set and Relation Chapter 2. Function and Generating Function Chapter 3. Solving Recurrence Relation Chapter 4. Combinatorics Chapter 5. Group Chapter 6. Ordered Set Chapter 7. Graph Theory and Tree Chapter 8. Finite Automata Chapter 9. Derived Algebraic Structures BIBLIOGRAPHY…… INDEXES…….