IB002 Design of Algorithms I

Faculty of Informatics
Spring 2012
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. Bc. Matúš Goljer (seminar tutor)
Mgr. Marek Klučá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)
RNDr. Tomáš Raček, Ph.D. (seminar tutor)
doc. RNDr. David Svoboda, Ph.D. (seminar tutor)
Mgr. Filip Štefaňák (seminar tutor)
Mgr. Jiří Uhlíř (seminar tutor)
Mgr. Matej Kollár (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 D3, Mon 16:00–17:50 D1
  • Timetable of Seminar Groups:
IB002/01: each even Wednesday 10:00–11:50 G101, M. Klučár
IB002/02: each odd Wednesday 10:00–11:50 G101, M. Klučár
IB002/03: each even Tuesday 18:00–19:50 G123, M. Klučár
IB002/04: each odd Tuesday 18:00–19:50 G123, M. Klučár
IB002/05: each even Wednesday 8:00–9:50 G101, J. Pacula
IB002/06: each odd Wednesday 8:00–9:50 G101, J. Pacula
IB002/07: each even Wednesday 16:00–17:50 B204, M. Madzin
IB002/08: each odd Wednesday 16:00–17:50 B204, M. Madzin
IB002/09: each even Wednesday 18:00–19:50 B204, Š. Kozák
IB002/10: each odd Wednesday 18:00–19:50 B204, Š. Kozák
IB002/11: each even Thursday 12:00–13:50 C525, D. Svoboda
IB002/12: each odd Thursday 12:00–13:50 C525, D. Svoboda
IB002/13: each even Thursday 14:00–15:50 C525, F. Štefaňák
IB002/14: each odd Thursday 14:00–15:50 C525, F. Štefaňák
IB002/15: each even Friday 8:00–9:50 C525, J. Uhlíř
IB002/16: each odd Friday 8:00–9:50 C525, T. Raček
IB002/17: each even Friday 10:00–11:50 C525, J. Uhlíř
IB002/18: each odd Friday 10:00–11:50 C525, T. Raček
IB002/19: each even Tuesday 16:00–17:50 G123, M. Goljer
IB002/20: each odd Tuesday 16:00–17:50 G123, M. Goljer
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 29 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
  • 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 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
Teacher's information
http://www.fi.muni.cz/~libor/vyuka/IB002/
The course is also listed under the following terms Spring 2003, Spring 2004, Spring 2005, Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2013, Spring 2014, Spring 2015, Spring 2016, Spring 2017, Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2024, Spring 2025.
  • Enrolment Statistics (Spring 2012, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2012/IB002