Discrete Mathematics

January - April 2014

Course description

This course is aimed at M. Sc Applications of Mathematics students.

A tentative plan of the course is given below.

Part 1: Permutations, Combinations and Binomial Theorem
Part 2: Advanced counting techniques
Part 3: Graph theory
Part 4: Probability
Part 5: To be decided later during the course

Hours

Lectures	Mon 14:00 - 15:15	Lecture Hall B
	Wed 14:00 - 15:15	Lecture Hall B

Grading

Mid-semester exam 50%

End-semester exam 50%

References

[1] H.S. Hall and S.R. Knight: Higher Algebra

[2] Kenneth Rosen: Discrete Mathematics and its Applications (Seventh edition)

[3] J. Matoušek and J. Nešetřil: Invitation to Discrete Mathematics (Second edition), Oxford University Press.

Topics, reading material and exercises

Topic	Practice problems
Permutations, Combinations, Binomial Theorem and Progressions	Tutorial 1 Tutorial 2
Recurrence relations	Problems 1 - 20 from Chapter 8.1 of [2]
Generating functions
Graph Theory	Chapter 4 of [3]