Algorithm design and analysis is fundamental to all areas of computer science and gives a rigorous ... divide and conquer, dynamic programming, network flows, reductions, and randomized algorithms.

This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science. Example topics include ... deterministic algorithms and ...