Description: The course covers mathematics useful in analyzing computer algorithms. Topics include recurrence relations; evaluation of sums; integer functions; elementary number theory; binomial ...

This is a course covering a number of concepts and techniques of discrete mathematics. Topics covered: Counting: selections; inclusion-exclusion; generating functions; recurrence relations.