23. 2. 2020  14:38 Roman, Romana

# Sylabus predmetu D1-ADM - Algorithms of discrete mathematics (FCE - 2019/2020 - post-graduate studies)

Informačný list          ECTS          Sylabus

Slovenčina          Angličtina

University: Slovak University of Technology in Bratislava
Faculty: Faculty of Civil Engineering
Course unit title: Algorithms of discrete mathematics
Mode of completion and Number of ECTS credits: Exam-PhD (5 credits)

Name of lecturer: prof. RNDr. Martin Knor, PhD. (examiner, instructor, lecturer) - slovak, english
prof. RNDr. Jozef Širáň, DrSc. (examiner, instructor, lecturer, person responsible for course, tutor) - slovak, english

Learning outcomes of the course unit:
Students will learn the algorithms of discrete mathematics and they will be able to recognize the difficulty of practical tasks.

Prerequisites and co-requisites: none

Course contents:
- Algorithms and complexity, Integer Knapsack problem and input data representation.
- Data input for graphs, depth – first and breadth – first search. Spanning trees and cycles in graphs.
- Identification of blocks in graphs, planarity testing.
- Extremal problems in graph theory and their algorithmic complexity.
- A fast algorithm for finding a maximum flow in a network .
- Maximal spanning tree problems and matroids. Matching in graphs and intersections of matroids.
- NP-completenes and polynomiality.

Basic:
 KNOR, M. -- NIEPEL, L. Kombinatorika a teória grafov 2. Bratislava: Univerzita Komenského, 2000. 90 p. PLESNÍK, J. Grafové algoritmy. Bratislava: Slovenská akadémia vied, 1983. 300 p.

Planned learning activities and teaching methods: Type: seminar
Scope and method: 0/2 - full method, 26 hours per semester.

Assesment methods and criteria: exam

Language of instruction: Slovak, English

Work placement(s): There is no compulsory work placement in the course unit.

Last modification made by Ing. Peter Korčák on 10/31/2017.

 Typ výstupu: PDF výstup (PDF)Dokument RTF (RTF)XML formát pre IL (XML IL)