Main content

This entry is from Winter semester 2016/17 and might be obsolete. You can find a current equivalent here.

CS 210L — Practical Informatics II: Data Structures and Algorithms for Pre-Service-Teachers
(dt. Algorithmen und Datenstrukturen für Lehramt an Gymnasien-Studierende)

Level, degree of commitment Basic module, required module
Forms of teaching and learning,
Lecture (4 SWS), recitation class (2 SWS),
270 hours (90 h attendance, preparation and follow-up inklusive Studienleistungen 150 h, Vorbereitung and Ablegen von Prüfungsleistungen 30 h)
Credit points,
formal requirements
9 CP
Course requirement(s): Written examination (120 min.)
Examination type: 1) Exercises and at least 1-3 presentations of individual exercises 2) Presentation, approx. 30 min. in the seminar on school-related topics of the lecture with regard to the implementation in the upper secondary school. The successful completion of at least 40% of the exercises is a prerequisite for admission to the module examination.
The grading is done with 0 to 15 points according to the examination regulations for the degree program LAaG Computer Science. In the event of failure, a total of 4 attempts are available for the examination.
One semester,
each summer semester
Person in charge of the module's outline N.N.


  • Analysis of algorithms and data structures: design principles, complexity, asymptotic analysis
  • Elementary data structures: lists, stacks, queues, sets, trees, maps, strings, graphs
  • Elementary algorithms: searching, sorting, insertion, removal, transformation, and traversal
  • Implementation variants: balanced search trees, hash sets, Huffman codes
  • Polymorphic (generic) data structures: containers and iterators
  • Advanced programming techniques, e.g. thread programming, Design Patterns
  • Didactic preparation of the material for school lessons

Qualification Goals


  • Mastery of scientific working methods (recognition, formulation, problem solving, abstraction),
  • oral communication skills, ability to speak freely in front of an audience and during a discussion,
  • Didactic preparation of teaching material.

Qualification goals:

  • Design of algorithms and data structures,
  • Analysis and cost estimation,
  • Abstraction techniques,
  • Deepening of programming knowledge,
  • Knowledge in analysis, design and implementation of software,
  • Classification of different concepts and assessment of their possible use in school teaching.


Translation is missing. Here is the German original:

Keine. Empfohlen werden die Kompetenzen, die im Modul Objektorientierte Programmierung (CS 110) vermittelt werden


The module can be attended at FB12 in study program(s)

  • LAaG Computer Science

When studying LAaG Computer Science, this module must be completed in the study area Basic Modules.

Recommended Reading

(not specified)

Please note:

This page describes a module according to the latest valid module guide in Winter semester 2016/17. Most rules valid for a module are not covered by the examination regulations and can therefore be updated on a semesterly basis. The following versions are available in the online module guide:

The module guide contains all modules, independent of the current event offer. Please compare the current course catalogue in Marvin.

The information in this online module guide was created automatically. Legally binding is only the information in the examination regulations (Prüfungsordnung). If you notice any discrepancies or errors, we would be grateful for any advice.