markushuebenthal.de music | code

MandelbrotThe Mandelbrot sequence deals with the tendency of complex numbers to reach infinity. Thereby each number z_i is defined as z_i-1² + c.
The application creates a visual representation of the behaviour of the sequence for each number the view's range contains. You can zoom in by drawing a rectangle with the mouse and pushing the start button.Requires: C# / .net v2.0

Game Of LifeConway's Game Of Life is a simple and popular implementation of a two dimensional cellular automaton. See wikipedia for further details and rules.
The application provides loading and saving patterns in XML format.Requires: C# / .net v2.0

Bezier CurveThe Bezier algorithm creates curves by interpolation of a number of points.
The application provides a create mode, where new points may be added by mouseclick. In edit mode existing points may be relocated by drag and drop. At last in delete mode points may be erased by mouseclick.
The curve's construction can be regarded by activating construction points an manipulating the parameter t.Requires: C# / .net v2.0

Dining PhilosophersThe problem of the dining Philosophers is a classical multithreading exercise. Multiple clients want to use common ressources without disturbing each other.
The application gives a visualiation of the monitor principle. Each philosopher passes several stages, each represented by a color:

• Gray = Absence
• Green = Thinking
• Yellow = Hungry
• Red = Eating.

By thinking a philosopher gets hungry. In order to eat he is forced to wait until the forks on his left and right are both vacant.Requires: C# / .net v2.0

Fruchterman Reingold AlgorithmThe Algorith of Fruchterman & Reingold arranges the nodes of a graph so that the edges of the graph no longer cross each other and the eye gets a better overview on the graph.
The application provides drag and drop of the nodes per mouse to stress the algorithm.Requires: C# / .net v2.0

Dijkstra AlgorithmThe Algorithm of Dijkstra determines the shortest path between two nodes within a graph. It is used for example in the context of navigation systems or navigation web-applications.
On the application's form you see a matrix at the top and some nodes at the bottom. The matrix contains the connections between the nodes. It should be read with node indices in x-direction as start, in y-direction as end. Thereby -1 represents infinity so that two nodes connected with -1 from start to end are NOT connected.
Now, two nodes may get connected by inserting a distance representing value into the matrix at postition [start, end] and pushing the Apply button.
A route gets created by selecting start and end in the comboboxes at the bottom right.Requires: C# / .net v2.0

Fibonacci HeapThe Fibonacci Heap is a very efficient implementation of a priority queue. It is optimised for several operations like extractMinimum.Requires: C# / .net v2.0

Sieve of EratosthenesThe Sieve of Eratosthenes is a simple algorithm to find all prime numbers up to a certain integer. See wikipedia for further details.Requires: C# / .net v2.0

Complex Number ClassImplementation of a Class that represents a Complex Number in C++.Requires: C++

String ClassImplementation of a Class that represents a String in C++.Requires: C++

QT Basics: EditorAn Editor providing simplest functionality using the Qt class library.Requires: C++ / Qt v4.2.3

Division in ASMDivision implemented in Assembler.Requires: 80-086 Simulator

Sort in ASMSimple implementation of the Bubblesort algorithm in Assembler.Requires: 80-086 Simulator

Lexical Compare in ASMLexical Compare implemented in Assembler.Requires: 80-086 Simulator

Dice Game in ASMDice Game implemented in Assembler.
Don't try this at home!Requires: IDE for Siemens C-167

Black Jack Game in ASMBlack Jack Game implemented in Assembler.
Don't try this at home!Requires: IDE for Siemens C-167

LCD Driver for C-167LCD Driver for HD 20200 LCD on an C-167 platform implemented in embedded C.
Don't try this at home!Requires: IDE for Siemens C-167