The implementation of abstract data types (ADTs) is a project Alex and I started some time ago using Java. We created our own implementations of the Java classes BinTree.java, DynArray.java, Queue.java and Stack.java with which we aim to provide uniform implementations of ADTs specifically tailored for the Abitur Niedersachsen Informatik curriculum in Germany.

Motivation

During class, we noticed a significant gap in the availability of standardized resources for the abstract data types required by the Abitur Niedersachsen Informatik. After exploring some options, we found that there wasn’t really a standardized implementation that we could use reliably. So we decided on creating our own.

Project Features

In addition to the core implementations of these ADTs, we included a premade BluJ project. This project simplifies the process of creating projects in a school environment, allowing students to focus more on learning and less on setup.

You can explore the project and contribute to our ongoing efforts on GitHub: ADT-Implementierungen.