CS 5713 - Analysis of Algorithms

Sem. Hrs: 3

The analysis of space and time requirements of algorithms. Worst-case and average case studies. Greedy algorithms and divide-and-conquer algorithms examined. Tractable and intractable algorithms surveyed.

Prerequisites: CS 3113 or “B” or better in CS 5032, and MATH 2214.
Dual Listed/Cross Listed: Dual listed as CS 4713.