MEDI Algorithms and Data Structures | Course | INF | |
---|---|---|---|
Lecturers : |
Prof. Dr. rer. nat. Reiner Creutzburg
eMail
Prof. Dr. Matthias Homeister eMail |
Term | 1 |
Course Classification : | Medizininformatik | CH | 4 |
Language : | Deutsch | Type | VÜ |
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 : | |||
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 : | Güting R., Dieker St.: Algorithmen und Datenstrukturen. (2. Aufl.), Teubner 2003 Ottmann Th., Widmayer P.: Algorithmen und Datenstrukturen. Spektrum Akademischer Verlag 1996 Cormen T.H., Leiserson C.E., Rivest R.L., Stein C.: Introduction to Algorithms, Second Edition., MIT Press, McGraw-Hill, 2001 Sedgewick R.: Algorithmen. (2. Aufl.), Addison Wesley 2003 |