Monthly Archives: May 2002

Start of the World Cup 2002

Posted on by
Reply

Today is a day which I’ve been looking forward to for quite some time – the start of the World Cup. We (Denmark that is) has to fight with Senegal, Uruguay and France for a place in the round of 16. France and Senegal is opening the tournament in a few hours and even though I don’t doubt the strength of the team from Senegal I still think that France will be our toughest opponent in the group, so I hope that Senegal will win today. We’re playing against Uruguay tomorrow, it’ll be fun to see if the Danish team is fit!

Algorithms and Data Structures

Posted on by
Reply

So, I’ve had my first exam now, it was in “Algorithms and Data Structures” and it went ok, it was not a stunning performance but I’m satisfied. My next exam is in a couple of days and is in my Probability course.
Tomorrow I’m attending my first belt test at my karate dojo, if I do well I will earn the right to wear the orange belt, wee.
I’ve finally found the time to get X windows up and running on my old machine and it is now running the VICE emulator as a fulltime C64, so I’m having lots of fun with the good old cpu.
Enough bla bla, see ya.

Birthday

Posted on by
Reply

Wee, today is my birthday, I’m now 20 years old. And just when it was getting fun to be a teenager, darn :). Among other nice things I got fifteen litres of pepsi, now that’s what I call a gift, they’ll do nicely when I’m studying for exams.
I’ve also started on a new hobby alongside the game I mentioned the other day, c64 asm programming – you have so much control over that tiny machine, no need to worry about multitasking and all that, I’m in complete control :). I’m not very good at it at the moment, but I’m picking up pace.

Anyways, have a nice summer…

Exams

Posted on by
Reply

Exams are coming up in a few weeks so programming is going really slowly these days since I have to do alot of reading. The closest I’ve been to coding these last weeks is a project in a course about algorithms and datastructures, we’re developing an algorithm to find the maximum matching in a bipartite graph and when we have proven it correct we have to implement it in Java. Not much gfx related in writing boring algo’s in Java but atleast I get to type a bit :)