IB002 Algorithms and data structures I

Faculty of Informatics
Spring 2014
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. Peter Bezděk, Ph.D. (seminar tutor)
Mgr. Lukáš Ďurovský (seminar tutor)
Mgr. Bc. Tomáš Janík (seminar tutor)
Mgr. Miroslav Klimoš (seminar tutor)
Mgr. Marek Klučár (seminar tutor)
Mgr. Michal Kotrbčík, Ph.D. (seminar tutor)
Mgr. Karel Kubíček (seminar tutor)
RNDr. Henrich Lauko, Ph.D. (seminar tutor)
Mgr. Matúš Madzin (seminar tutor)
doc. Mgr. Jan Obdržálek, PhD. (seminar tutor)
Alexandru Popa, Ph.D. (seminar tutor)
doc. RNDr. Vojtěch Řehák, Ph.D. (seminar tutor)
doc. RNDr. David Svoboda, Ph.D. (seminar tutor)
RNDr. Vladimír Ulman, Ph.D. (seminar tutor)
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 10:00–11:50 D1, Thu 10:00–11:50 D3
  • Timetable of Seminar Groups:
IB002/NA13: Mon 18:00–19:50 G123, A. Popa
IB002/NA14: Wed 16:00–17:50 G125, A. Popa
IB002/N01: Tue 18:00–19:50 B410, L. Ďurovský
IB002/N02: Mon 16:00–17:50 G124, L. Ďurovský
IB002/N03: Mon 18:00–19:50 G126, L. Ďurovský
IB002/N04: Thu 16:00–17:50 G124, V. Ulman
IB002/N05: Mon 10:00–11:50 G125, V. Ulman
IB002/N06: Thu 8:00–9:50 G123, D. Svoboda
IB002/N07: Tue 16:00–17:50 G125, M. Madzin
IB002/N08: Tue 18:00–19:50 G125, M. Madzin
IB002/N09: Wed 14:00–15:50 G125, V. Řehák
IB002/N10: Thu 12:00–13:50 G123, V. Řehák
IB002/N11: Tue 18:00–19:50 G126, M. Kotrbčík
IB002/N12: Fri 12:00–13:50 G125, M. Kotrbčík
IB002/P01: Mon 8:00–9:50 B204, M. Klučár
IB002/P02: Mon 10:00–11:50 B204, M. Klučár
IB002/P03: Tue 12:00–13:50 B204, J. Obdržálek
IB002/P04: Tue 14:00–15:50 B204, J. Obdržálek
IB002/P05: Tue 8:00–9:50 B204, M. Klimoš
IB002/P06: Tue 10:00–11:50 B204, M. Klimoš
IB002/P07: Tue 16:00–17:50 B311, P. Bezděk
IB002/P08: Mon 14:00–15:50 B204, P. Bezděk
IB002/T01: Tue 18. 2. to Sat 31. 5. Tue 8:00–9:35 Učebna S8 (17), Wed 19. 2. to Sat 31. 5. Wed 8:00–9:35 Učebna S8 (17), T. Janík, Nepřihlašuje se. Určeno pro studenty se zdravotním postižením.
IB002/T02: Mon 17. 2. to Sun 25. 5. Mon 12:15–14:35 Učebna S9 (55), T. Janík, Nepřihlašuje se. Určeno pro studenty se zdravotním postižením.
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, and IB000 Mathematical Foundations of Computer Science. 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. Students should also know the basic mathematical notions as presented through IB000. A programming test in either C or Python is a part of the final exam.
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 20 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
    required literature
  • 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/jaro2014/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/jaro2014/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 2015, Spring 2016, Spring 2017, Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2024, Spring 2025.
  • Enrolment Statistics (Spring 2014, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2014/IB002