Algorithms and data structure

Familiarize students with classic problems and their solutions.
Prepare students to find algorithmic solutions to problems by knowing how to compare their performance. Writing algorithms, and evaluating their complexity, also in relation to the choice of data structures.

I. Introduction 1. Problems 2. Algorithms 3. Recursion II. Algorithm analysis 1. Machine model 2. Measuring complexity 3. Algorithm comparison III. Abstract types 1. Array 2. Stack 3. File 4. Lists 5. Tree 6. Heap 7. Graph IV. Algorithm design techniques: divide and conquer/ gluttony/ dynamic programming

IT

Introduction to Algorithms by Thomas Cormen, Charles Leirserson, Ronald Rivest Dunod.