| INFB Algorithms and Data Structures | Course | INF | |
|---|---|---|---|
| Lecturers : |
Prof. Dr. Baltasar Trancón Widemann
eMail
Prof. Dr. Tino Schonert eMail Benedikt Michaelis eMail |
Term | 1 |
| Course Classification : | Bachelor Informatik | CH | 4 |
| Language : | Deutsch/Englisch | Type | VÜ |
| Type of examination : | PL | Credits | 5 |
| Method of evaluation : | written examination 120 min | ||
| Requirements : | |||
| Cross References : | |||
| Previous knowledges : | |||
| Aids and special features : | Mode of Assessment: additional assessments during the semester may be included in the final grading. | ||
| Teaching aims : | The students know standard algorithms for typical problems from: searching, sorting, string matching, recursion, trees and graphs. They are able to assess and evaluate the performance of algorithms. The know the data structures list, array, chained list, stack, queue, tree, graph. The students learn the importance of mathematics for computer science by means of concrete applications. They learn the necessary mathematical tools in concrete problems of basic computer science and are able to apply them. | ||
| Contents : | Algorithms: | ||
| Literature : | Cormen T.H., Leiserson C.E., Rivest R.L., Stein C.: Introduction to Algorithms, Third Edition., MIT Press, McGraw-Hill, 2009 Sedgewick R.: Algorithmen. (2. Aufl.), Addison Wesley 2003 Aho, A. V., Ulman, J. D.: Data Structures and Algorithms 1983 | ||