%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% SYLLABUS DSA 2010/11 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

* Generalities on algorithms
* Recursion
* Correctness of algorithms
* Asymptotic complexity of algorithms 
* Divide and conquer, recurrences
* Search & Sorting 
-- linear & binary search
-- insertion/selection/bubble-sort
-- quicksort/mergesort
-- heap-sort
* Pointers, lists, stacks, queues, priority queues, abstract data types
* Trees, red-black trees
* Hash tables
* Graph algorithms 
-- DFS/BFS, 
-- DAGs, Topological sorting
* Weighted-graph algorithms 
-- minimum spanning tree (Prim, Kruskal)
-- shortest paths (Dijkstra, Bellman-Ford, s.p. with DAGs)