FI:IB114 Intro to Programming & Algs II - Course Information
IB114 Introduction to Programming and Algorithms IIFaculty of Informatics
- Extent and Intensity
- 2/1/0. 3 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
- prof. RNDr. Ivana Černá, CSc. (lecturer)
RNDr. Jaromír Plhák, Ph.D. (seminar tutor)
- Guaranteed by
- prof. RNDr. Ivana Černá, CSc.
Department of Computer Science - Faculty of Informatics
Supplier department: Department of Computer Science - Faculty of Informatics
- IB113 Intro to Programming & Algs && ! IB002 Algorithms I && ! NOW ( IB002 Algorithms I )
This course is intended for the study program Cybersecurity. Students enrolled in programs Informatics and Programming and Application Development are recommended IB002 instead.
- Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
The capacity limit for the course is 40 student(s).
Current registration and enrolment status: enrolled: 0/40, only registered: 0/40, only registered with preference (fields directly associated with the programme): 0/40
- fields of study / plans the course is directly associated with
- there are 13 fields of study the course is directly associated with, display
- Course objectives
- The course presents basic data structures and algorithms. 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 basic sorting algorithms and graph algorithms,
- actively design simple algorithms,
- actively used basic static and dynamic data structures,
- employ time complexity and correctness of algorithms,
- implement simple algorithms in the selected programming language (Python).
- Basic analysis of algorithms. The 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. Representation of sets, hash tables. Binary heaps. Binary search trees.
- Sorting algorithms. Quicksort, Mergesort, Heapsort.
- Graphs and their representation. Graph search. Depth-first traversal and Breadth-first traversal, applications.
- recommended literature
- CORMEN, Thomas H. Introduction to algorithms. 3rd ed. Cambridge, Mass.: MIT Press, 2009. xix, 1292. ISBN 9780262533058. info
- Teaching methods
- The course is organized as a series of lectures accompanied by exercises.
- Assessment methods
- The evaluation consists of a written final exam and written exams during the term. Details can be found in learning materials https://is.muni.cz/auth/el/1433/jaro2021/IB114/index.qwarp
- Language of instruction
- Further Comments
- The course is taught annually.
The course is taught: every week.
- Listed among pre-requisites of other courses
- Teacher's information