I065 Seminar on Design of Algorithms I

Faculty of Informatics
Spring 2000
Extent and Intensity
0/2. 2 credit(s) (plus extra credits for completion). Type of Completion: z (credit).
Teacher(s)
doc. RNDr. Renata Ochranová, CSc. (lecturer), prof. RNDr. Tomáš Pitner, Ph.D. (deputy)
Mgr. Tomáš Hanžl (seminar tutor)
Jaroslav Jedlička (seminar tutor)
Mgr. Zdeněk Kaminski (seminar tutor)
Mgr. Jiří Kloc (seminar tutor)
Mgr. Lubomír Krejčí (seminar tutor)
Petr Lautrbach (seminar tutor)
Roman Rožník (seminar tutor)
Mgr. Jaromír Skřivan (seminar tutor)
Mgr. Jitka Žídková (seminar tutor)
RNDr. Michal Batko, Ph.D.
doc. RNDr. Jan Bouda, Ph.D.
RNDr. Aleš Zlámal
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: doc. RNDr. Renata Ochranová, CSc.
Prerequisites (in Czech)
! U212 Design of Algorithms for CS IV &&! I002 Algorithms I
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
  • The purpose of this seminar is to extend and elaborate the subject area presented in I002 Design of Algorithms I. Presented algorithms are expected to be implemented in some standard programming language.
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.
The course is taught every week.
The course is also listed under the following terms Spring 1999, Spring 2001, Spring 2002.
  • Enrolment Statistics (Spring 2000, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2000/I065