FI:IB002 Algorithms I - Course Information

IB002 Algorithms and data structures I

Faculty of Informatics
Spring 2019

Extent and Intensity

2/2. 4 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).

Teacher(s)

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 21. 2. to Thu 9. 5. Thu 14:00–15:50 D3, Thu 14:00–15:50 D1

Timetable of Seminar Groups:

IB002/konzultace01: Mon 10:00–11:40 A417, J. Horáček, Nepřihlašuje se, není cvičení, ale dobrovolná konzultace.
IB002/konzultace02: Mon 17:00–18:40 A417, T. Zbončáková, Bude i 17. a 24. 4. a 15. 5. od 9 do 11 v A417.
IB002/konzultace03: Tue 13:00–14:40 A417, A. Matoušek, Nepřihlašuje se, není cvičení, ale dobrovolná konzultace.
IB002/01: Mon 18. 2. to Mon 13. 5. Mon 8:00–9:50 A319, V. Řehák
IB002/02: Mon 18. 2. to Mon 13. 5. Mon 12:00–13:50 A218, P. Novotný
IB002/03: Mon 18. 2. to Mon 13. 5. Mon 14:00–15:50 A318, N. Beneš
IB002/04: Mon 18. 2. to Mon 13. 5. Mon 16:00–17:50 A320, J. Obdržálek
IB002/05: Mon 18. 2. to Tue 14. 5. Tue 8:00–9:50 A218, J. Obdržálek
IB002/06: Tue 19. 2. to Tue 14. 5. Tue 8:00–9:50 C511, J. Horáček
IB002/07: Tue 19. 2. to Tue 14. 5. Tue 10:00–11:50 A218, J. Obdržálek
IB002/08: Tue 19. 2. to Tue 14. 5. Tue 10:00–11:50 A318, T. Zbončáková
IB002/09: Tue 19. 2. to Tue 14. 5. Tue 12:00–13:50 A217, V. Vozárová
IB002/10: Tue 19. 2. to Tue 14. 5. Tue 12:00–13:50 A218, J. Pančík
IB002/11: Tue 19. 2. to Tue 14. 5. Tue 14:00–15:50 A217, V. Vozárová
IB002/12: Tue 19. 2. to Tue 14. 5. Tue 14:00–15:50 A319, T. Zbončáková
IB002/13: Tue 19. 2. to Tue 14. 5. Tue 18:00–19:50 A319, J. Pančík
IB002/14: Wed 20. 2. to Wed 15. 5. Wed 8:00–9:50 A218, J. Plhák
IB002/15: Wed 20. 2. to Wed 15. 5. Wed 8:00–9:50 B410, P. Novotný
IB002/16: Wed 20. 2. to Wed 15. 5. Wed 10:00–11:50 A318, P. Novotný
IB002/17: Wed 20. 2. to Wed 15. 5. Wed 12:00–13:50 A218, J. Plhák
IB002/18: Wed 20. 2. to Wed 15. 5. Wed 14:00–15:50 A218, V. Řehák
IB002/19: Wed 20. 2. to Wed 15. 5. Wed 16:00–17:50 A319, T. Effenberger
IB002/20: Thu 21. 2. to Thu 16. 5. Thu 8:00–9:50 B411, D. Velan
IB002/21: Thu 21. 2. to Thu 16. 5. Thu 16:00–17:50 A320, J. Koniarik
IB002/22: Fri 22. 2. to Fri 17. 5. Fri 8:00–9:50 A320, D. Velan
IB002/23: Fri 22. 2. to Fri 17. 5. Fri 10:00–11:50 B410, T. Brázdil
IB002/24: Fri 22. 2. to Fri 17. 5. Fri 12:00–13:50 A218, M. Švidroňová

Prerequisites

IB001 Intro to Prog. using C || IB111 Foundations of Programming || IB999 Programming Test
The students should comprehend the basic notions on the level of IB111 Introduction to Programming 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) in Python, know principles of recursion, and several basic algorithms. Students should know the basic mathematical notions; understand the logical structure of mathematical statements and mathematical proofs, specially mathematical induction; know discrete mathematical structures such as finite sets, relations, functions, and graph including their applications in informatics.

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 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 algorithms. Students implement their algorithms in programming language Python.

Learning outcomes

After enrolling the course students are able to:
- actively use and modify basis sorting algorithms and graph algorithms,
- actively used basic techniques for designing algorithms (divide et impera, recursion) and design simple algorithms,
- actively used and modify basic static and dynamic data structures,
- employ time complexity and correctness of algorithms,
- analyze time complexity and prove correctness of simple iterative and recursive algorithms,
- implement algorithms in the selected programming language (Python).

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

required literature

CORMEN, Thomas H. Introduction to algorithms. 3rd ed. Cambridge, Mass.: MIT Press, 2009, xix, 1292. ISBN 9780262533058. URL info

recommended literature

SKIENA, Steven S. The algorithm design manual. New York: Springer, 1998, xvi, 486. ISBN 0387948600. 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/jaro2019/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

IB114 Introduction to Programming and Algorithms II
(IB111 || IB113) && !IB002 && !NOW(IB002)
IV003 Algorithms and Data Structures II
IB002 || program(PřF:N-MA)
MA015 Graph Algorithms
IB002||(typ_studia(N)&&fakulta(fi))

Teacher's information

https://is.muni.cz/auth/el/1433/jaro2019/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 2017, Spring 2018, Spring 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2024.

Enrolment Statistics (Spring 2019, recent)
Permalink: https://is.muni.cz/course/fi/spring2019/IB002

FI:IB002 Algorithms I - Course Information

IB002 Algorithms and data structures I

Other applications