|
|
|
||
Last update: doc. RNDr. Pavel Töpfer, CSc. (01.02.2018)
|
|
||
Last update: T_KTI (23.05.2008)
Naučit základní datové struktury, algoritmy a metody teoretické informatiky |
|
||
Last update: Mgr. Martin Mareš, Ph.D. (06.02.2023)
It is necessary to get course credit and pass the examination (in arbitrary order).
For credit you need to get 100 points out of at least 150 possible continuously awarded for homework, tests, and other activities.
The ongoing nature of the inspection does not imply a right to request corrective tests nor alternative homework assignments.
In justified cases (long-term illness, stay abroad, etc.) the lecturer may set individual conditions for credit granting.
The examination can be written, oral, or combined. It can take presence or distance form. The form of the exam is determined by the teacher. |
|
||
Last update: RNDr. Jan Hric (03.10.2017)
|
|
||
Last update: Mgr. Martin Mareš, Ph.D. (02.03.2018)
It is necessary to understand the theory presented at the lectures and to be able to apply it to solving of algorithmic problems. |
|
||
Last update: doc. RNDr. Pavel Töpfer, CSc. (01.02.2018)
Optional topics in square brackets, the rest is mandatory.
1. Means for describing the complexity of algorithms and operations with data structures
2. Tree data structures
3. Hashing
4. Sorting
5. Basic graph algorithms
6. Extreme paths in graphs
7. Minimum spanning tree
8. Divide and conquer method
9. Dynamic programming
|