Informatics 2
PIB-INF2
P221-0025
pi2
3
V
1
U
5
2
yes
German
Written exam
PIB-INF2
Applied Informatics
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.
PIB-INF1
Informatics 1
PIB-MA1
Mathematics 1
PIB-PA
Project work
PIB-PRA
Work Experience Phase
PIB-TI
Theoretical Informatics
PIB-WA
Scientific Work
PIB-WEB
Principles of Web Development
Prof. Dr. Klaus Berberich
kbe
Prof. Dr. Klaus Berberich
kbe
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.
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
Slides, theoretical exercises.
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
SS 2024
SS 2023
SS 2022
SS 2021
SS 2020
SS 2019
SS 2018
Fri Mar 29 05:59:40 CET 2024, CKEY=pi2, BKEY=pi2, CID=[?], LANGUAGE=en, DATE=29.03.2024