CS 3623 - Design and Analysis of Algorithms (3) F

Study of the techniques for designing algorithms and for analyzing the time and space efficiency of algorithms. The algorithm design techniques include divide-and-conquer, greedy algorithms, dynamic programming, randomized algorithms and parallel algorithms. The algorithm analysis includes computational models, best/average/worst case analysis and computational complexity (including lower bounds and NP-completeness).

Prerequisites: CS 2233 and (MA 2903 or CS 2223) with grades of “C” or higher.