Reading ExamsOn request I organize exams on the topics mentioned below. The credit is 7.5 ECTS points. An exam can be written or oral: a written exam takes 4 hours and there will be 5 questions, an oral exam takes 1/2 hour and it can be with or without preparation. There will be a censor associated with each exam, and grading is based on the new 7-grade scale. If you want to take an exam in any of these topics, contact me at my office or electronically. The registration should take place 6 weeks before the planned exam. In a written exam you can have with you the textbook, copies of my slides (if any), your own notes, a dictionary, a mathematical handbook, a pocket calculator, normal writing materials, and some food and drink. If you want to take something else with you, be sure that it is approved by me. Jyrki Algorithmics for Hard ProblemsJuraj Hromkovic, Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics, 2nd Edition, Springer-Verlag, Berlin/Hedelberg (2003) The whole book Computational ComplexityChristos H. Papadimitriou, Computational Complexity, Addison-Wesley Publishing Company, Reading (1994)12 chapters according to agreement Geometric AlgorithmsMark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Scharzkopf, Computational Geometry: Algorithms and Applications, 2nd Edition, Springer-Verlag, Berlin/Heidelberg (2000)The whole book Online AlgorithmsAllan Borodin and Ran El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, Cambridge (1998)Chapters 1, 2, 3, 4, 6, 7, 8, 10, 12, 14 (Sections 14.1, 14.2), and 15. Parallel AlgorithmsJoseph JáJá, An Introduction to Parallel Algorithms, Addison-Wesley Publishing Company, Inc., Reading (1992)The whole book Randomized AlgorithmsRajeev Motwani and Prabhakar Raghavan, Randomized Algorithms, Cambridge University Press, Cambridge (1995)The whole book, except Sections 7.7, 7.8, 12.5, 12.6 This page was last modified by Jyrki Katajainen on 06.10.2006. |