I065 Seminar on Design of Algorithms I

Faculty of Informatics
Spring 2002
Extent and Intensity
1/1. 2 credit(s) (plus extra credits for completion). Type of Completion: z (credit).
Teacher(s)
doc. RNDr. Renata Ochranová, CSc. (lecturer)
RNDr. Jaroslav Pelikán, Ph.D. (lecturer)
prof. RNDr. Tomáš Pitner, Ph.D. (lecturer)
Mgr. Luděk Bártek, Ph.D. (seminar tutor)
Mgr. Jan Holeček (seminar tutor)
Mgr. Lubomír Krejčí (seminar tutor)
RNDr. Miroslav Kubásek, Ph.D. (seminar tutor)
Mgr. Pavel Moravec (seminar tutor)
doc. RNDr. David Svoboda, Ph.D. (seminar tutor)
RNDr. Aleš Zlámal (seminar tutor)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Tomáš Pitner, Ph.D.
Timetable of Seminar Groups
I065/01: Tue 16:00–16:50 B116, L. Bártek
I065/02: Mon 18:00–18:50 B116, A. Zlámal
I065/03: Mon 19:00–19:50 B116, A. Zlámal
I065/04: Mon 12:00–12:50 B311, L. Krejčí
I065/05: Mon 13:00–13:50 B311, L. Krejčí
I065/06: Mon 14:00–14:50 B311, L. Krejčí
I065/07: Thu 11:00–11:50 B117, L. Krejčí
I065/08: Thu 12:00–12:50 B117, L. Krejčí
I065/09: Tue 9:00–9:50 B311, D. Svoboda
I065/10: Tue 10:00–10:50 B311, D. Svoboda
I065/11: Tue 9:00–9:50 B116, P. Moravec
I065/12: Tue 10:00–10:50 B116, P. Moravec
I065/13: Thu 9:00–9:50 B117, P. Moravec
I065/14: Thu 10:00–10:50 B117, P. Moravec
I065/15: Tue 11:00–11:50 B116, M. Kubásek
I065/16: Tue 12:00–12:50 B116, M. Kubásek
I065/17: Tue 10:00–10:50 B117, A. Zlámal
I065/18: Tue 11:00–11:50 B117, A. Zlámal
I065/19: Thu 17:00–17:50 B116, J. Holeček
I065/20: Thu 18:00–18:50 B116, J. Holeček
I065/21: Thu 19:00–19:50 B116, A. Zlámal
I065/I: Mon 10:00–10:50 D1, T. Pitner
I065/II: Mon 11:00–11:50 D1, T. Pitner
I065/Me: Thu 13:00–13:50 A104, L. Krejčí, urceno pro studenty odb. magisterskeho studia matematika - ekonomie
I065/Mm: Thu 14:00–14:50 A104, A. Zlámal, urceno pro studenty odborne matematiky magisterske a bakalarske
I065/Mn: Thu 15:00–15:50 A104, A. Zlámal, urceno pro studenty odborne matematiky magisterske
Prerequisites (in Czech)
! U212 Design of Algorithms for CS IV
Doporučuje se zapsat společně s I002 Design of 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
Syllabus
  • Pointer, dynamic variable. Dynamic data structures (stack, queue, list), their implementation and application. Graphs and their representation. Implementation of graph algorithms (path search, depth-first and breadth-first search, minimal spanning tree). Heuristic algorithms. Implementation of sorting algorithms. Recursion and backtracking, their application. Searching trees.
Literature
  • CORMEN, Thomas H., Charles Eric LEISERSON and Ronald L. RIVEST. Introduction to algorithms. Cambridge: MIT Press, 1990, xi, 1028. ISBN 0262031418. info
  • PARSONS, Thomas W. Introduction to algorithms in Pascal. New York: John Wiley & Sons, 1995, xiv, 447. ISBN 0471305944. info
Language of instruction
Czech
Further Comments
The course is taught annually.
Teacher's information
http://www.fi.muni.cz/~tomp/i065/
The course is also listed under the following terms Spring 1999, Spring 2000, Spring 2001.
  • Enrolment Statistics (recent)
  • Permalink: https://is.muni.cz/course/fi/spring2002/I065