Data Structures and Algorithms

Semestr: Winter

Range: 14+6s

Completion:

Credits: 6

Programme type:

Study form: Parttime

Course language: Czech

Time table at FEE

Summary:

Correctness and complexity of algorithms; sequences; hashing (associative arrays); sorting and searching; priority queues; generic optimization; software engineering perspective on algorithmics.

Keywords:

Course syllabus:

1. Complexity of algorithms
2. Correctness of algorithms
3. Average complexity
4. Randomized algorithms
5. Sequences
6. Hashing
7. Sorting and searching
8. Priority queues
9. Sorted sequences
10. Generic optimization
11. Software engineering perspective on algorithmics

Seminar syllabus:

1. Complexity of algorithms
2. Correctness of algorithms
3. Average complexity
4. Randomized algorithms
5. Sequences
6. Hashing
7. Sorting and searching
8. Priority queues
9. Sorted sequences
10. Generic optimization
11. Software engineering perspective on algorithmics

Literature:

1. K. Mehlhorn, P. Sanders: Algorithms and Data Structures: The Basic Toolbox
2. K. Weihe: A Software Engineering Perspective on Algorithmics
3. Course webpage: http://ocw.cvut.cz/moodle/course/view.php?id=471 (key: dsa)

Examiners:

Lecturers:

Instructors: