|
|
|
||
Last update: doc. RNDr. Pavel Töpfer, CSc. (30.10.2019)
|
|
||
Last update: RNDr. Tomáš Holan, Ph.D. (20.10.2022)
The course is concluded with a credit and a final exam. Obtaining a credit is a necessary prerequisite for an enrollment for the final exam.
The credit is awarded upon successfully completing the following requirements:
Due to the nature of the requirements, a failed attempt cannot be repeated as is possible for exams. The instructor may specify conditions whereby a student can make up for missing homework assignments.
The final exam consists of a written and an oral part. The grade is based on results of both parts. Problems assigned in the written part correspond to the syllabus and the material covered in tutorials. Questions posed in the oral part explore the topics included in the syllabus to the extent that these topics are covered in lectures. A student has three chances to take the final exam.
Cheating on an exam or a homework assignment may result in automatically failing the course. |
|
||
Last update: doc. RNDr. Tomáš Dvořák, CSc. (29.09.2022)
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, Introduction to Algorithms, 4th ed., MIT Press, Cambridge, MA 2022 |
|
||
Last update: doc. RNDr. Tomáš Dvořák, CSc. (23.09.2019)
Basic algorithms and techniques.
Basic data structures.
Sorting.
Recursion.
State space search.
Basic graph algorithms.
General methods of algorithms design.
|