Selected graph algorithms Field of study: Computer Science
Programme code: W4-N2IN19.2021

Module name: Selected graph algorithms
Module code: W4-IN-N2-20-F-WAG
Programme code: W4-N2IN19.2021
Semester:
  • winter semester 2023/2024
  • summer semester 2022/2023
  • winter semester 2022/2023
  • summer semester 2021/2022
Language of instruction: Polish
Form of verification: course work
ECTS credits: 4
Description:
The aim of the course is to familiarize students with the basic knowledge of graph theory and selected graph algorithms. Practical problems are discussed for which graph representation can be applied and one can solve them by means of appropriate graph algorithms.
Prerequisites:
(no information given)
Key reading:
1. R.J.Wilson: Introduction to Graph Theory, Longman 1998 2. T.H.Cormen, C.E.Leiserson, R.L.Rivest: Introduction to Algorithms, Mit Press 3. R.Diestel: Graph theory, Springer, 2000
Learning outcome of the module Codes of the learning outcomes of the programme to which the learning outcome of the module is related [level of competence: scale 1-5]
He is familiar with the concept, features and types of graphs, including trees. [M_001]
 K_W01 [1/5] K_W04 [1/5] K_W09 [1/5]
Understands the functioning of graph algorithms and trees used to solve selected practical problems. [M_002]
 K_W02 [1/5] K_W04 [1/5] K_W09 [1/5]
Can apply an appropriate algorithm to solve a given problem. [M_003]
 K_U01 [1/5] K_U08 [1/5]
The student is able to construct a solution to a given problem according to a specific algorithm and program it in the chosen programming language. [M_004]
 K_U01 [1/5] K_U02 [1/5] K_U03 [1/5]
The student can work in a project-programming team. [M_005]
 K_K01 [1/5] K_K03 [1/5] K_K05 [1/5]
He knows how to implement graphs, including trees, using tables and pointers. [M_006]
 K_W01 [1/5] K_W09 [1/5]
The student is able to implement graphs and trees using data structures available in particular programming languages. [M_007]
 K_U03 [1/5] K_U04 [1/5] K_U09 [1/5]
Type Description Codes of the learning outcomes of the module to which assessment is related
Evaluation of presentation and computer implementation [W_001]
Students develop their own software, the specification of which is given by the teacher, and make presentations on a chosen topic from the given list.
 M_001 M_002 M_003 M_004 M_005 M_006 M_007
Evaluation work [W_002]
Written mid-term test (including a test performed on a computer during classes)
 M_001 M_002 M_003 M_006 M_007
End-term test [W_003]
Students answer test questions and describe problems in answering open questions
 M_001 M_002 M_003 M_004 M_006 M_007
Form of teaching Student's own work Assessment of the learning outcomes
Type Description (including teaching methods) Number of hours Description Number of hours
lecture [Z_001]
Giving the educational content in verbal form with the use of content visualization. Focusing on conceptually difficult material and indicating sources. Illustrating the content using examples.
 15
Getting to know the topic of the lecture using the existing packages of methods: manuals, scripts, websites, etc.
 30 End-term test [W_003]
laboratory classes [Z_002]
Detailed training of students to solve tasks with reference to the methodology of proceeding, showing the sequence of activities performed. Designing solutions and their computer implementation. The students' presentation of their solutions.
 30
Solving tasks from particular topics together with analysis of already existing solutions - in materials and on websites. Preparing issues to be discussed or preparing for catching up.
 45 Evaluation of presentation and computer implementation [W_001] Evaluation work [W_002]
Attachments
Module description (PDF)
Information concerning module syllabuses might be changed during studies.
Syllabuses (USOSweb)
Semester Module Language of instruction
(no information given)