| Complexity of algorithms
| Asymptotic notations and their significance,
complexity analysis of algorithms, worst case and average case.
| 2 hours |
| Algorithmic paradigms
| Recursion, divide-and-conquer, greedy,
dynamic programming, lower bounds and optimal algorithms.
| 8 hours |
| Basic data structures
| Stacks and queues, graphs and trees, binary trees.
| 2 hours |
| Heaps
| Heaps, priority queues, min-max heaps, heap sort.
| 4 hours |
| Dynamic search structures
| Binary search trees, height balancing, B-trees,
skip lists, hashing.
| 8 hours |
| Algorithms on arrays
| Linear-time median finding, sorting in linear time
(counting sort, radix sort, bucket sort), string matching (Rabin-Karp
and Knuth-Morris-Pratt algorithms).
| 8 hours |
| Graph algorithms
| Traversal (BFS, DFS, topological sort), minimum
spanning trees (Prim and Kruskal algorithms), shortest paths
(Dijkstra and Floyd-Warshal algorithms)
| 8 hours |
| [1]
| Thomas H Cormen, Charles E Lieserson, Ronald L Rivest and Clifford Stein, Introduction to Algorithms, Second Edition, MIT Press/McGraw-Hill, 2001.
|
| [2]
| Jon Kleinberg and Éva Tardos, Algorithm Design, Pearson, 2005.
|
| [3]
| Michael T Goodrich and Roberto Tamassia, Algorithm Design: Foundations, Analysis, and Internet Examples, Second Edition, Wiley, 2006.
|
| [4]
| Udi Manber, Algorithms -- A Creative Approach, Addison-Wesley, Reading, MA, 1989.
|
| [5]
| Harry R. Lewis and Larry Denenberg, Data Structures and Their Algorithms, Harper Collins, 1997.
|
| [6]
| Robert Sedgewick and Kevin Wayne, Algorithms, fourth edition, Addison Wesley, 2011.
|
| [7]
| Muhammad H. Alsuwaiyel, Algorithms: Design Techniques and Analysis, World Scientific, 1999.
|
| [8]
| Gilles Brassard and Paul Bratley, Algorithmics: Theory and Practice, Prentice-Hall, 1995.
|
| [9]
| Sara Baase and Allen Van Gelder, Computer Algorithms: Introduction to Design and Analysis, third edition, Addison-Wesley, 2000.
|
| [10]
| Alan Gibbons, Algorithmic Graph Theory, Cambridge University Press, 1985.
|