IB002 Algorithms and data structures I

Faculty of Informatics
Spring 2016
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)
RNDr. Nikola Beneš, Ph.D. (seminar tutor)
RNDr. Peter Bezděk, Ph.D. (seminar tutor)
RNDr. František Blahoudek, Ph.D. (seminar tutor)
Mgr. Bc. Tomáš Janík (seminar tutor)
Mgr. Jan Ježek (seminar tutor)
Mgr. Henrich Lauko (seminar tutor)
Bc. Tomáš Novotný (seminar tutor)
doc. Mgr. Jan Obdržálek, PhD. (seminar tutor)
Bc. Filip Opálený (seminar tutor)
Kristýna Pavlíčková (seminar tutor)
RNDr. Jaromír Plhák, Ph.D. (seminar tutor)
doc. RNDr. Vojtěch Řehák, Ph.D. (seminar tutor)
Mgr. Tomáš Zábojník (seminar tutor)
Mgr. Kristína Zákopčanová (seminar tutor)
Mgr. Peter Benčík (assistant)
Bc. Jan Koniarik (assistant)
Mgr. Karel Kubíček (assistant)
Mgr. Jan Mrázek (assistant)
RNDr. Vladimír Ulman, Ph.D. (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
Mon 12:00–13:50 D3, Mon 12:00–13:50 D1
  • Timetable of Seminar Groups:
IB002/K21: Thu 16:00–17:50 B204, T. Novotný
IB002/T01: Tue 23. 2. to Fri 20. 5. Tue 15:45–17:20 KOM 106, T. Janík, Nepřihlašuje se. Určeno pro studenty se zdravotním postižením.
IB002/T02: Wed 24. 2. to Fri 20. 5. Wed 14:10–16:35 KOM 106, T. Janík, Nepřihlašuje se. Určeno pro studenty se zdravotním postižením.
IB002/01: Mon 8:00–9:50 B410, J. Plhák
IB002/02: Mon 10:00–11:50 A318, F. Blahoudek
IB002/03: Mon 14:00–15:50 A319, K. Pavlíčková
IB002/04: Mon 16:00–17:50 A217, J. Obdržálek
IB002/05: Mon 16:00–17:50 A218, H. Lauko
IB002/06: Mon 18:00–19:50 A318, N. Beneš
IB002/07: Tue 10:00–11:50 A218, F. Blahoudek
IB002/08: Tue 10:00–11:50 B410, F. Opálený
IB002/09: Tue 14:00–15:50 B204, H. Lauko
IB002/10: Tue 16:00–17:50 B204, P. Bezděk
IB002/11: Tue 16:00–17:50 B410, J. Obdržálek
IB002/12: Tue 18:00–19:50 A218, T. Zábojník
IB002/13: Wed 8:00–9:50 C511, J. Ježek
IB002/14: Wed 12:00–13:50 A319, V. Řehák
IB002/15: Wed 12:00–13:50 B410, T. Novotný
IB002/16: Wed 14:00–15:50 A218, N. Beneš
IB002/17: Wed 16:00–17:50 B410, F. Opálený
IB002/18: Wed 18:00–19:50 B410, P. Bezděk
IB002/19: Thu 8:00–9:50 B410, J. Ježek
IB002/20: Thu 10:00–11:50 A318, J. Obdržálek
IB002/22: Fri 8:00–9:50 B410, K. Zákopčanová
IB002/23: Fri 10:00–11:50 A217, K. Zákopčanová
Prerequisites
IB001 Intro to Prog. using C || IB111 Intro to Programming || IB999 Programming Test
The students should comprehend the basic notions on the level of IB001 Introduction to Programming using C or IB111 Introduction to Programing using Python. Students should be able to: understand and apply basic constructs of programming languages (e.g., conditions, loops, functions, basic data types) 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 the course is directly associated with
there are 21 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. 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.
  • 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.
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
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/jaro2016/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/jaro2016/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 2017, Spring 2018, Spring 2019, Spring 2020.
  • Enrolment Statistics (Spring 2016, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2016/IB002