- Handout 0
**C++ Basic Guide, taken from the CS2005-E2000-Webpage**(June 5, 2000) - Handout 1
**Measuring the running time of a function**Note that the Java-Version is less accurate than the C/C++-Versions as Java can not access the C-getrusage()-function, which is necessary to separate user, system, and I/O-time from each other. The function getrusage() has time resolution of 4ms, which is often inadequate. The C-version uses gettimeofday() which gets musec reading (and allows seeing the inherent variability of execution times, even when the machine if fairly quiescent. - Handout 2
**Pointers in C++**- a program using different kinds of pointers.
- A handout trying to explain all combinations of ampersands, asterisks, and variable names.

- Handout 4
**Sorting routines source code**- A Java-Version of Heapsort (compile with javac HeapSort.java; run with java HeapSort) Source Code
- C code for efficient combination of quick-sort and insertion sort. Source Code

- Handout 5
**Comparing Different Sorting Algorithms---Ripped from CS2005-E2000 Webpage (and ultimately from Sun)** - Handout 6
**An applet visualizing Prim's Minimum Spanning Tree Algorithm** - Handout 7
**Notes on Cryptography by Prof. Christof Paar (ECE)** - Handout 8
**The Extended Euclidean Algorithm**with application to the RSA-Algorithm - Handout 9
**Making Change with Coins**in recursive and dynamic programming versions (C++ only). - Handout 10
**Graph Traversal Strategies**as Java-Animations. - Handout 11
**Buffon's Needles Experiment**as Java-Applet.- Buffon's Needles.
- Source Code.
- A proof sketch for Buffon's Theorem
- HTML-Version. The figure is not correct, refer to the Postscript version.

- Handout 12
as Java-Applet.Vernam's One-Time Pad Encryption - Handout 13
**Topological Sorting and Cycle-Detection in a Graph** - Handout 13
**A simple applet to draw Mandelbrot sets** - Handout 14
**An explicit solution for first order linear recurrence** - Handout 15
**An example of a good hashing function for alphanumeric keys** - Handout 16
**Multisection** - Handout 17
**Optimal matrix chain multiplication via dynamic programming**