General information
Office hours : Monday afternoons in Valrose, Petit Valrose, 4th floor, phone 12654
Overall evaluation: final examination plus 1 test week 4 or 5
Tentative schedule:
- march 5: first lecture and exercises
- may 23: final examination Room II, Math. dpt. 15:00pm-16:30pm.
Past lectures
| Lectures | Exercises | Add. Material |
| 1: Complexity and recursivity | 1: Complexity and recursivity | |
| 2: Trees and BST | 2: Trees | |
| 3: Queue, stack and graphs | 3: Trees cont'd | |
| 4: Queue, stack and graphs (cont'd) | 4: Programming graphs | 4: Program Files |
| 5: Shortest paths | 5: 1st test | 5: Program Files |
| 6: Sorting and searching | 6: Sorting | |
| 7: Hashing | 7: Searching and hashing | 7: Selection |
| 8: Exploration problems | 8: Searching and hashing cont'd | |
| 9: NP-completeness | 9: NP-completeness |
Last year final exam
Example of last year exam in the pdf file
References
- Introduction to algorithms, Cormen, T.H, Leiserson, C. E and Rivest, R.L, MIT Press, 2001
- Types de données et algorithmes, Froidevaux, C. , Gaudel, M-C., Soria, M., Edisciences, 1994.
- Generatingfunctionology, Wilf, H.S, avaible online from the author’s website
- The Ruby Programming Language, Flanagan, D. and Matsumoto, Y., O’Reilly, 2008
- Algorithms in C, Parts 1-4: Fundamentals, data structures, sorting, searching, Sedgewick, R., Addison-Wesley Professional, 1997.
- Algorithms and Data Structures, Melhorn, K., Sanders, P., Springer Verlag, 2008.
- An introduction to the analysis of algorithms, Sedgewick, R. , Flajolet, Ph. Addison Wesley, 1996.
- The design and analysis of computer algorithms, Aho, A.V., Hopcroft, J.E. and Ullman, J.D., Addison Wesley, 1974.
- Computers and Intractability, a guide to the theory of NP-completeness, Garey, M.R. and Johnson, D. S., Freeman, 1979.
- Recursive algorithms in computer science courses: Fibonacci numbers and binomial coefficients, I. Stojmenovic, IEEE trans. on education, vol. 43(3) pp. 273-276, 2002.
- Algorithms, S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani.
