|
Course Discription |
:
This course introduces advanced concepts for the design and analysis of algorithms, and
explores a variety of applications. Several computation models and techniques for the
analysis of algorithm complexity are presented. The topics to be covered are: the design and
complexity analysis of recursive and non-recursive algorithms for searching, sorting, set
operations, randomization in algorithm design, graph algorithms, matrix multiplication, NP-
complete problems, and Approximation Algorithms. The discussed course topics are
reinforced through several programming projects. |