Stack

Class Kata „Stack“ Implement the abstract data type Stack. The stack is a first-in last-out data structure. Elements that are put on the stack are returned in reverse order. See the example below for details. The interface has to look like the following: public...

Circular Buffer

Class Kata “Circular Buffer” Write a class which implements a circular buffer. You can append new elements to a circular buffer at the end (Add()) like with a queue. And they can be extracted at the beginning (Take()), again like with a queue. But a circular buffer...

Priority Queue

Class Kata „Priority Queue“ Write a class that implements a queue that holds a priority for each element. Elements with a high priority are placed in front of elements with a lower priority. Elements with the same priority are ordered in the order they where inserted...

Ordered Jobs

Class Kata “Ordered Jobs” Develop a class which calculates a plan to execute jobs depending on each other [1]. Each job is represented by a single character, e.g. ‘c’ or ‘x’. If job ‘a’ depends on job ‘u’ to be finished first then that can be expressed as a=>u or...

Linked List

Class Kata „Linked List“ Implement the abstract data type list as a linked list. The class LinkedList has to implement the interface IList. A linked list consists of elements that have a value (called Item) and a reference to the next element in the list (called...

Box Plot

Class Kata “Box Plot” Develop a graphical control to show box plots [1]. A box plot visualizes a list of numbers. To quickly get an overview several values are displayed for each number: Minimum Lower quartile Median Upper quartile Maximum The minimum value of a list...