FI:IB002 Algorithms I - Course Information
IB002 Design of Algorithms IFaculty of Informatics
- Extent and Intensity
- 2/1. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
- RNDr. Libor Škarvada (lecturer)
Mgr. et Mgr. Martin Derka, M.Sc. (seminar tutor)
RNDr. Jiří Filipovič, Ph.D. (seminar tutor)
RNDr. Štěpán Kozák (seminar tutor)
doc. RNDr. Barbora Kozlíková, Ph.D. (seminar tutor)
RNDr. Václav Lorenc (seminar tutor)
Mgr. Matúš Madzin (seminar tutor)
doc. RNDr. David Svoboda, Ph.D. (seminar tutor)
Mgr. Filip Štefaňák (seminar tutor)
Mgr. Marek Trtík, Ph.D. (seminar tutor)
Mgr. Radek Holčák (assistant)
- Guaranteed by
- prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science - Faculty of Informatics
Contact Person: RNDr. Libor Škarvada
- Mon 18:00–19:50 D1, Mon 18:00–19:50 D2, Mon 18:00–19:50 D3
- Timetable of Seminar Groups:
IB002/02: each odd Tuesday 16:00–17:50 B011, V. Lorenc
IB002/03: each even Thursday 12:00–13:50 B011, M. Derka
IB002/04: each odd Thursday 12:00–13:50 B011, M. Derka
IB002/05: each even Wednesday 8:00–9:50 B011, D. Svoboda
IB002/06: each odd Wednesday 8:00–9:50 B011, D. Svoboda
IB002/07: each even Friday 13:00–14:50 B410, M. Trtík
IB002/08: each odd Friday 13:00–14:50 B410, M. Trtík
IB002/09: each even Wednesday 12:00–13:50 B011, B. Kozlíková
IB002/10: each odd Wednesday 12:00–13:50 B011, M. Madzin
IB002/11: each even Thursday 16:00–17:50 B410, B. Kozlíková
IB002/12: each odd Thursday 16:00–17:50 B410, F. Štefaňák
IB002/13: each even Wednesday 16:00–17:50 B204, J. Filipovič
IB002/14: each odd Wednesday 16:00–17:50 B204, J. Filipovič
IB002/15: each even Wednesday 18:00–19:50 B204, Š. Kozák
IB002/16: each odd Wednesday 18:00–19:50 B204, Š. Kozák
IB002/17: each even Thursday 18:00–19:50 B410, M. Madzin
IB002/18: each odd Thursday 18:00–19:50 B410, F. Štefaňák
- Ability to read and write simple programs in at least one functional and one imperative programming language is required.
- 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 24 fields of study the course is directly associated with, display
- Course objectives
- The course presents basic techniques of the analysis of algorithms, data structures, and operations. It is aimed at proving the correctness of algorithms and their efficiency. Basic algorithmic concepts and constructs are presented without any direct binding to a concrete programming language and without requirements of an immediate program implementation. The goal is to make the students know how to work with the algorithms themselves without any implementation details. It enables to present rather broad scope of techniques used in functional, imperative as well as object-oriented languages.
- Basic analysis of algorithms: Correctness of algorithms, input and output conditions, partial correctness, convergence, verification.
- Length of computation, algorithm complexity, problem complexity. Asymptotical analysis of time and space complexity, growth of functions, application of recursive relations in algorithm analysis.
- Fundamental data structures: Lists, pushdown stacks, queues. Binary search trees, balanced trees, representation of sets.
- Sorting algorithms: quicksort, mergesort, heapsort, lower bound for time complexity of sorting.
- Basic graph structures: Representation of graphs. Depth-first and breath-first traversal.
- Assessment methods
- The course is organized as a series of lectures accompanied with exercises. The evaluation consists of three written tests -- two midterm and one final.
- Language of instruction
- Follow-Up Courses
- Further Comments
- Study Materials
The course is taught annually.
- Listed among pre-requisites of other courses
- Teacher's information