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...