htw saar Piktogramm
Back to Main Page Choose Module Version:


Graph Theory

Module name (EN):
Name of module in study programme. It should be precise and clear.
Graph Theory
Degree programme:
Study Programme with validity of corresponding study regulations containing this module.
Applied Informatics, Bachelor, ASPO 01.10.2011
Module code: PIB220
The exam administration creates a SAP-Submodule-No for every exam type in every module. The SAP-Submodule-No is equal for the same module in different study programs.
Hours per semester week / Teaching method:
The count of hours per week is a combination of lecture (V for German Vorlesung), exercise (U for Übung), practice (P) oder project (PA). For example a course of the form 2V+2U has 2 hours of lecture and 2 hours of exercise per week.
3V+1U (4 hours per week)
ECTS credits:
European Credit Transfer System. Points for successful completion of a course. Each ECTS point represents a workload of 30 hours.
Semester: 2
Mandatory course: yes
Language of instruction:
Written examination

[updated 08.05.2008]
Applicability / Curricular relevance:
All study programs (with year of the version of study regulations) containing the course.

PIB220 (P221-0022) Applied Informatics, Bachelor, ASPO 01.10.2011 , semester 2, mandatory course
Workload of student for successfully completing the course. Each ECTS credit represents 30 working hours. These are the combined effort of face-to-face time, post-processing the subject of the lecture, exercises and preparation for the exam.

The total workload is distributed on the semester (01.04.-30.09. during the summer term, 01.10.-31.03. during the winter term).
60 class hours (= 45 clock hours) over a 15-week period.
The total student study time is 150 hours (equivalent to 5 ECTS credits).
There are therefore 105 hours available for class preparation and follow-up work and exam preparation.
Recommended prerequisites (modules):
PIB115 Fundamentals of Informatics
PIB125 Mathematics 1

[updated 14.10.2010]
Recommended as prerequisite for:
PIB330 Databases
PIB420 Computer Networks
PIB440 Project Work

[updated 26.04.2021]
Module coordinator:
Prof. Dr. Rainer Lenz
Prof. Dr. Klaus Huckert
Prof. Dr. Rainer Lenz
Dipl.-Math. Wolfgang Braun (exercise)

[updated 09.09.2015]
Learning outcomes:
-        Understanding and using data structures
-        Analysing and using algorithms
-        Introduction to modelling problems using graph theory
-        Understanding implementation issues

[updated 08.05.2008]
Module content:
-        Examples of problems that can be addressed by graph theory
-        Basic terminology and definitions
-        Graphs and computers
-        Graph algorithms (acyclicity, reachability, connectedness, frames, shortest paths)
-        Selected problems in graph theory and their implementation in Java
-        Trees (binary trees, B-trees)Applications of trees (file management, heap sorting, Huffman code, Polish notations)

[updated 08.05.2008]
Teaching methods/Media:
PowerPoint slides, lecture notes

[updated 08.05.2008]
Recommended or required reading:
SOLYMOSI A., GRUDE U.:  Grundkurs Algorithmen und Datenstrukturen, Vieweg, 2001
LIPSCHUTZ S.:  Datenstrukturen, Mc Graw-Hill, 1987
TURAU V.:  Algorithmische Graphentheorie, Addison Wesley, 1996

[updated 08.05.2008]
Module offered in:
SS 2017, SS 2016, SS 2015, SS 2014, SS 2013, ...
[Sat Dec 10 05:34:51 CET 2022, CKEY=pgraph, BKEY=pi, CID=PIB220, LANGUAGE=en, DATE=10.12.2022]