IB002 Design of Algorithms I

Faculty of Informatics
Spring 2007
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)
doc. RNDr. Tomáš Pitner, Ph.D. (lecturer)
RNDr. Libor Škarvada (lecturer)
RNDr. Jiří Filipovič, Ph.D. (seminar tutor)
RNDr. Marek Kašík (seminar tutor)
doc. RNDr. Barbora Kozlíková, Ph.D. (seminar tutor)
RNDr. Václav Lorenc (seminar tutor)
RNDr. Martin Maška, Ph.D. (seminar tutor)
doc. RNDr. Pavel Matula, Ph.D. (seminar tutor)
doc. Mgr. Hana Rudová, Ph.D. (seminar tutor)
Mgr. Adriana Strejčková (seminar tutor)
doc. RNDr. David Svoboda, Ph.D. (seminar tutor)
RNDr. Aleš Zlámal (seminar tutor)
Mgr. Radek Holčák (assistant)
RNDr. Filip Andres (alternate examiner)
RNDr. Lukáš Boháč (alternate examiner)
RNDr. Josef Šprojcar, Ph.D. (alternate examiner)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science - Faculty of Informatics
Contact Person: RNDr. Libor Škarvada
Timetable
Mon 18:00–19:50 D3, Mon 18:00–19:50 D1
  • Timetable of Seminar Groups:
IB002/01: each even Tuesday 10:00–11:50 B011, H. Rudová
IB002/02: each odd Tuesday 10:00–11:50 B011, H. Rudová
IB002/03: each even Tuesday 18:00–19:50 B011, L. Škarvada
IB002/04: each odd Tuesday 18:00–19:50 B011, L. Škarvada
IB002/05: each even Wednesday 12:00–13:50 B011, P. Matula
IB002/06: each odd Wednesday 12:00–13:50 B011, P. Matula
IB002/07: each even Friday 10:00–11:50 C511, D. Svoboda
IB002/08: each odd Friday 10:00–11:50 C511, D. Svoboda
IB002/09: each even Tuesday 16:00–17:50 B007, M. Kašík
IB002/10: each odd Tuesday 16:00–17:50 B007, M. Kašík
IB002/11: each even Wednesday 8:00–9:50 C511, M. Maška
IB002/12: each odd Wednesday 8:00–9:50 C511, M. Maška
IB002/13: each even Thursday 10:00–11:50 C511, V. Lorenc, A. Zlámal
IB002/14: each odd Thursday 10:00–11:50 C511, V. Lorenc, A. Zlámal
IB002/17: each even Thursday 18:00–19:50 B410, B. Kozlíková
IB002/18: each odd Thursday 18:00–19:50 B410, B. Kozlíková
IB002/19: each even Wednesday 18:00–19:50 B003, A. Strejčková
IB002/20: each odd Wednesday 18:00–19:50 B003, J. Filipovič
Prerequisites
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 15 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.
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 and breath-first traversal.
Literature
  • SKIENA, Steven S. The algorithm design manual. New York: Springer, 1998. xvi, 486. ISBN 0387948600. info
  • CORMEN, Thomas H., Charles E. LEISERSON and Ronald L. RIVEST. Introduction to algorithms. Cambridge: MIT Press, 1989. xvii, 1028. ISBN 0070131430. info
Assessment methods (in Czech)
Zkoušky jsou písemné. Dvě zkoušky budou průběžné (polosemestrální) a jedna závěrečná za celý semestr.
Účast na cvičeních je povinná, neučast je možná pouze ze závažných důvodů. Student může maximálně ve dvou případech navštívit jinou skupinu cvičení, než do které je zapsán. V tomto případě je ale povinen tuto skutečnost nahlásit cvičícímu své seminární skupiny e-mailem a zapsat se na prezenční listinu seminární skupiny, na kterou se dostaví.
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 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2012, Spring 2013, Spring 2014, Spring 2015, Spring 2016, Spring 2017, Spring 2018, Spring 2019, Spring 2020.
  • Enrolment Statistics (Spring 2007, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2007/IB002