Instructor: Assoc. Prof. EMIL KELEVEDJIEV

Handouts:

1. Problems and Algorithms. Programming in C++ Revisited.
2. Recursion. Data Structures.
3. Analysis of algorithms.
4. Design of Algorithms. Divide and Conquer. Greedy Algorithms. Backtracking.
5. Sorting Algorithms. Quick Sort. Priority Queue.
6. Searching.
7. Mathematical Algorithms.
8. Dynamic Programming.
9. Elementary Geometric Algorithms.
10. Advanced Geometric Algorithms.
11. Elementary Graph Algorithms.
12. Basic Graph Algorithms.
13. Advanced Graph Algorithms.

Homework assignments

Score

Competition (March 20, 2012)

2012-04-23 08:09