IB108 Algorithm Design II

Faculty of Informatics
Spring 2004
Extent and Intensity
2/0. 2 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
Teacher(s)
prof. RNDr. Ivana Černá, CSc. (lecturer)
Mgr. Tomáš Hanžl (assistant)
RNDr. Lukáš Hejtmánek, Ph.D. (assistant)
RNDr. Jakub Chaloupka, Ph.D. (assistant)
Mgr. Luboš Kresta (assistant)
Mgr. Jiří Šimša (assistant)
Mgr. Jitka Žídková (assistant)
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)
( I002 Algorithms I || IB002 Algorithms I )&&! I063 Algorithm Design II &&(!NOW( I063 Algorithm Design II ))
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
Course objectives
The course expands on the introductory course Algortihm Design I. It presents algorithmic concepts without their direct connection to any particular programming language. The aim is to introduce students into design and analysis of advanced algorithms. The course presents advanced techniques of algorithm analysis and a wide spectrum of strategies together with algorithms built up on these strategies. New data structures are displayed in a row algorithms based on them.
Syllabus
  • Advanced design and analysis techniques: dynamic programming, greedy strategies, backtracking, local search. Amortized analysis.
  • Advanced data structures: binomial and Fibonacci heaps, data structures for disjoint sets.
  • Graph algorithms: spanning trees, shortest paths, flows, matching.
  • String matching: the naive string-matching algorithm, Karp-Rabin algorithm, string matching with finite automata.
  • Algorithms for NP-hard problems: aproximative algorithms. Set-covering problem, traveling-salesman problem.
  • Randomized algorithms: randomized sorting, maximal independent-set problem. Randomness in data structures.
Literature
  • KOZEN, Dexter C. The Design and Analysis of Algorithms. New York: Springer-Verlag, 1992, 320 s. ISBN 0387976876. info
  • CORMEN, Thomas H., Charles Eric LEISERSON and Ronald L. RIVEST. Introduction to algorithms. Cambridge: MIT Press, 1989, xvii, 1028. ISBN 0070131430. info
Bookmarks
https://is.muni.cz/ln/tag/FI:IB108!
Assessment methods (in Czech)
Informace na webové stránce předmětu http://www.fi.muni.cz/usr/cerna/NAII/i063.html
Language of instruction
Czech
Further comments (probably available only in Czech)
The course is taught annually.
Teacher's information
http://www.fi.muni.cz/usr/cerna/NAII/ib108.html
The course is also listed under the following terms Spring 2003, Spring 2005, Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2012, Spring 2013.
  • Enrolment Statistics (Spring 2004, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2004/IB108