The course is intended to introduce selected fundamental algorithms from different application areas to illustrate the techniques used to construct those algorithms, and to study their performance. Topics include: formal definition and characterization of algorithms, fundamentals of algorithm efficiency including recurrence relations, asymptotic notation, efficiency classes and empirical analysis of performance, brute force techniques, divide-conquer, decrease-conquer and graphs.