česky | **in English**

Spring 2018

**Extent and Intensity**- 2/2. 4 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
**Teacher(s)**- prof. RNDr. Ivana Černá, CSc. (lecturer)

Mgr. Jaroslav Bendík (seminar tutor)

RNDr. Nikola Beneš, Ph.D. (seminar tutor)

Mgr. Samuel Pastva (seminar tutor)

RNDr. František Blahoudek (assistant)

RNDr. Martin Jonáš (assistant)

Mgr. David Klaška (assistant)

Bc. Tomáš Lamser (assistant) **Supervisor**- prof. RNDr. Mojmír Křetínský, CSc.

Department of Computer Science - Faculty of Informatics

Supplier department: Department of Computer Science - Faculty of Informatics **Prerequisites**(in Czech)- (
**IB002**Algorithms I || PROGRAM ( 1431:N - MA )) && !**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.
**Fields of study 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. info - CORMEN, Thomas H., Charles E. LEISERSON and Ronald L. RIVEST.
*Introduction to algorithms*. Cambridge: MIT Press, 1989. xvii, 1028. ISBN 0070131430. info

- DASGUPTA, Sanjoy, Christos Ch. PAPADIMITRIOU and Umesh Virkumar VAZIRANI.
**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)**- The course is taught annually.

The course is taught: every week.

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

- Enrolment Statistics (Spring 2018, recent)
- Permalink: https://is.muni.cz/course/fi/spring2018/IV003

Go to top | Current date and time: 19. 8. 2017 09:28, Week 33 (odd)

Contact: