|
|
Miscellaneous Stuff
|
Resilient Asynchronous Distributed Consensus (Presentation) [download]
Describes Michael Ben-Or's randomized solution to Asynchronous Fault-Tolerant Distributed Consensus. The proof follows [AT98] (citation in presentation).
A trivial presentation explaining a weak and old result in Theoretical Distributed Computing (Paraphrasing the Great CPR). Be your own judge, and in the process
maybe learn something new.
To view you will need a pdf viewer like xpdf /
ghostview /
acrobat reader
|
|
Elevator System (written in Java) [download]
Did this for a class that I didn't take (Object Oriented Software Design, Spring 2005). There
are some design issues that need to be wrinkled out of this program, but it was good time-pass.
The source code is in the src folder of the .jar file. You will need the
JRE ver. 1.4.0 or higher to
see this running.
To run, type the following on the command-line:
java -classpath ElevatorSystem.jar ElevatorSystem
To extract the class / source files from the .jar archive, you may need WinRar
|
|
AVL Tree (written in Java) [download]
A graphical demo of the AVL balanced binary search tree data structure. The underlying data structure is
programmed to be independant of the graphical demo. AVLTree.class can be used for any data.
The source code is in the src folder of the .jar file. You will need the
JRE ver. 1.4.0 or higher to
see this running.
To run, type the following on the command-line:
java -classpath avltree.jar AVLDemo
To extract the class / source files from the .jar archive, you may need WinRar
|
|
Red Black Tree (written in Java) [download]
A graphical demo of the RedBlack balanced binary search tree data structure. The underlying data structure is
programmed to be independant of the graphical demo. RedBlackTree.class can be used for any
data. The source code is in the src folder of the .jar file. You will need the
JRE ver. 1.4.0 or higher to
see this running.
To run, type the following on the command-line:
java -classpath rbtree.jar RedBlackDemo
To extract the class / source files from the .jar archive, you may need WinRar
|
|
Binomial Heap (written in Java) [download]
A graphical demo of the Binomial Heap data structure (used as a priority queue). The underlying data structure
is programmed to be independant of the graphical demo. BinomialHeap.class can be used for
any data. The source code is in the src folder of the .jar file. You will need the
JRE ver. 1.4.0 or higher to
see this running.
To run, type the following on the command-line:
java -classpath binheap.jar BinomialDemo
To extract the class / source files from the .jar archive, you may need WinRar
|
|
N Queens (written in C++) [download]
Did this a looong time ago. This program is the simple backtracking solution to the n-queens problem that
finds all solutions. During its time this program broke the speed record in college.
You'll need a C++ compiler to compile and run the code.
|
|
Arbitrarily Long Integer Arithmetic (written in C++) [download]
An integer arithmetic API for arbitrarily long integers. The algorithms used are not the most
efficient, but all of the functionality is there. Think of this as a framework.
You'll need a C++ compiler to compile and run the code.
|
|
|
|
