Algorithms and Graphs 1
Code  Completion  Credits  Range  Language 

BIEAG1  Z,ZK  6  2P+2C  English 
 Lecturer:
 Pavel Tvrdík (guarantor), Jiřina Scholtzová
 Tutor:
 Pavel Tvrdík (guarantor), Jiřina Scholtzová
 Supervisor:
 Department of Theoretical Computer Science
 Synopsis:

The course covers the basics from the efficient algorithm design, data structures, and graph theory, belonging to the core knowledge of every computing curriculum. It is interlinked with the concurrent BIEAAG and BIEZDM courses in which the students gain the basic skills and knowledge needed for time and space complexity of algorithms and learn to handle practically the asymptotic mathematics.
 Requirements:

Active algorithmic skills for solving basic types of computational tasks, programming skills in some HLL (Java, C++), and knowledge of basic notions from the mathematical analysis and combinatorics are expected. Students are expected to take concurrent courses BIEAAG and BIEZDM.
 Syllabus of lectures:

1. Motivation and Elements of Graph Theory.
2. Basic Definitions and Elements of Graph Theory I.
3. Basic Definitions and Elements of Graph Theory II.
4. Sorting Algorithms O(n^2). Binary Heaps and HeapSort.
5. Extendable Array, Amortized Complexity, Binomial Heaps.
6. Search Trees and Balance Strategies.
7. Introduction to Randomization, Hashing.
8. Recursive algorithm and the DivideandConquer method.
9. Probabilistic Algorithms and Their Complexity. QuickSort.
10. Dynamic Programming.
11. Minimum Spanning Trees.
12. Shortest Paths Algorithms on Graphs.
 Syllabus of tutorials:

1. Motivation and Elements of Graph Theory I.
2. Elements of Graph Theory II.
3. Elements of Graph Theory III. 1st ProgTest.
4. Sorting Algorithms O(n^2). Binary Heaps.
5. Extendable Array, Amortized Complexity, Binomial Heaps.
6. Search Trees and Balance Strategies. 2nd ProgTest.
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. 3rd ProgTest.
13. Minimum Spanning Trees, Shortest Paths.
 Study Objective:
 Study materials:

[1] Cormen, T. H.  Leiserson, C. E.  Rivest, R. L.  Stein, C.: Introduction to Algorithms, 3rd Edition, MIT Press, 2009, 9780262033848,
[2] Gibbons, A.: Algorithmic Graph Theory, Cambridge University Press, 1985, 9780521288811,
[3] Gross, J. L.  Yellen, J.  Zhang, P.: Handbook of Graph Theory, 2nd Edition (Discrete Mathematics and Its Applications), Chapman and Hall/CRC, 2013, 9781439880180,
 Note:
 Further information:
 https://courses.fit.cvut.cz/BIEAG1/
 Timetable for winter semester 2019/2020:

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
Mon Tue Fri Thu Fri  Timetable for summer semester 2019/2020:
 Timetable is not available yet
 The course is a part of the following study plans:

 Bc. Branch Security and Information Technology, Presented in English, Version 2015 to 2020 (compulsory course in the program)
 Bc. Branch WSI, Specialization Software Engineering, Presented in English, Version 20152020 (compulsory course in the program)
 Bc. Branch Computer Science, Presented in English, Version 2015 to 2020 (compulsory course in the program)