FI:I063 Algorithm Design II - Course Information
I063 Algorithm Design II
Faculty of InformaticsSpring 2004
- Extent and Intensity
- 2/0. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium).
- Teacher(s)
- prof. RNDr. Ivana Černá, CSc. (lecturer)
- Guaranteed by
- prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics - Timetable
- Tue 10:00–11:50 D2
- Prerequisites (in Czech)
- SOUHLAS
. - Course Enrolment Limitations
- The course is only offered to the students of the study fields the course is directly associated with.
- fields of study / plans the course is directly associated with
- Informatics (programme FI, B-IN)
- Informatics (programme FI, M-IN)
- Syllabus
- Complexity of algorithms -- worst-case and average-case analysis, amortized analysis.
- Advanced analysis techniques -- the aggregate method, the accounting method, the potential method.
- The design and application of effective data structures. Binomial and Fibonacci heaps. Splay trees. Union-find data structure.
- Advanced design techniques -- divide et impera, dynamic programming, greedy algorithms, backtracking. Theoretical foundations and applications.
- The design of randomized algorithms -- input randomization, random search, control randomization, symetry breaking. Expected vs. average running time. Las Vegas and Monte Carlo algorithms. Derandomization. Applications: searching trees, independent sets.
- The design of approximation algorithms -- relative approximation, approximation schemes. Applications: graph covering, traveling-salesman problem, scheduling, set covering, string matching.
- Online algorithms and competitive analysis. Probabilistic on-line algorithms. Applications: paging, robot motion.
- Literature
- Brassard,G.- Bratley,P. Fundamentals of algorithmics. Prentice Hall, 1996
- Cormen,T.H. - Leiserson,C.E. - Rivest,R.L. Introduction to algorithms. MIT Press, 1990
- Kozen, D. The Design and Analysis of Algorithms. Springer-Verlag, 1992
- Motwani,R. - Raghavan,P. Randomized algorithms. Cambridge University Press, 1995
- Assessment methods (in Czech)
- Predmet sa otvara posledny krat a je urceny studentom, ktori mali zapisany predmet I063 semestri ja studiaro 2003, ale v tomto semestri predmet neukoncili. Vyuka sa bude konat formou indiviualneho studia.
- Language of instruction
- Czech
- Further Comments
- The course is taught last offered.
- Enrolment Statistics (recent)
- Permalink: https://is.muni.cz/course/fi/spring2004/I063