IV003 Algorithms and data structures II

Faculty of Informatics
Spring 2015
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)
RNDr. Mária Svoreňová, Ph.D. (seminar tutor)
Mgr. Filip Štefaňák (seminar tutor)
Mgr. Petr Bauch, Ph.D. (assistant)
RNDr. Peter Bezděk, Ph.D. (assistant)
doc. RNDr. Jan Bouda, Ph.D. (assistant)
RNDr. Petra Budíková, Ph.D. (assistant)
Mgr. Jan Fikejs (assistant)
Mgr. Bc. Tomáš Janík (assistant)
RNDr. Martin Jonáš, Ph.D. (assistant)
RNDr. David Klaška (assistant)
Mgr. Karel Kubíček (assistant)
RNDr. Henrich Lauko, Ph.D. (assistant)
doc. Mgr. Jan Obdržálek, PhD. (assistant)
RNDr. Samuel Pastva, Ph.D. (assistant)
RNDr. Vladimír Štill, Ph.D. (assistant)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Timetable
Wed 14:00–15:50 D2
  • Timetable of Seminar Groups:
IV003/T01: Mon 16. 2. to Fri 15. 5. Mon 9:40–11:15 117, T. Janík, Nepřihlašuje se. Určeno pro studenty se zdravotním postižením.
IV003/T02: Wed 18. 2. to Fri 15. 5. Wed 14:00–15:35 105 and Tue 24. 2. to Fri 15. 5. each odd Tuesday 8:00–12:55 106, T. Janík, Nepřihlašuje se. Určeno pro studenty se zdravotním postižením.
IV003/01: each even Thursday 16:00–17:50 A318, N. Beneš
IV003/02: each odd Thursday 16:00–17:50 A318, N. Beneš
IV003/03: each even Thursday 12:00–13:50 A319, N. Beneš
IV003/04: each odd Thursday 12:00–13:50 A319, N. Beneš
IV003/05: each even Wednesday 18:00–19:50 C525, M. Svoreňová
IV003/06: each odd Wednesday 18:00–19:50 C525, M. Svoreňová
IV003/07: each even Thursday 10:00–11:50 C511, F. Štefaňák
IV003/08: each odd Thursday 10:00–11:50 C511, F. Štefaňák
Prerequisites (in Czech)
IB002 Algorithms I && ! IB108 Algorithms II
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
The capacity limit for the course is 200 student(s).
Current registration and enrolment status: enrolled: 0/200, only registered: 0/200, only registered with preference (fields directly associated with the programme): 0/200
fields of study / plans the course is directly associated with
there are 18 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. Students are introduced into new data structures which are displayed in a row with algorithms based on them.
Syllabus
  • Advanced design and analysis techniques: dynamic programming, greedy strategies,backtracking. Amortized analysis.
  • Advanced data structures: binomial and Fibonacci heaps, data structures for disjoint sets.
  • Graph algorithms: Single-Source Shortest Paths (The Bellman-Ford algorithm). All-Pairs Shortest Paths (Shortest paths and matrix multiplication, The Floyd-Warshall algorithm, Johnson's algorithm for sparse graphs). Maximum Flow (The Ford-Fulkerson method, The Push-Relabel method). Maximum bipartite matching.
  • String matching: the naive string-matching algorithm, Karp-Rabin algorithm, string matching with finite automata. The Knuth-Morris-Pratt algorithm.
Literature
  • DASGUPTA, Sanjoy, Christos Ch. PAPADIMITRIOU and Umesh Virkumar VAZIRANI. Algorithms. 1st ed. Boston: McGraw-Hill Companies, 2008, x, 320. ISBN 9780073523408. info
  • KLEINBERG, Jon and Éva TARDOS. Algorithm design. Boston: Pearson/Addison-Wesley, 2006, xxiii, 838. ISBN 0321372913. URL info
  • CORMEN, Thomas H., Charles Eric LEISERSON and Ronald L. RIVEST. Introduction to algorithms. Cambridge: MIT Press, 1989, xvii, 1028. ISBN 0070131430. info
Teaching methods
Lectures and seminars. Students are required to solve given algorithmical problems.
Assessment methods
The course has a form of a lecture with a seminar. During the term students separately solve sets of algorithmic problems. The course is concluded by the written exam. Student can attend the final exam providing she/he has acquired given number of points from problem sets.
Language of instruction
Czech
Follow-Up Courses
Further comments (probably available only in Czech)
Study Materials
The course is taught annually.
General note: Předmět byl dříve vypisován pod kódem IB108.
Teacher's information
https://is.muni.cz/auth/el/1433/jaro2012/IB108/index.qwarp
The course is also listed under the following terms Spring 2014, Spring 2016, Spring 2017, Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2024, Spring 2025.
  • Enrolment Statistics (Spring 2015, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2015/IV003