IAL Acad. year 2022/2023 Winter semester 5 credits
Overview of fundamental data structures and their exploitation. Introduction to time complexity of algorithms. Specification of abstract data types (ADT). Specification and implementation of ADT's: lists, stack and its exploitation, queue, searching table. Algorithms upon the binary trees. Searching: sequential, in the ordered and in not ordered array, searching with the guard (sentinel), binary search, search tree, balanced trees (AVL), balanced multiway serach trees. Searching in hash-tables. Ordering (sorting), principles, sorting without the moving of items, sorting with multiple keys. Most common methods of sorting: Select-sort, Bubble-sort, Heap-sort, Insert-sort and its variants, Shell-sort, recursive and non-recursive notation of the Quick sort, Merge-sort, List-merge-sort, Radix-sort. Recursion and dynamic programming. Searching the patterns in the text. Graph algorithms. Proving of the correctness of programs.
5 ECTS credits represent approximately 125-150 hours of study workload:
- 39 hours of lectures
- 26 hours for two home assignments
- 35 hours of project work
- 20 hours of continual study
- 30 hours of study for the midterm and final examination
Hranický Radek, Ing., Ph.D. (UIFS)
Křena Bohuslav, Ing., Ph.D. (UITS)
Language of instruction
- 39 hrs lectures
- 13 hrs projects
- 51 pts final exam (written part)
- 14 pts mid-term test (written part)
- 35 pts projects
Hranický Radek, Ing., Ph.D. (UIFS)
Křena Bohuslav, Ing., Ph.D. (UITS)
Koutenský Michal, Ing. (UIFS)
Subject specific learning outcomes and competences
- The student will learn the fundamentals of algorithm complexity and their intention.
- He/she acquaints with basic abstract data types and to commands its implementation and exploitation.
- He/she learns and commands recursive and non recursive notation of basic algorithms.
- Student will become familiar with different variants of search tables and understand their properties.
- Student overrules the implementation and analysis of most used algorithms for searching and sorting.
- The student learns terminology in Czech and English language.
- The student learns to participate on the small project as a member of a small team.
- Student learns to present and defend the results of the small project.
- The student will acquaint with the methods of proving of the correctness of programs and with the construction of proved programs and learn their significance.
The student will learn the fundamentals of algorithm complexity and will be able to use gained knowledge in the design of programs. Student acquaints with basic abstract data types and learn how to implement nad use them. The student learns and commands recursive and non-recursive notation of basic algorithms and will be able to use gained knowledge in the design of programmes. Student understands the implementation and analysis of most of the used algorithms for searching and sorting. The student will understand basic text search algorithms and basic graph algorithms. The student will learn about recursive problem solving and the basics of dynamic programming. The student will learn the principles of methods of proving of the correctness of programs and will be able to use gained knowledge in the design of programmes.
Why is the course taught
Almost all computer programs need to store data during their execution. Students will make familiar with common data structures and understand their properties. It allows them later to choose the right data structure for a particular purpose. Students also learn algorithms associated with discussed data structures and will be able to analyse and evaluate them using the asymptotic time complexity method.
Prerequisite knowledge and skills
- Basic knowledge of the programming in a procedural programming language
- Knowledge of secondary school level mathematics
- Mareš, M., Valla, T.: Průvodce labyrintem algoritmů, CZ.NIC, 2017, ISBN 978-80-88168-19-5, http://pruvodce.ucw.cz/
- Honzík, J., Hruška, T., Máčel, M.: Vybrané kapitoly z programovacích technik, Ed. stř. VUT Brno, 1991
- Cormen, T.H., Leiserson, Ch.E., Rivest, R.L.: Introduction to Algorithms, Cambridge: MIT Press, 2009
- Knuth, D.: The Art of Computer programming, Vol.1,2,3. Addison Wesley, 1968
- Wirth, N.: Alorithms+Data Structures=Programs, Prentice Hall, 1976
- Aho A.V., Hoppcroft J.E., Ullman J.D.: Data Structures and Algorithms, Addison Wesley, 1983
- Baase, S.: Computer Algorithms - Introduction to Design and Analysis. Addison Wesley, 1998
- Sedgewick,R.:Algoritmy v C, Addison Wesley 1998, Softpress 2003
Syllabus of lectures
- Overview of data structures. Time complexity of algorithms.
- Abstract data type and its specification. Specification, implementation and exploitation of the ADT list.
- Specification, implementation and exploitation of ADT stack, queue. Numeration of expressions with the use of the stack.
- Algorithms upon the binary tree.
- Searching, sequential, in the array, binary search, binary search trees, AVL tree.
- Balanced multiway search trees. Hashing-tables.
- Sorting, principles, without movement, multiple key.
- Most common methods of sorting of arrays - beginning.
- Most common methods of sorting of arrays - continuation.
- Recursion and the dynamic programming.
- String-searching algorithms.
- Graph algorithms.
- Proving the correctness of algorithms.
Syllabus - others, projects and individual work of students
- Two home assignments
- Project with a mini-defence for a team of students.
- Home assignments - 20 points
- Mid-term written examination - 14 point
- Evaluated project with the defence - 15 points
- Final written examination - 51 points; The minimal number of points which can be obtained from the final written examination is 24. Otherwise, no points will be assigned to a student.
In case of illness or another serious obstacle, the student should inform the faculty about that and subsequently provide the evidence of such an obstacle. Then, it can be taken into account within evaluation:
- The student can ask the responsible teacher to extend the time for the home assignment.
- If a student cannot attend the mid-term exam, (s)he can ask to derive points from the evaluation of his/her first attempt of the final exam. To enter the final exam in this case, at least 14 points from home assignments and project are required.
- If a student cannot attend the defense of the project and the other team members agree with that (s)he can earn the same points from the project defence as for present members.
- to earn min. 20 points within the semester
Plagiarism and not allowed cooperation will cause that involved students are not classified and disciplinary action can be initiated.
|Mon||exam||2023-01-30||D0206 D105||09:00||10:50||2. oprava|
|Tue||lecture||1., 3., 4., 5., 6., 7., 8., 9., 10., 11., 12. of lectures||E104 E105 E112||14:00||16:50||350||2BIB 3BIT||xx 20 - 29||Burgetová|
|Tue||lecture||2022-12-13||E104 E105 E112||14:00||16:50||350||2BIB 3BIT||xx 20 - 29||Křena|
|Tue||exam||2022-11-08||E104 E105 E112||14:15||15:00||Půlsemestrální test - varianta: úterý 14:15|
|Tue||exam||2022-11-08||E104 E105 E112||15:30||16:15||Půlsemestrální test - varianta: úterý 15:30|
|Wed||exam||2023-01-18||D0206 D0207 D105||09:00||10:50||1. oprava|
|Wed||lecture||1., 3., 4., 5., 6., 7., 8., 9., 10., 11., 12. of lectures||E104 E105 E112||14:00||16:50||294||2BIA 3BIT||xx 10 - 19||Hranický|
|Wed||lecture||2022-12-14||E104 E105 E112||14:00||16:50||294||2BIA 3BIT||xx 10 - 19||Křena|
|Wed||exam||2022-11-09||E104 E105 E112||14:15||15:00||Půlsemestrální test - varianta: středa 14:15|
|Wed||exam||2022-11-09||E104 E105 E112||15:30||16:15||Půlsemestrální test - varianta: středa 15:30|
|Fri||other||2022-12-09||C228||12:30||12:45||Obhajoba náhradního projektu|
|Fri||other||2022-12-09||C228||12:45||13:00||Obhajoba náhradního projektu|
|Fri||other||2022-12-09||C228||13:00||13:15||Obhajoba náhradního projektu|
|Fri||other||2022-12-09||C228||13:15||13:30||Obhajoba náhradního projektu|
|Fri||other||2022-12-09||C228||13:30||13:45||Obhajoba náhradního projektu|
|Fri||other||2022-12-09||C228||13:45||14:00||Obhajoba náhradního projektu|
|Fri||other||2022-12-09||C228||14:00||14:15||Obhajoba náhradního projektu|
|Fri||other||2022-12-09||C228||14:15||14:30||Obhajoba náhradního projektu|
Course inclusion in study plans
- Programme BIT, 2nd year of study, Compulsory
- Programme BIT (in English), 2nd year of study, Compulsory
- Programme IT-BC-3, field BIT, 2nd year of study, Compulsory