CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2024/2025

# Algorithms and Graphs 1

Code Completion Credits Range Language
BI-AG1.21 Z,ZK 5 2P+2C Czech
Garant předmětu:
Dušan Knop
Lecturer:
Dušan Knop, Michal Opler
Tutor:
Suzan Catay, Michal Dvořák, Radek Hušek, Dušan Knop, Daniel Král, Michal Opler, Josef Erik Sedláček, Martin Slávik, Ondřej Suchý, Ondřej Šofr, Petr Šťastný, Tomáš Valla
Supervisor:
Department of Theoretical Computer Science
Synopsis:

The course covers the basics of efficient algorithm design, data structures, and graph theory, belonging to the core knowledge of every computing curriculum.

It links and partially develops the knowledge from the course BI-DML.21, in which students acquire the knowledge and skills in combinatorics necessary for evaluating the time and space complexity of algorithms. The course also follows up knowledge from BI-MA1.21, the practical usage of asymptotic mathematics, in particular, the asymptotic notation.

Requirements:

Active algorithmic skills for solving basic types of computational tasks, programming skills in C++ (e.g., the level needed for passing BIE-PA1.21 and BIE-PA2.21) , and knowledge of basic notions from mathematical analysis and combinatorics are expected (e.g., by passing BIE-DML.21 a BIE-MA1.21). Students are expected to take the concurrent course BIE-AAG.21 and BIE-MA2.21.

Syllabus of lectures:

1. Motivation, graph definition, important types of graphs, undirected graphs, graph representation, subgraphs.

2. Connectivity, connected components, DFS, directed graphs, trees.

3. Spanning trees, distances in graphs, BFS, topological ordering.

4. Basic sorting algorithms with the quadratic time complexity. Binary heap as a partially ordered structure, HeapSort.

5. Extendable array, amortized complexity. Binomial Heaps.

6. Operations and properties of binary search trees, balancing strategies, and AVL trees.

7. Randomized algorithms. Introduction to probability theory. Hash tables and strategies of collision resolving.

8. Recursive algorithms and Divide and Conquer algorithms.

9. QuickSort. Lower bound of complexity for sorting problem in the comparison model. Special sorting algorithms.

10. Dynamic programming.

11. Minimum spanning trees of edge-labelled graphs. Jarník’s algorithm and Kruskal’s algorithm and their implementations.

12. Shortest paths algorithms on edge-labeled graphs.

Syllabus of tutorials:

1. Motivation and Elements of Graph Theory I.

2. Elements of Graph Theory II.

3. Elements of Graph Theory III.

4. Sorting Algorithms O(n^2). Binary Heaps.

5. Extendable Array, Amortized Complexity, Binomial Heaps.

6. Search Trees and Balance Strategies.

7. Hashing and Hash tables.

8. Recursive Algorithms and Divide et Impera Method.

9. Probabilistic Algorithms and their Complexity. QuickSort.

10. Semestral test.

11. Dynamic Programming.

13. Minimum Spanning Trees, Shortest Paths.

Study Objective:

Students learn basic techniques for proving the correctness of algorithms and techniques of asymptotic mathematics for estimation of their complexity in the best, worst, or average case.

Study materials:

1. Cormen T.H., Leiserson C.E., Rivest R.L., Stein C.: Introduction to Algorithms (4th Edition). MIT Press, 2022. ISBN 978-0262033848.

2. J. Matoušek, J. Nešetřil: Invitation to Discrete Mathematics, 2008, 2th edition, Oxford University Press. (Available online in English.)

3. R. Diestel: Graph Theory, 2010, 4th edition, Springer-Verlag, Berlin. (Available online, new edition released in 2017.)

Note:
Further information:
https://courses.fit.cvut.cz/BI-AG1
Time-table for winter semester 2024/2025:
 06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00 roomTK:BSOpler M.09:15–10:45(lecture parallel1)DejviceNTK Ballingův sálroomTH:A-1442Dvořák M.11:00–12:30(parallel nr.1)Thákurova 7 (budova FSv)roomT9:302Slávik M.12:45–14:15(parallel nr.2)DejviceNBFIT učebnaroomT9:302Slávik M.14:30–16:00(parallel nr.3)DejviceNBFIT učebnaroomTH:A-124216:15–17:45(parallel nr.4)Thákurova 7 (budova FSv)roomTH:A-124218:00–19:30(parallel nr.5)Thákurova 7 (budova FSv) roomTK:BSKnop D.16:15–17:45(lecture parallel2)DejviceNTK Ballingův sálroomTH:A-1247Dvořák M.18:00–19:30(parallel nr.6)Thákurova 7 (budova FSv)seminární místnost roomT9:301Catay S.07:30–09:00(parallel nr.7)DejviceNBFIT učebnaroomTH:A-1247Knop D.09:15–10:45(parallel nr.9)Thákurova 7 (budova FSv)seminární místnostroomT9:302Valla T.11:00–12:30(parallel nr.10)DejviceNBFIT učebnaroomTH:A-942Král D.12:45–14:15(parallel nr.11)Thákurova 7 (budova FSv) roomTH:A-1247Knop D.07:30–09:00(parallel nr.8)Thákurova 7 (budova FSv)seminární místnost roomT9:347Hušek R.16:15–17:45(parallel nr.12)DejviceNBFIT učebnaroomT9:347Hušek R.18:00–19:30(parallel nr.13)DejviceNBFIT učebna roomT9:301Sedláček J.07:30–09:00(parallel nr.14)DejviceNBFIT učebnaroomT9:301Sedláček J.09:15–10:45(parallel nr.16)DejviceNBFIT učebnaroomT9:347Šofr O.16:15–17:45(parallel nr.18)DejviceNBFIT učebnaroomT9:347Šofr O.18:00–19:30(parallel nr.20)DejviceNBFIT učebna roomT9:34707:30–09:00(parallel nr.15)DejviceNBFIT učebnaroomT9:34709:15–10:45(parallel nr.17)DejviceNBFIT učebnaroomTH:A-1247Šťastný P.16:15–17:45(parallel nr.19)Thákurova 7 (budova FSv)seminární místnostroomTH:A-1247Šťastný P.18:00–19:30(parallel nr.21)Thákurova 7 (budova FSv)seminární místnost roomT9:302Suchý O.12:45–14:15(parallel nr.22)DejviceNBFIT učebnaroomT9:302Suchý O.14:30–16:00(parallel nr.23)DejviceNBFIT učebna
Time-table for summer semester 2024/2025:
Time-table is not available yet
The course is a part of the following study plans:
Data valid to 2024-09-15
Aktualizace výše uvedených informací naleznete na adrese https://bilakniha.cvut.cz/en/predmet6546906.html