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

Description: Induction, permutations, combinations, finite probability, relations, graphs, trees, graph algorithms, recurrence relations, generating functions. Problem solving in all these areas.