IT514 - Design and Analysis of Algorithms

This course is concerned with design and analysis of
algortihms. The design is concerned with function specification,
recursive formulation, and writing algorithmm, and analysis
is concerned with correctness proof and/or complexity analysis
as appropriate. The formulations for simple recusion,
divide-and-conquer, greedy, dynamic prograaming,
and back tracking/branch-and-bound methods are covered.
Lower bound theory is introduced. Problem classes NP, NP-Hard, and NP-Complete are defined. Randomized algortihms are introduced.