The course is intended to introduce selected fundamental algorithms from  different application areas to illustrate the techniques used to construct specific 
strategies for solving problems, and to study the performance of these algorithms.
Topics include formal definition and characterization of algorithms, fundamentals  of algorithm efficiency including recurrence relations, asymptotic notation, 
efficiency classes, empirical analysis of performance, brute force techniques,  divide-conquer, decrease-conquer, graphs, and dynamic programming and greedy  technique for optimization problems.