Design and Analysis of Algorithms

Design and Analysis of Algorithms introduces basic elements of the design and analysis of computer algorithms. Topics include asymptotic notations and analysis, divide and conquer strategy, greedy methods, dynamic programming, basic graph algorithms, NP-completeness, and approximation algorithms. For each topic, beside in-depth coverage, one or more representative problems and their algorithms shall be discussed.

The major objectives of this course are:

• Analyze the asymptotic performance of algorithms.
• Demonstrate a familiarity with major algorithm design techniques
• Apply important algorithmic design paradigms and methods of analysis.
• Solve simple to moderately difficult algorithmic problems arising in applications.
• Able to demonstrate the hardness of simple NP-complete problems