Subject Code: MA5L003 Subject Name:  Discrete Mathematics L-T-P: 3-1-0 Credit:4
Pre-requisite(s): Nil
Set theory: sets, relations, functions, countability; Logic: formulae, interpretations, methods of proof, soundness and completeness in propositional and predicate logic; Number theory: division algorithm, Euclid's algorithm, fundamental theorem of arithmetic, Chinese remainder theorem, special numbers like Catalan, Fibonacci, harmonic and Stirling; Combinatorics: permutations, combinations, pigeonhole principle, inclusion and exclusion principle, partitions, recurrence relations, generating functions; Graph Theory: paths, connectivity, subgraphs, isomorphism, trees, complete graphs, bipartite graphs, matchings, colourability, planarity, digraphs, Eulerian cycle and Hamiltonian cycle, adjacency and incidence matrices.
Text Books:
  1. Rosen K. H. Discrete Mathematics & its Applications, Tata McGraw-Hill
  2. Balakrishnan V. K. Introductory Discrete Mathematics, Dover
Reference Books:
  1. Liu C. L. Elements of Discrete Mathematics, Tata McGraw-Hill
  2. Grimaldi R. P. Discrete and Combinatorial Mathematics, Pearson Education
  3. Penner R. C.,  Discrete Mathematics: Proof Techniques and Mathematical Structures, World Scientific
  4. Graham R. L., Knuth  D. E. and Patashnik  O. Concrete Mathematics, , Addison-Wesley
  5. Hein  J. L. Discrete Structures, Logic, and Computability,  Jones and Bartlett
  6. Burton D. M. Elementary Number Theory, McGraw Hill
  7. Deo N. Graph Theory, Prentice Hall of India