|
|
Module code: KI210 |
|
3V+1U (4 hours per week) |
5 |
Semester: 2 |
Mandatory course: yes |
Language of instruction:
German |
Assessment:
Written exam
[updated 20.03.2007]
|
KI210 (P222-0017) Computer Science and Communication Systems, Bachelor, ASPO 01.10.2014
, 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):
KI100 Programming 1 KI110 Informatics 1 KI160 Mathematics 1
[updated 11.10.2017]
|
Recommended as prerequisite for:
KI300 Software Engineering 1 KI320 Computer Networks KI420 Operating Systems KI579 Simulation of Discrete Systems with AnyLogic KI590 Work Experience Phase KI675 Compiler Construction KI691
[updated 22.01.2018]
|
Module coordinator:
Prof. Dr. Damian Weber |
Lecturer: Prof. Dr. Damian Weber Dipl.-Inform. Marion Bohr Sarah Theobald, M.Sc.
[updated 11.10.2017]
|
Learning outcomes:
After completing this course, students will be able to use algorithms to solve graph problems. The solutions will involve the knowledge and methods learned in the module “Informatics 1”. Students will acquire the skills necessary to analyse algorithms. They will also learn how to represent a real practical problem as graph problem and thus generate a solution to the original problem from the solution to the underlying graph problem. In addition, the course will provide an intuitive introduction to important complexity classes as the basis for understanding the algorithmic solvability of problems. By analysing the resource consumption of algorithms, students will be able to decide whether there is an efficient, exact or heuristic method for solving a specific problem.
[updated 13.03.2007]
|
Module content:
1. Graphs 1.1......Data structures 1.2......Algorithms 1.3......Automata theory and formal languages 2. Problem-solving techniques 2.1......Recursion 2.2......Dynamic programming 2.3......Greedy algorithms 3. Computability and complexity theory
[updated 06.05.2007]
|
Recommended or required reading:
CORMEN T., LEISERSON, C., RIVEST R., STEIN, C.: Introduction to Algorithms, Second Edition.
[updated 13.03.2007]
|
Module offered in:
SS 2017,
SS 2016,
SS 2015,
SS 2014,
SS 2013,
...
|