1. SylabUZ
2. Wydział Nauk Ścisłych i Przyrodniczych
3. semestr zimowy 2022/2023
4. Mathematics - pierwszego stopnia z tyt. licencjata
5. Discrete Mathematics 2

Wygeneruj PDF dla tej strony

Discrete Mathematics 2 - opis przedmiotu

Cel przedmiotu

Understanding advanced concepts of discrete mathematics from both theoretical and algorithmic perspectives.

Wymagania wstępne

Zapisz zmiany

Discrete Mathematics 1

Zakres tematyczny

Lecture/classes:

1. Selected graph classes: interval graphs, k-trees, chordal graphs, edge graphs, and their properties.
2. Various types of domination in graphs.
3. Directed graphs, definitions, and notations.
4. Strongly connected, transitive, and acyclic directed graphs, their properties.
5. Selected algorithms for directed graphs.
6. Definition of a matroid. Examples and basic properties.

 

Metody kształcenia

Lecture: conventional, conversational.

Classes: classical problem-solving method.

Efekty uczenia się i metody weryfikacji osiągania efektów uczenia się

Opis efektu	Symbole efektów	Metody weryfikacji	Forma zajęć

Warunki zaliczenia

Conditions for passing classes and lectures:

1. Checking students' level of preparedness and their activity during exercises.
2. A test with tasks of varying difficulty levels, allowing assessment of whether and to what extent a student has achieved the mentioned learning outcomes, mainly in terms of skills and competencies.
3. Conversation during the lecture to verify higher levels of learning outcomes in terms of knowledge and skills.
4. Exam. 

The final grade for the course consists of the exercise grade (50%) and the lecture grade (50%). The condition for passing the course is obtaining positive passing grades for both exercises and the lecture.

Literatura podstawowa

1. J. Bang-Jensen, G.Gutin, Digraphs, Theory and Algorithms, 2001.
2. A. Brandstadt, V.B. Le, J.P.Spinrad, Graph Classes: a survey, SIAM 2004
3. R. Distel, Graph Theory, Springer-Verlag, New York 1997
4. D. J. A. Welsh, Matroid theory, Academic Press, Inc., New York, 2010.

Literatura uzupełniająca

H. L. Bodlaender, A partial k-arboretum of graphs with bounded treewidth,Theoretical Computer Science 209 (1998) 1-45.

Uwagi

Zmodyfikowane przez dr hab. Elżbieta Sidorowicz, prof. UZ (ostatnia modyfikacja: 12-01-2024 18:36)