FI:IB002 Algorithms I - Course Information

IB002 Algorithms and data structures I

Extent and Intensity

2/2. 4 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).

Teacher(s)

Ing. Mgr. et Mgr. Zdeněk Říha, Ph.D. (lecturer)
RNDr. Libor Škarvada (lecturer)
Mgr. Miroslav Buda (seminar tutor)
Mgr. et Mgr. Martin Derka, M.Sc. (seminar tutor)
RNDr. Pavel Karas, Ph.D. (seminar tutor)
Mgr. Marek Klučár (seminar tutor)
Mgr. Matúš Madzin (seminar tutor)
doc. RNDr. David Svoboda, Ph.D. (seminar tutor)
RNDr. Martin Ukrop, Ph.D. (seminar tutor)
RNDr. Vladimír Ulman, Ph.D. (seminar tutor)
Mgr. Matej Kollár (assistant)
Mgr. Eva Mráková, Ph.D. (assistant)
doc. RNDr. Vojtěch Řehák, Ph.D. (assistant)
Mgr. et Mgr. Tomáš Sklenák (assistant)

Guaranteed by

prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: RNDr. Libor Škarvada
Supplier department: Department of Computer Science – Faculty of Informatics

Timetable

Mon 16:00–17:50 D2, Mon 16:00–17:50 D1, Mon 16:00–17:50 D3

• Timetable of Seminar Groups:

IB002/T01: Mon 10:00–12:00 Učebna S6 (20), Thu 10:00–11:55 Učebna S11 (58), M. Derka, Nepřihlašuje se. Určeno pro studenty se zdravotním postižením.
IB002/T02: Wed 16:00–17:55 Učebna S11 (58), M. Klučár, Nepřihlašuje se. Určeno pro studenty se zdravotním postižením.
IB002/T03: Thu 16:00–17:55 Učebna S4 (35a), L. Škarvada, Nepřihlašuje se. Určeno pro studenty se zdravotním postižením.
IB002/T04: Mon 18. 2. to Sun 19. 5. Thu 13:00–14:40 Učebna S8 (17), D. Svoboda
IB002/01: Thu 8:00–9:50 B311, D. Svoboda
IB002/02: Mon 14:00–15:50 B130, M. Ukrop
IB002/03: Thu 18:00–19:50 B204, M. Ukrop
IB002/04: Thu 16:00–17:50 B130, M. Ukrop
IB002/05: Wed 8:00–9:50 B130, M. Klučár
IB002/06: Wed 10:00–11:50 B130, M. Klučár
IB002/07: Wed 14:00–15:50 B130, M. Klučár
IB002/08: Wed 10:00–11:50 G126, M. Derka
IB002/09: Wed 12:00–13:50 G126, M. Derka
IB002/10: Thu 10:00–11:50 G126, M. Madzin
IB002/11: Tue 8:00–9:50 G101, V. Ulman
IB002/12: Tue 10:00–11:50 G101, V. Ulman
IB002/13: Thu 8:00–9:50 G101, M. Madzin
IB002/14: Tue 16:00–17:50 B204, M. Buda
IB002/15: Tue 14:00–15:50 B130, M. Buda
IB002/16: Thu 14:00–15:50 B204, M. Buda
IB002/17: Thu 16:00–17:50 B204, P. Karas
IB002/18: Thu 14:00–15:50 B130, P. Karas
IB002/19: Tue 18:00–19:50 B204

Prerequisites

The students should comprehend the basic notions (algorithm, computation, data structure) on elementary level.

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

• Applied Informatics (programme FI, B-AP)
• Bioinformatics (programme FI, B-AP)
• Economic Information Systems (programme ESF, B-SI)
• Informatics with another discipline (programme FI, B-EB)
• Informatics with another discipline (programme FI, B-FY)
• Informatics with another discipline (programme FI, B-IO)
• Informatics with another discipline (programme FI, B-MA)
• Informatics with another discipline (programme FI, B-TV)
• Public Administration Informatics (programme FI, B-AP)
• Mathematical Informatics (programme FI, B-IN)
• Mathematics (programme PřF, B-MA)
• Parallel and Distributed Systems (programme FI, B-IN)
• Computer Graphics and Image Processing (programme FI, B-IN)
• Computer Networks and Communication (programme FI, B-IN)
• Computer Systems and Data Processing (programme FI, B-IN)
• Programmable Technical Structures (programme FI, B-IN)
• Embedded Systems (programme FI, N-IN)
• Service Science, Management and Engineering (programme FI, N-AP)
• Social Informatics (programme FI, B-AP)
• Artificial Intelligence and Natural Language Processing (programme FI, B-IN)

Course objectives

The course presents basic techniques of the analysis of algorithms, data structures, and operations.

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, queues. Binary heaps, representation of sets. Binary search trees, balanced trees.
• 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

• SKIENA, Steven S. The algorithm design manual. New York: Springer, 1998, xvi, 486. ISBN 0387948600. info
• CORMEN, Thomas H., Charles Eric LEISERSON and Ronald L. RIVEST. Introduction to algorithms. Cambridge: MIT Press, 1989, xvii, 1028. ISBN 0070131430. info

Teaching methods

The course is organized as a series of lectures accompanied with exercises.

Assessment methods

The evaluation consists of three tests -- midterm test, end-term test, and written final exam.

Language of instruction

Czech

Follow-Up Courses

• I063 Algorithm Design II

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))  

Teacher's information

http://www.fi.muni.cz/~libor/vyuka/IB002/

• Enrolment Statistics (Spring 2013, recent)
  
• Permalink: https://is.muni.cz/course/fi/spring2013/IB002