FI:I065 Algorithms I - seminar - Course Information

I065 Seminar on Design of Algorithms I

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. Pavel Filipenský (seminar tutor)
Mgr. Tomáš Hanžl (seminar tutor)
Jaroslav Jedlička (seminar tutor)
Mgr. Zdeněk Kaminski (seminar tutor)
Mgr. Lubomír Krejčí (seminar tutor)
Petr Lautrbach (seminar tutor)
RNDr. Aleš Zlámal (seminar tutor)
Mgr. Jitka Žídková (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/Cv1: Mon 10:00–10:50 B117, Mon 15:00–15:50 D1, L. Krejčí
I065/Cv10: Mon 19:00–19:50 B117, Z. Kaminski
I065/Cv11: Tue 12:00–12:50 B116
I065/Cv12: Tue 13:00–13:50 B116, P. Filipenský
I065/Cv13: Thu 17:00–17:50 B116, J. Žídková
I065/Cv14: Thu 18:00–18:50 B116, J. Žídková
I065/Cv15: Thu 19:00–19:50 B116, J. Žídková
I065/Cv16: Mon 16:00–16:50 B117, Z. Kaminski
I065/Cv17: Mon 17:00–17:50 B117, P. Lautrbach
I065/Cv18: Thu 7:00–7:50 B116, P. Lautrbach
I065/Cv19: Thu 8:00–8:50 B116, P. Lautrbach
I065/Cv2: Mon 11:00–11:50 B117, Mon 16:00–16:50 D1, L. Krejčí
I065/Cv20: Mon 18:00–18:50 B116, T. Hanžl
I065/Cv21: Mon 19:00–19:50 B116, T. Hanžl
I065/Cv22: Mon 10:00–10:50 B116, T. Pitner
I065/Cv23: Mon 11:00–11:50 B116, T. Pitner
I065/Cv24: Tue 16:00–16:50 B117, A. Zlámal
I065/Cv25: Tue 17:00–17:50 B117, A. Zlámal
I065/Cv26: Tue 18:00–18:50 B117, A. Zlámal
I065/Cv3: Tue 10:00–10:50 B117, L. Krejčí
I065/Cv4: Tue 11:00–11:50 B117, L. Krejčí
I065/Cv5: Thu 10:00–10:50 B117, L. Krejčí
I065/Cv6: Thu 11:00–11:50 B117, L. Krejčí
I065/Cv7: Thu 12:00–12:50 B117, L. Krejčí
I065/Cv8: Tue 19:00–19:50 B117, P. Filipenský
I065/Cv9: Mon 18:00–18:50 B117, P. Lautrbach
I065/P1: No timetable has been entered into IS. T. Pitner
I065/P2: No timetable has been entered into IS. R. Ochranová

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

• Informatics (programme FI, B-IN)
• Informatics (programme FI, M-IN)
• Upper Secondary School Teacher Training in Informatics (programme FI, M-IN)
• Upper Secondary School Teacher Training in Informatics (programme FI, M-SS)
• Information Technology (programme FI, B-IN)

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.

• Enrolment Statistics (Spring 2001, recent)
  
• Permalink: https://is.muni.cz/course/fi/spring2001/I065