CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2024/2025

# Algorithms visually

The course is not on the list Without time-table
Code Completion Credits Range Language
BI-AVI.21 Z,ZK 4 2P+1C Czech
Vztahy:
In order to register for the course BI-AVI.21, the student must have successfully completed the course BI-PA1 in a previous semester.
In order to register for the course BI-AVI.21, the student must have registered for the course BI-PA2 in a previous semester.
Garant předmětu:
Luděk Kučera
Lecturer:
Luděk Kučera
Tutor:
Luděk Kučera
Supervisor:
Department of Theoretical Computer Science
Synopsis:

The course complements other algorithm courses at FIT. It brings knowledge about particular important algorithms from different fields of the computer science that extend substantially knowledge presented in BI-AG1 and BI-AG2. A wide scope of covered subject is made possible due to using visualization bz Algovision (www.algovision.org&lt;http://www.algovision.org&gt;) that make understanding the principles of algorithms easy.

Requirements:

There are no input knowledge requirements.

Syllabus of lectures:

1. Tree data structures (general methods and algorithms that are not included in AG1 and AG2, e.g., red-black trees)

2. Shortest paths (algorithm invariant view of Dijkstra and Bellman-Ford algorithms)

3. Efficient network flow algorithms - augmenting path methods (Dinitz and 3 Indiens)

4. Efficient network flow algorithms - preflow methods (Goldberg)

5. Discrete Fourier transform, cosine transform and the FFT algorithm

7. Geometric algorithms (convex hull, Voronoi diagram - Fortune)

8. Sorting and switching networks (bitonic sort, odd-even sort)

10. Eigenvector and eigenvalue applications (graph min-cut spectral algorithm)

11. Linear programming (simplex method and duality)

12. Quantum algorithms (basic notions - qubit, entanglement)

13. Quantum algorithms (Algorithms of Groover and Simon with a light outline of Shor factorization)

Syllabus of tutorials:

1. Tree data structures (general methods and algorithms that are not included in AG1 and AG2, e.g., red-black trees)

2. Shortest paths (algorithm invariant view of Dijkstra and Bellman-Ford algorithms)

3. Efficient network flow algorithms - augmenting path methods (Dinitz and 3 Indiens)

4. Efficient network flow algorithms - preflow methods (Goldberg)

5. Discrete Fourier transform, cosine transform and the FFT algorithm

7. Geometric algorithms (convex hull, Voronoi diagram - Fortune)

8. Sorting and switching networks (bitonic sort, odd-even sort)

10. Eigenvector and eigenvalue applications (graph min-cut spectral algorithm)

11. Linear programming (simplex method and duality)

12. Quantum algorithms (basic notions - qubit, entanglement)

13. Quantum algorithms (Algorithms of Groover and Simon with a light outline of Shor factorization)

Study Objective:
Study materials:

1. L. Kučera: Algovize, aneb procházka krajinou algoritmů, Blatenská tiskárna, 2009, ISBN 8090293859, 9788090293854. Dostupné z http://www.algovision.org

2. T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein: Introduction to Algorithms, MIT Press, 1990, 2009, ISBN 978-0-262-03384-8

3. B. Barak, S. Arora: Computational Complexity: A Modern Approach, 2007, Cambridge Univ. Press, ISBN 978-0521424264

Note:
Further information:
http://www.algovision.org/FIT-BI-AVI.html
No time-table has been prepared for this course
The course is a part of the following study plans:
Data valid to 2024-06-16
Aktualizace výše uvedených informací naleznete na adrese https://bilakniha.cvut.cz/en/predmet6290306.html