| INFB Algorithms and Data Structures | Course | INF | |
|---|---|---|---|
| Lecturers : |
Prof. Dr. rer. nat. Reiner Creutzburg eMail | Homepage |
Term | 1 |
| Course Classification : | Informatics Bachelor | CH | 4 |
| Language : | Deutsch | Type | L E |
| Type of examination : | PL | Credits | 5 |
| Method of evaluation : | written examination 120 min | ||
| Requirements : | |||
| Cross References : | |||
| Previous knowledges : | Abitur, concurrent attendance of 1st semester courses | ||
| Aids and special features : | Pass at interim tests and course examination Graded: yes Overall grade is the course examination grade. | ||
| Teaching aims : | Students will know and be able to use standard algorithms for typical problems in the areas of searches, sorting, pattern recognition, recursion, trees and graphs. They will learn how to apply, construct and implement algorithms. They will be able to estimate and judge algorithm performance. The will be versed in the following data structures: lists, arrays, chained lists, stacks, queues, trees and graphs. | ||
| Contents : | Algorithms: | ||
| Literature : | R. Güting, St. Dieker: Algorithmen und Datenstrukturen (2. Auflage). Teubner 2003 Th. Ottmann, P. Widmayer: Algorithmen und Datenstrukturen. Spektrum Akademischer Verlag 1996 T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein: «Introduction to Algorithms, Second Edition», MIT Press, McGraw-Hill, 2001 R. Sedgewick: «Algorithmen» (2. Auflage), Addison-Wesley 2003 | ||