Graphs: Models, Algorithms and Processes WM-I-S1-GMAP

LECTURE

Student:
W1 - describes graph terminology and characterizes major graph families and their properties (I1_W14),
W2 - explains the principles and operation of fundamental graph algorithms (I1_W14),
W3 - characterizes major graph-theoretical problems and their applications (I1_W14),
W4 - explains the concept of random walks and describes their basic properties (I1_W14),

LABORATORIES

Student:
U1 - uses a Java library for creating and processing graph structures (I1_U18),
U2 - models computational problems using graph representations (I1_U18),
U3 - designs and implements graph algorithms to solve selected problems (I1_U18).

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 (registration calendar, class conductors, localization and schedules of classes), might be available in the USOSweb system:

• Description of WM-I-S1-GMAP in USOSweb