| Synopsis: |
This textbook has been written for students pursuing a BE/BTech in computer science or a MCA/MTech, DOEACC-B Level or equivalent course. The topics covered are self-contained and include sets, relations, recurrence relations, generating functions, posets, lattices, methods of proofs, the Quine McKluskey method, Floyed Warshall's algorithm, finite automata and bipartite graphs. Only necessary theorems have been included and, wherever required, their applicability has been demonstrated using appropriate examples. The text makes extensive use of diagrams and contains a number of solved examples and exercises for hands on experience. |