I am currently reading a degree in Computer Science. The following links are to some small programmes which I have written during 1999.
I was very impressed by that when I first produced a working version of the applet. Yet, it seems to me that every CompSci.(Computer scientist) has programmed Mandelbrot set before, and I have seen a much faster version during summer 1999 :-( Anyway, if you haven't seen the Mandelbrot set before, then it is worth a look. If you are interested in Chaos Theory and have not much scientific background, then I recommend the book CHAOS by James Gleck. For scientists.that book is not mathematical enough and is quite boring indeed.
A classical puzzle to go in an introduction to programming. This involves placing 8 queens on a chess board in such a way that no one of them can take any of the others (i.e. no pair are in the same row, column or diagonal as each other). This JAVA applet will allow you to try our this puzzle and can compute ALL the possible solutions to the puzzle. It has a better GUI than the Pentominoes applet, but the algorithm used is essentially the same.
Mathematically speaking, the convex hull of a set Q of points is the smallest convex polygon P for which each point in Q is either on the boundary of P or in its interior. Basically, each point can be represented by a nail sticking out from a board and the convex hull is then the shape formed by a tight rubber band that surrounds all the nails. This JAVA applet implemented the Graham's scan algorithm. Other algorithms will available soon.
Last revised on 18-12-1999
Click here to go back to the Main Page