FI:IB002 Algorithms I - Course Information
IB002 Design of Algorithms I
Faculty of InformaticsSpring 2011
- 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).
- Teacher(s)
- RNDr. Libor Škarvada (lecturer)
Mgr. Miroslav Buda (seminar tutor)
Mgr. Bc. Matúš Goljer (seminar tutor)
Mgr. Matej Kollár (seminar tutor)
RNDr. Štěpán Kozák (seminar tutor)
Mgr. Matúš Madzin (seminar tutor)
Mgr. Josef Pacula (seminar tutor)
Oldřich Petr (seminar tutor)
doc. RNDr. David Svoboda, Ph.D. (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 - Timetable
- Mon 16:00–17:50 D1, Mon 16:00–17:50 D3, Mon 16:00–17:50 D2
- Timetable of Seminar Groups:
IB002/02: each odd Friday 8:00–9:50 C525, D. Svoboda
IB002/03: each even Wednesday 14:00–15:50 G123, M. Trtík
IB002/04: each odd Wednesday 14:00–15:50 G123, M. Trtík
IB002/05: each even Tuesday 18:00–19:50 G123, Š. Kozák
IB002/06: each odd Tuesday 18:00–19:50 G123, Š. Kozák
IB002/07: each even Wednesday 16:00–17:50 G123, J. Pacula
IB002/08: each odd Wednesday 16:00–17:50 G123, J. Pacula
IB002/09: each even Tuesday 16:00–17:50 G123, M. Kollár
IB002/10: each odd Tuesday 16:00–17:50 G123, M. Kollár
IB002/11: each even Tuesday 8:00–9:50 G123, M. Goljer
IB002/12: each odd Tuesday 8:00–9:50 G123, M. Goljer
IB002/13: each even Thursday 10:00–11:50 G123, M. Buda
IB002/14: each odd Thursday 10:00–11:50 G123, M. Buda
IB002/15: each even Thursday 12:00–13:50 G123, M. Madzin
IB002/16: each odd Thursday 12:00–13:50 G123, M. Madzin
IB002/17: each even Tuesday 16:00–17:50 G101, Š. Kozák
IB002/18: each odd Tuesday 16:00–17:50 G101, Š. Kozák
IB002/19: each even Wednesday 12:00–13:50 G123, M. Trtík
IB002/20: each odd Wednesday 12:00–13:50 G123, M. Trtík
IB002/21: each even Wednesday 18:00–19:50 G123, J. Pacula
IB002/22: each odd Wednesday 18:00–19:50 G123, J. Pacula - Prerequisites
- The students should comprehend the basic notions (algorithm, computation, data structure) on elementary level. Ability to read simple algorithms written in functional and imperative style is beneficial.
- 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
- there are 28 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 a broad scope of techniques used in functional, imperative or object-oriented languages.
- Syllabus
- 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 traversal, topological sort, strongly connected components. Breath-first traversal, Dijkstra's algorithm. Minimum Spanning Trees.
- Literature
- Teaching methods
- The course is organized as a series of lectures accompanied with exercises.
- Assessment methods
- The evaluation consists of two written tests -- midterm and final.
- Language of instruction
- Czech
- Follow-Up Courses
- Further Comments
- Study Materials
The course is taught annually. - Listed among pre-requisites of other courses
- IB114 Introduction to Programming and Algorithms II
(IB111 || IB113) && !IB002 && !NOW(IB002) - IV003 Algorithms and Data Structures II
IB002 || program(PřF:N-MA) - IV100 Parallel and distributed computations
IB002 - MA015 Graph Algorithms
fi/IB002">IB002||(typ_studia(N)&&fakulta(fi))
- IB114 Introduction to Programming and Algorithms II
- Teacher's information
- http://www.fi.muni.cz/~libor/vyuka/IB002/
- Enrolment Statistics (Spring 2011, recent)
- Permalink: https://is.muni.cz/course/fi/spring2011/IB002