cs 3623 - design and analysis of algorithms (3) f, sp

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 with grades of “c” or higher.