IB108 Algorithm Design II

Faculty of Informatics
Spring 2007
Extent and Intensity
2/1. 3 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
Teacher(s)
prof. RNDr. Ivana Černá, CSc. (lecturer)
RNDr. Nikola Beneš, Ph.D. (seminar tutor)
Mgr. Jiří Šimša (seminar tutor)
RNDr. Petra Budíková, Ph.D. (assistant)
Mgr. Sven Dražan (assistant)
RNDr. Jakub Chaloupka, Ph.D. (assistant)
prof. Dr. rer. nat. RNDr. Mgr. Bc. Jan Křetínský, Ph.D. (assistant)
Mgr. Jitka Kudrnáčová (assistant)
Mgr. et Mgr. Pavlína Moravcová Vařeková (assistant)
Bc. Tomáš Richter (assistant)
RNDr. Petr Ročkai, Ph.D. (assistant)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Timetable
Mon 12:00–13:50 D2
  • Timetable of Seminar Groups:
IB108/01: each even Tuesday 10:00–11:50 B410, J. Šimša
IB108/02: each odd Tuesday 10:00–11:50 B410, J. Šimša
IB108/03: each even Wednesday 10:00–11:50 C511, N. Beneš
IB108/04: each odd Wednesday 10:00–11:50 C511, N. Beneš
Prerequisites (in Czech)
IB002 Algorithms I
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
there are 11 fields of study the course is directly associated with, display
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.
Literature
  • DEMEL, Jiří. Grafy a jejich aplikace. Vyd. 1. Praha: Academia, 2002, 257 s. ISBN 8020009906. 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
Language of instruction
Czech
Follow-Up Courses
Further comments (probably available only in Czech)
The course is taught annually.
Teacher's information
http://www.fi.muni.cz/usr/cerna/NAII/
The course is also listed under the following terms Spring 2003, Spring 2004, Spring 2005, Spring 2006, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2012, Spring 2013.
  • Enrolment Statistics (Spring 2007, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2007/IB108