Professor: Marcus Rolf Peter Ritt
Hours: 30 hs
Semesters: First and second semesters
Undergraduate Enrollment: –
Page Link: –
Analysis of algorithms and main techniques for designing algorithms.
The students will study the main techniques for designing and analyzing algorithms. After successful completion of the course, the students are expected to: (i) be able to analyze algorithms using standard techniques; (ii) be able to apply the main techniques in designing algorithms.
1. Introduction: Some representative Problems (chapter 1)
2. Basics of Algorithms Analysis (chapter 2)
3. Graphs (chapter 3)
4. Greedy Algorithms (chapter 4)
5. Divide and Conquer (chapter 5)
6. Dynamic Programming (chapter 6)
Students will be evaluated during the course through exams or exercise lists, as informed by the instructor at the beginning of the course. At the end of the semester, there will be an exam that can substitute the final score obtained. The possible grades are A (score ≥ 9.0), B (score ≥ 7.5 and < 9.0), C (score ≥ 6.0 and < 7.5), D (failed, score < 6.0), or FF (failed, the student attended less than 75% of the classes).
J. Kleinberg, É. Tardos. Algorithm Design. Addison Wesley, 2005.