FI:IB108 Algorithm Design II - Course Information
IB108 Algorithm Design II
Faculty of InformaticsSpring 2008
- 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. Petra Budíková, Ph.D. (assistant)
doc. Ing. RNDr. Barbora Bühnová, Ph.D. (assistant)
doc. RNDr. Milan Češka, 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)
RNDr. Jana Tůmová, Ph.D. (assistant) - Guaranteed by
- prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics - Timetable
- Mon 14:00–15:50 D2
- Timetable of Seminar Groups:
IB108/02: each odd Wednesday 16:00–17:50 B011, N. Beneš, I. Černá
IB108/03: each even Wednesday 18:00–19:50 B011, N. Beneš, I. Černá
IB108/04: each odd Wednesday 18:00–19:50 B011, N. Beneš, I. Černá - 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
- Applied Informatics (programme FI, B-AP)
- Bioinformatics (programme FI, B-AP)
- Informatics with another discipline (programme FI, B-BI)
- Informatics with another discipline (programme FI, B-FY)
- Informatics with another discipline (programme FI, B-GE)
- Informatics with another discipline (programme FI, B-GK)
- Informatics with another discipline (programme FI, B-CH)
- Informatics with another discipline (programme FI, B-IO)
- Informatics with another discipline (programme FI, B-MA)
- Informatics with another discipline (programme FI, B-SO)
- Informatics with another discipline (programme FI, B-TV)
- Informatics (programme FI, B-IN)
- Mathematical Informatics (programme FI, B-IN)
- Parallel and Distributed Systems (programme FI, B-IN)
- Computer Graphics and Image Processing (programme FI, B-IN)
- Computer Networks and Communication (programme FI, B-IN)
- Computer Systems and Data Processing (programme FI, B-IN)
- Programmable Technical Structures (programme FI, B-IN)
- Artificial Intelligence and Natural Language Processing (programme FI, B-IN)
- 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
- 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/
- Enrolment Statistics (Spring 2008, recent)
- Permalink: https://is.muni.cz/course/fi/spring2008/IB108