htw saar Piktogramm
Back to Main Page

Choose Module Version:


Informatics 2

Module name (EN): Informatics 2
Degree programme: Applied Informatics, Bachelor, ASPO 01.10.2017
Module code: PIB-INF2
SAP-Submodule-No.: P221-0025
Hours per semester week / Teaching method: 3V+1U (4 hours per week)
ECTS credits: 5
Semester: 2
Mandatory course: yes
Language of instruction:
Written exam

[updated 24.02.2018]
Applicability / Curricular relevance:
PIB-INF2 (P221-0025) Applied Informatics, Bachelor, ASPO 01.10.2017, semester 2, mandatory course
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):
PIB-INF1 Informatics 1
PIB-MA1 Mathematics 1

[updated 01.04.2020]
Recommended as prerequisite for:
PIB-PA Project work
PIB-PRA Work Experience Phase
PIB-TI Theoretical Informatics
PIB-WA Scientific Work
PIB-WEB Principles of Web Development

[updated 26.04.2021]
Module coordinator:
Prof. Dr. Klaus Berberich
Lecturer: Prof. Dr. Klaus Berberich

[updated 28.09.2016]
Learning outcomes:
After successfully completing this module, students will be familiar with basic problems on undirected and directed graphs, as well as character strings. They will be able to define and differentiate basic terms from the graph theory. Students will be aware of the relevance of graph problems (e. g. topological sorting) for solving practical tasks (e. g. scheduling). They will be able to use efficient algorithms for solving basic problems on graphs and strings. For their description and analysis, students use the skills acquired in the “Informatics 1” module. Students will also be capable of formulating a given practical task as a problem and of solving it by applying the algorithms they have learned.

[updated 30.07.2021]
Module content:
1. Introduction
2. Searching and sorting
2.1 Breadth-first search
2.2 Depth-first search
2.3 Topological sorting
3. Shortest paths
3.1 Bellman-Ford algorithm
3.2 Dijkstra’s algorithm
3.3 Floyd-Warshall algorithm
4. Components and spanning trees
4.1 Determining connected components
4.2 Kruskal’s algorithm
4.3 Prim’s algorithm
5. Algorithms for character strings
5.1 Pattern matching
5.2 Longest common strings
5.3 Levenshtein distance

[updated 30.07.2021]
Teaching methods/Media:
Slides, theoretical exercises.

[updated 24.02.2018]
Recommended or required reading:
Cormen Thomas H., Leiserson Charles E., Rivest Ronald L. und Stein Clifford: Algorithmen - Eine Einführung,
Oldenbourg , 2013
Gunther Saake und Kai-Uwe Sattler: Algorithmen und Datenstrukturen: Eine Einführung mit Java,
dpunkt.verlag, 2013
Sedgewick Robert und Wayne Kevin: Algorithmen und Datenstrukturen,
Pearson Studium, 2014

[updated 30.07.2021]
Module offered in:
SS 2022, SS 2021, SS 2020, SS 2019, SS 2018
[Sat Sep 24 23:43:18 CEST 2022, CKEY=pi2, BKEY=pi2, CID=PIB-INF2, LANGUAGE=en, DATE=24.09.2022]