SWE 588 Sp. Tp. Advanced Algorithms 2015 Fall

Course definition in the university catalog format: SWE 588 Special Topics in Software Engineering: Advanced Algorithms (3+0+0) 3

Divide-and-conquer algorithms. Randomized algorithms. Greedy algorithms. Dynamic programming. Linear programming and reductions. Approximation algorithms.

Prerequisite: SWE510 or equivalent

Introduction: The aim of this course is to familiarize the student with some general algorithm design techniques, like divide-and-conquer, randomized algorithms, greedy algorithms, dynamic programming and linear programming. Ways of coping with NP-completeness, such as approximation algorithms, and intelligent exhaustive search, will be examined.

Topics (subject to change): 1. Quick review of SWE510 2. Divide-and-conquer algorithms 3. Randomized algorithms 4. Greedy algorithms 5. Dynamic programming 6. Linear programming and reductions 7. Intelligent exhaustive search 8. Approximation algorithms

Computer Usage: None

Laboratory projects: None.