Mathematics for Computer Science

Code: MA618 | L-T-P-C: 3-0-0-6

MA618 Mathematics for Computer Science L-T-P-C [3-0-0-6]

Review of sets, functions, relations; Logic: formulae, interpretations, methods of proof in propositional and predicate logic; Number theory: division algorithm, Euclid's algorithm, fundamental theorem of arithmetic, Chinese remainder theorem; Combinatorics: permutations, combinations, partitions, recurrences, generating functions; Graph Theory: isomorphism, complete graphs, bipartite graphs, matchings, colourability, planarity; Probability: conditional probability, random variables, probability distributions, tail inequalities.

Texts:

1. E. Lehman, F.T. Leighton and A.R. Meyer, Mathematics for Computer Science, Creative Commons, 2017.
2. K.H. Rosen, Discrete Mathematics and its Applications, 7th Edn., McGraw Hill Education, 2011.

References:

1. R.L. Graham, D.E. Knuth and O. Patashnik, Concrete Mathematics, 2nd Edn., Addison-Wesley, 1994.
2. D.M. Burton, Elementary Number Theory, 7th Edn., McGraw-Hill Higher Education, 2010.
3. R. Diestel, Graph Theory, 4th Edn.,, Springer, 2010.
4. W. Feller, An introduction to probability theory and its Applications Vol. 1, 3rd Edn., Wiley, 2008.
5. S.M. Ross, A First Course in Probability, 9th Edn., Pearson, 2012.