Algorithms

• 39 hrs lectures
• 13 hrs projects

• 51 pts final exam (written part)
• 14 pts mid-term test (written part)
• 35 pts projects

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.

• 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.

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.

• Introduction to Programming Systems (IZP)

• 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

1. Overview of data structures. Time complexity of algorithms.
2. Abstract data type and its specification. Specification, implementation and exploitation of the ADT list.
3. Specification, implementation and exploitation of ADT stack, queue, search table. Numeration of expressions with the use of the stack.
4. Algorithms upon the binary tree.
5. Searching, sequential, in the array, binary search, binary search trees, AVL tree.
6. Balanced multiway search trees. Hashing-tables.
7. Sorting, principles, without movement, multiple key.
8. Most common methods of sorting of arrays.
9. String-searching algorithms.
10. Recursion and the dynamic programming.
11. Graph algorithms.
12. Proving the correctness of algorithms.

1. Two home assignments
2. 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
• Accreditation - a minimum of 20 points per semester is required for credit to be awarded.
• 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.