I063 Design of Algorithms II

Faculty of Informatics
Spring 2002
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), z (credit).
Teacher(s)
prof. RNDr. Ivana Černá, CSc. (lecturer)
Mgr. Pavel Krčál (assistant)
doc. Mgr. Radek Pelánek, Ph.D. (assistant)
doc. Mgr. Adam Rogalewicz, Ph.D. (assistant)
Mgr. Jitka Žídková (assistant)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Ivana Černá, CSc.
Timetable
Wed 10:00–11:50 D2
Prerequisites
I002 Algorithms I && M010 Combinatorics and Graph Theory
Before enrolling this course the students should go through I002 Design of Algorithms I and M010 Combinatorics and Graph Theory.
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
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
Language of instruction
Czech
Further Comments
The course is taught annually.
Teacher's information
http://www.fi.muni.cz/usr/cerna/i063.html
The course is also listed under the following terms Spring 1998, Spring 1999, Spring 2000, Spring 2001, Spring 2003, Spring 2004.
  • Enrolment Statistics (Spring 2002, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2002/I063