BBL 611E - Advanced Topics in Algorithms

Course Objectives

1) Understanding the fundamentals in algorithm design and analysis
2) Learning NP-complete concept and ways to approximate solutions
3) Using randomness in algorithm design
4) Learning methods to deal with the streaming data
5) Learning to deal with large data sets on external memory

Course Description

The course begins with the review of the time/space complexity analysis of algorithms and basic algorithm design approaches, which is to be followed by the NP-completeness concept. The basics in approximation algorithms, randomization, streaming algorithms, and external-memory algorithms will be explored. The data structures particularly serving for those algorithmic foundations will also be covered.