A course is the basic teaching unit, it's design as a medium for a student to acquire comprehensive knowledge and skills indispensable in the given field. A course guarantor is responsible for the factual content of the course.
For each course, there is a department responsible for the course organisation. A person responsible for timetabling for a given department sets a time schedule of teaching and for each class, s/he assigns an instructor and/or an examiner.
Expected time consumption of the course is expressed by a course attribute extent of teaching. For example, extent = 2 +2 indicates two teaching hours of lectures and two teaching hours of seminar (lab) per week.
At the end of each semester, the course instructor has to evaluate the extent to which a student has acquired the expected knowledge and skills. The type of this evaluation is indicated by the attribute completion. So, a course can be completed by just an assessment ('pouze zápočet'), by a graded assessment ('klasifikovaný zápočet'), or by just an examination ('pouze zkouška') or by an assessment and examination ('zápočet a zkouška') .
The difficulty of a given course is evaluated by the amount of ECTS credits.
The course is in session (cf. teaching is going on) during a semester. Each course is offered either in the winter ('zimní') or summer ('letní') semester of an academic year. Exceptionally, a course might be offered in both semesters.
The subject matter of a course is described in various texts.
BIK-AG1 Algorithms and Graphs 1 Extent of teaching: 14KP+4KC Instructor: Completion: Z,ZK Department: 18101 Credits: 6 Semester: Z Annotation:
This course is presented in Czech.
Lecture syllabus:
1. Grafové modely, neorientované grafy, izomorfismus, sousednost. 2. Sledy, tahy, cesty, souvislost, orientované grafy. 3. Silná souvislost, acyklické grafy, reprezentace grafů, procházení do šířky. 4. Procházení do hloubky, topologické uspořádání, silně souvislé komponenty. 5. Stromy, kostry, kružnice, minimální kostry. 6. Algoritmy řazení. 7. Rozptylovací tabulky (rozptylovací funkce, synonyma, řešení kolizí, různé implementace a jejich složitosti). 8. Stromy jako datové struktury, základní vlastnosti, binární haldy, prioritní fronta, HeapSort. 9. Rekurzivní algoritmy a metoda Rozděl-a-panuj. 10. Dynamické programování. 11. Algoritmy hledání nejkratších cest 1-n v grafech. 12. Toky v sítích, určení maximálního toku v síti. 13. Vyhledávání a vyhledávací stromy, vyvažování, AVL stromy, trie. Seminar syllabus:
Literature:
[1] Cormen, T. H. - Leiserson, C. E. - Rivest, R. L. - Stein, C.: Introduction to Algorithms, 3rd Edition, MIT Press, 2009, 978-0262033848, Requirements:
Informace o předmětu a výukové materiály naleznete na https://courses.fit.cvut.cz/BIK-AG1/ The course is also part of the following Study plans:
Study Plan Study Branch/Specialization Role Recommended semester BIK-SPOL.2015 Unspecified Branch/Specialisation of Study PP 3 BIK-BIT.2020 Computer Security and Information technology PP 3 BIK-WSI-SI.2015 Web and Software Engineering PP 3 BIK-BIT.2015 Computer Security and Information technology PP 3
Page updated 20. 4. 2024, semester: L/2023-4, L/2020-1, L/2022-3, L/2021-2, Z/2019-20, Z/2022-3, Z/2020-1, Z/2023-4, L/2019-20, Z/2021-2, Z/2024-5, Send comments to the content presented here to Administrator of study plans Design and implementation: J. Novák, I. Halaška