Course for international guest/part time students
- Faculty
- Faculty of Science
- Organization
- TTK Department of Computer Science
- Code
- algadt2u0um17em
- Title
- Design, analysis and implementation of algorithms and data structures 2 (l)
- Usual semester
- Spring
- ECTS
- 3
- Language
- Learning outcomes
- Knowledge: getting familiar with the main notions of algorithms and data structures Ability: design, analysis and implementation of algorithms and data structures Attitude: the need to deepen the applied mathematical knowledge, to gain new applied mathematical skills, to develop competencies. Aspiration to apply the mathematical knowledge for a wide range of problems Autonomy and Responsibility: based on the gained knowledge in algorithms and data structures, the students are able to decide which tools are the most suitable to solve applied problems
- Course content
- Union-find data structures. Fibonacci heap, Radix heap. Balanced and self-balancing trees. Hashing, its types, their analysis. Dynamic trees and their applications. Data structures used in geometric algorithms: hierarchical search trees, interval trees, heap search trees.
- Assessment method
- exam