Algorithms and Data Structures

Description

This course takes an in-depth look at the notion of algorithmic efficiency and presents several techniques for analysing and improving it. We introduce the main techniques for efficient algorithms design (greedy, divide-and-conquer, dynamic programming, backtracking, etc.), as well as a brief introduction to algorithmic intractability. More advanced data structures such as graphs, trees and "heaps", as well as key partner algorithms and some applications, are also introduced.