IB002 Algorithms and data structures I

Faculty of Informatics
Spring 2017
Extent and Intensity
2/2. 4 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
Teacher(s)
prof. RNDr. Ivana Černá, CSc. (lecturer)
Mgr. Michaela Balážová (seminar tutor)
Mgr. Peter Benčík (seminar tutor)
RNDr. Nikola Beneš, Ph.D. (seminar tutor)
RNDr. František Blahoudek, Ph.D. (seminar tutor)
doc. RNDr. Tomáš Brázdil, Ph.D. (seminar tutor)
Mgr. Radka Cieslarová (seminar tutor)
RNDr. Jaroslav Čechák, Ph.D. (seminar tutor)
Mgr. Jakub Hančin (seminar tutor)
Mgr. Barbora Kompišová (seminar tutor)
Mgr. Jan Koniarik (seminar tutor)
Mgr. Karel Kubíček (seminar tutor)
RNDr. Henrich Lauko, Ph.D. (seminar tutor)
doc. Mgr. Jan Obdržálek, PhD. (seminar tutor)
RNDr. Filip Opálený (seminar tutor)
RNDr. Jaromír Plhák, Ph.D. (seminar tutor)
doc. RNDr. Vojtěch Řehák, Ph.D. (seminar tutor)
Mgr. Bc. Kateřina Sloupová (seminar tutor)
Mgr. Ján Štefkovič (seminar tutor)
RNDr. Bc. Dominik Velan, Ph.D. (seminar tutor)
Mgr. Viktória Vozárová (seminar tutor)
Mgr. Zuzana Baranová (assistant)
Mgr. Tadeáš Kučera (assistant)
Mgr. et Mgr. Dominika Lauko (assistant)
Mgr. Adam Matoušek (assistant)
Bc. Miriama Rajčanová (assistant)
Mgr. Miloslav Staněk (assistant)
Mgr. Alena Zahradníčková (assistant)
Mgr. Tatiana Zbončáková (assistant)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Timetable
Thu 14:00–15:50 D1, Thu 14:00–15:50 D3
  • Timetable of Seminar Groups:
IB002/konzultace01: Mon 17:00–18:50 A420, P. Benčík
IB002/konzultace02: Tue 16:00–17:50 A420, P. Benčík
IB002/konzultace03: Fri 8:00–9:50 A420, B. Kompišová
IB002/T01: Wed 22. 2. to Mon 22. 5. Wed 14:15–16:40 118, J. Koniarik, Nepřihlašuje se. Určeno pro studenty se zdravotním postižením.
IB002/01: Mon 8:00–9:50 A218, V. Řehák
IB002/02: Mon 12:00–13:50 A320, F. Blahoudek
IB002/03: Mon 14:00–15:50 C416, J. Obdržálek
IB002/04: Mon 18:00–19:50 A319, J. Čechák
IB002/05: Tue 10:00–11:50 A218, J. Koniarik
IB002/06: Tue 10:00–11:50 B411, T. Brázdil
IB002/07: Tue 12:00–13:50 C416, J. Obdržálek
IB002/08: Tue 14:00–15:50 C416, V. Vozárová
IB002/09: Tue 16:00–17:50 B410, M. Balážová, J. Štefkovič
IB002/10: Tue 18:00–19:50 B410, R. Cieslarová, K. Sloupová
IB002/11: Wed 8:00–9:50 B411, J. Plhák
IB002/12: Wed 10:00–11:50 A217, except Wed 17. 5. ; and Wed 17. 5. 10:00–11:50 C416, J. Hančin
IB002/13: Wed 12:00–13:50 C525, F. Opálený
IB002/14: Wed 18:00–19:50 C525, D. Velan
IB002/15: Thu 12:00–13:50 A320, K. Kubíček
IB002/16: Thu 16:00–17:50 A218, F. Blahoudek
IB002/17: Thu 16:00–17:50 B410, J. Plhák
IB002/18: Thu 16:00–17:50 C525, N. Beneš
IB002/19: Thu 18:00–19:50 C416, F. Opálený
IB002/20: Fri 8:00–9:50 C416, V. Vozárová
IB002/21: Fri 10:00–11:50 C511, J. Obdržálek
Prerequisites
IB001 Intro to Prog. using C || IB111 Introduction to Programming || IB999 Programming Test
The students should comprehend the basic notions on the level of IB111 Introduction to Programming. Students should be able to: understand and apply basic constructs of programming languages (e.g., conditions, loops, functions, basic data types) in Python and know several basic algorithms.
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
Course objectives
The course presents basic techniques of the analysis of algorithms, data structures, and operations. Students should correctly apply the basic data structures and algorithms as well as apply the algorithm design and analysis techniques when designing new algoritms.
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.
  • Algorithm design techniques. Divide et impera and recursive algorithms.
  • Fundamental data structures: lists, queues. Representation of sets, hash tables. Binary heaps. Binary search trees, balanced trees (B trees, Red-black trees).
  • Sorting algorithms: quicksort, mergesort, heapsort, lower bound for time complexity of sorting.
  • Graphs and their representation. Graph search. Depth-first traversal, topological sort, strongly connected components. Breath-first traversal, bipartite graphs. Shortest paths, algorithm Bellman - Ford, Dijkstra's algorithm.
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 written final exam and written exams during the term. Details can be found in learning materials https://is.muni.cz/auth/el/1433/jaro2017/IB002/index.qwarp
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
https://is.muni.cz/auth/el/1433/jaro2017/IB002/index.qwarp
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 2012, Spring 2013, Spring 2014, Spring 2015, Spring 2016, Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2024, Spring 2025.
  • Enrolment Statistics (Spring 2017, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2017/IB002