Algorithms and Data Structures

Module Code
CS1017
Module Coordinators
Thomas Letschert
Teachers
Thomas Letschert
Short Description
Sorting and searching algorithms and their underlying abstract data structures.
Learning Objectives

Students are acquainted with concepts of database management systems, they are capable to develop data models and they are proficient in the standard query language SQL.

Contents
Sorting and searching algorithms and their underlying abstract data structures:
  • Efficiency of Algorithms (time and space performance)
  • Abstract data types (ADTs): Stacks, queues, lists, trees, graphs, ADTs in frameworks.
  • Sorting: fundamental and more sophisticated algorithms.
  • Searching: symbol-tables, search-trees, skip-lists.
Duration in Semester
1
Instruction Language
German
Total Effort
6 CrP; an estimated 180 hours, of which approximately 90 are spent in class.
Weekly School Hours
6
Method of Instruction

Lecture 4 SWS, exercises 2 SWS

Requirements for the awarding of Credit Points

Examination prerequisite: 2 certified written exercises, Exmanation: Written exam

Evaluation Standard
according to examination regulations (§ 9)
Availability
Semesterly
References
  • A. Levitin The Design and Analysis of Algorithms Pearson
  • R. Sedgewick Algorithmen und Datenstrukturen Pearson