This course is considered as the second part of a two-course sequence on algorithmic solution design and advanced data structures. The objective of this course is to introduce advanced algorithms from different application areas to illustrate the techniques used to construct those algorithms, and to study algorithm performance. Topics include: space and time tradeoffs, dynamic programming, greedy technique, iterative improvement, and limitation of algorithm power.