Graphs: models, algorithms and processes WM-I-Z-S1-E5-FA1

https://e.uksw.edu.pl

The aim of this course is to provide students some knowledge about algorithmic aspects of graph theory. They will learn how to generate graphs, how to design and implement algorithms operating on them and how to perform relevant measures. A graph library (GraphStream) is used to facilitate the implementation of algorithms in java.

(in Polish) Dyscyplina naukowa, do której odnoszą się efekty uczenia się

information and communication technology

(in Polish) E-Learning

Term 2023/24_Z:

(in Polish) E-Learning

Term 2024/25_Z:

(in Polish) E-Learning

Term 2022/23_Z:

(in Polish) E-Learning (pełny kurs) z podziałem na grupy

(in Polish) Grupa przedmiotów ogólnouczenianych

(in Polish) nie dotyczy

(in Polish) Opis nakładu pracy studenta w ECTS

LECTURE: Estimated student workload: - participation in classes: 20h - consultation with lecturer: 10h - independent reading: 15h - preparation of the project: 30h 75h in total corresponding to 3 ECTS LABORATORY: Estimated student workload: - participation in classes: 20h - consultation with lecturer: 10h - homework: 25h - preparation of the project: 20h 75h in total corresponding to 3 ECTS

Subject level

intermediate

Learning outcome code/codes

(in Polish) WYKLAD I1_W16, I1_U18 LABORATORUM I1_W16, I1_U18

Type of subject

Term 2023/24_Z:

optional with unlimited choices

Term 2024/25_Z:

obligatory

Preliminary Requirements

java programming would be a plus

Course coordinators

Term 2023/24_Z:

Dorota Dąbrowska
Frederic Guinand

Term 2024/25_Z:

Frederic Guinand

Term 2022/23_Z:

Frederic Guinand

Learning outcomes

LECTURE
Student:
W1: knows graph vocabulary, main graph families with their characteristics,
W2: knows fundamental graph algorithms,
W3: knows main problems related to graphs,
W4: knows what random walks are and some basic properties,
U1: can design and implement algorithms operating on graphs.

LABORATORIES
Student:
U1: can use a java library for creating graphs.
U2: can model a problem as a graph.
U3: can design and implement specific algorithms for graphs.
W1: knows processes for generating graphs.

Assessment criteria

For all learning outcomes, the following assessment criteria are adopted for all forms of verification:
grade 5: fully achieved (no obvious shortcomings),
grade 4.5: achieved almost fully and criteria for awarding a higher grade are not met,
grade 4: largely achieved and the criteria for a higher grade are not met,
grade 3.5: largely achieved - with a clear majority of positives - and the criteria for granting a higher grade are not met,
grade 3: achieved for most of the cases covered by the verification and criteria for a higher grade are not met,
grade 2: not achieved for most of the cases covered by the verification.

Additional information

Additional information (registration calendar, class conductors, localization and schedules of classes), might be available in the USOSweb system:

Description of WM-I-Z-S1-E5-FA1 in USOSweb