CS 4703/5703, Analysis of Algorithms

Course Description
Analysis of space and time requirements of algorithms. Worst-case and average-case studies. Greedy algorithms and divide-and-conquer algorithms. Tractable and intractable algorithms.

Prerequisites
CS 3363 (Data Structures) and MATH 2214 (Calculus II).

Scheduling
This course is offered in the fall semester of odd-numbered years.

Offerings
Fall 2006, Section 001Huang, X. MWF 10:00-10:50CSM 212