DISCRETE MATHEMATICS

Description: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.Table of Contents:Chapter 1 : Seti Chapter 2 : Relationi Chapter 3 : Number Theoryi Chapter 4 : Functioni Chapter 5 : Predicate Calculusi Chapter 6 : Poseti Chapter 7 : Latticei Chapter 8 : Finite Boolean Algebrai Chapter 9 : Recursive Equationsi Chapter 10 : Generating Functioni Chapter 11 : Method Of Proofsi Chapter 12 : Permutationsi Chapter 13 : Combinationsi Chapter 14 : Groupi Chapter 15 : Cyclic Groupi Chapter 16 : Permutationi Chapter 17 : Matrixi Chapter 18 : Graphi Chapter 19 : Path and Circuiti Chapter 20 : Graph Algorithmsi Chapter 21 : Formal Languagei Chapter 22 : Finite Automatai Chapter 23 : Galois Field