|
Lecturer(s)
|
-
Kopetschke Igor, Ing.
-
Satrapa Pavel, doc. RNDr. Ph.D.
-
Hybš Jan, Ing.
|
|
Course content
|
Přednášky: 1. Data organisation in internal and external memory. 2. Arrays and records and their applications. 3. Divide and rule methods. 4. Sorting algorithms. 5. Hungry algorithms. 6. Grafs and their representations, shortest path in graph. 7. Minimal spanning tree, pairing algorithms. 8. Trees, search trees, balancing. 9. State space searching, backtracking, minimax, alpha-beta reduction. 10. Files - sequential and direct access. 11. File indexing. 12. Hashing. 13. Pattern search in strings, longest common subsequence. 14. Data compression algorithms. Cvičení: 1. Structured data types and their representation. 2. Usage of arrays and records. 3. Divide and rule methods. 4. Sorting algorithms. 5. Hungry algorithms. 6. Grafs and their representations, shortest path in graph. 7. Minimal spanning tree, pairing algorithms. 8. Trees, search trees, balancing. 9. State space searching, backtracking, minimax, alpha-beta reduction. 10. Files - sequential and direct access. 11. File indexing. 12. Hashing. 13. Pattern search in strings, longest common subsequence. 14. Data compression algorithms.
|
|
Learning activities and teaching methods
|
Monological explanation (lecture, presentation,briefing)
- Class attendance
- 56 hours per semester
|
|
Learning outcomes
|
Advanced data structures and their computer representation, algorithms for their processing. Graph algorithms, sorting algorithms.
Students learn the features of selected data structures and algorithms and how to use them.
|
|
Prerequisites
|
Algorithm development basics.
|
|
Assessment methods and criteria
|
Combined examination
Requirements for getting a credit are activity at the practicals /seminars and successful passing the tests. Examination is of the written and oral forms.
|
|
Recommended literature
|
-
Wirth, N. Algoritmy a štruktúry údajov. Alfa, Bratislava, 1987.
-
Knuth, D. The Art of Computer Programming. Reading, Massachutes: Addison-Wesley, 1997.
-
Kučera, L. Kombinatorické algoritmy. Praha, SNTL 1989.
|