Main content

This entry is from Winter semester 2016/17 and might be obsolete. No current equivalent could be found.

CS 621 — Abstract Data Types - Universal Algebra
(dt. Abstrakte Datentypen – Universelle Algebra)

Level, degree of commitment Specialization module, compulsory elective module
Forms of teaching and learning,
workload		 Lecture (4 SWS), recitation class (2 SWS),
270 hours (90 h attendance, 180 h private study)
Credit points,
formal requirements		 9 CP
Course requirement(s): Oral or written examination
Examination type: Successful completion of at least 50 percent of the points from the weekly exercises as well as at least 2 presentations of the tasks.
Language,
Grading		 German,
The grading is done with 0 to 15 points according to the examination regulations for the degree program M.Sc. Computer Science.
Duration,
frequency		 One semester,
Alle 3-4 Semester
Person in charge of the module's outline Prof. Dr. H.-Peter Gumm

Contents

Mathematical theory of abstract data types:

  • Types, algebras, morphisms.
  • Substructures, congruences, products, images
  • terms, equations, equation calculus
  • Initial and free objects
  • Birkhoff's theorem
  • Maltsev Terms
  • Multi-sorted algebras
  • Hidden sorts, behavioral specifications

Qualification Goals

Students learn the concepts of data structures:

  • Abstract data types, morphisms, derived structures,
  • Freedom, Initiality and Induction,
  • Specifications by equations and implications,
  • Multi-sorted systems,
  • Hidden Specifications.

Furthermore

  • training of scientific skills (recognition, formulation, problem solving, abstraction),
  • oral communication skills in the lab sessions by practicing free speech and discussion in front of an audience.

Prerequisites

Translation is missing. Here is the German original:

Keine. Empfohlen werden die Kompetenzen, die in den Modulen Logik sowie Algorithmen und Datenstrukturen vermittelt werden.


Applicability

Module imported from M.Sc. Computer Science.

It can be attended at FB12 in study program(s)

  • B.Sc. Computer Science
  • M.Sc. Computer Science
  • M.Sc. Mathematics
  • LAaG Computer Science

When studying B.Sc. Computer Science, this module can be attended in the study area Compulsory Elective Modules in Computer Science.

Die Wahlmöglichkeit des Moduls ist dadurch beschränkt, dass es der Theoretischen Computer Science zugeordnet ist.


Recommended Reading

  • Th. Ihringer: Allgemeine Algebra. Mit einem Anhang über Universelle Coalgebra von H.P.Gumm, Heldermann Verlag, 2003.
  • J. Martin: Data Types and Data Structures. Prentice Hall; 1986.
  • B. Liskov, S. Zilles: Programming with abstract data types. SIGPLAN; J. A. Goguen, J. W. Thatcher, E. W. Wagner: An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types.



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.