The goal is to introduce students to the practice of algorithmic solutions, through the presentation of the most important class of algorithms and the analysis of their performance. The course will focus on algorithms and data structures for problems on string, trees and graphs.
At the end of the course, students are expected to:
- evaluate algorithmic choices and select the ones that best suit their problems
- analyze the complexity of existing algorithms and algorithms created on their own
- design simple algorithmic solutions to basic problems