October 2002

I’m working on improving the style of my LJ. Feel free to let me know how I’m doing! Also, I’m starting to make several friends-only posts. If you are a LiveJournal user, let me know and I might add you as a friend so you can see these posts, too!

If you need sponsorship, I have several codes to give out. Just let me know and I will send you a code!

When I woke up this morning, I noticed that I had been booted off AIM sometime during the night. Digging a little further, I noticed that I went off sometime around 7 or 8 AM, and when I was finally able to reestablish a connection (around 9 AM) I was like the only one online on my buddy list! It reminded me of when I first installed AIM back in the mid-90’s… I had no friends back then… lol.

Anyway, it sucks to be one of those people who was trying to set some sort of “most time online” record… I had one guy on my buddy list who was on for 25 days… he hasn’t signed back on yet.

I finally finished my DSA Huffman Coding project. Well, I didn’t get a chance to complete the decode functionality, but the encode portion was much more involved. I swear, I’m going to post all of my project and solutions to my website for others to find. It’ll be a nice reference

I feel like such a bum, I haven’t even updated my LJ in a week! I hate to make the first entry in a week some complaint about how hard/miserable my workload is. Anyway, here goes…

I’m working on a Huffman Coding project. For non-geeks out there, Huffman developed an algorithm to compress text files back in the 1950s. It serves as a foundation for modern file compression (aka ZIP files, etc). It’s not too hard, seemingly easier than the encryption project from a month ago

So I’m in the middle of working on this project. Stupid me saved it for the last possible second, but I’m doing well all the same! I finished the theory portion tonight, and am going to start on the coding portion as soon as I finish here. Ok well, I’m finished now. On to the coding portion, due tomorrow night at midnight!

So Katie and Michelle are here studying for their organic chemistry exam which is tomorrow afternoon. Usually when they do this there is some sort of dessert at the end of the evening. However, being a stressful week, we finished our dessert supply for the week last night. That is how I ended up making the Halloween cake!

It has orange and black sugar confetti in the cake, and the orange icing has little bats and pumpkin sugar pieces in it. Definitely a few weeks early but still a nice treat! Mmmmm….

My buddy Nisha is cool, but she hates away messages. Here is her best attempt to date!

Keep it up, Nisha

It would seem as though whoever came today was able to fix my heater. It’s nice and toasty in here, in that college apartment sort of way

It seems like a dream now, but a few hours ago I sat through one of the worst exams of my college career! Data Structures and Algorithms (DSA) is one of those required computer science classes that makes or breaks CS majors… thank god I’m not a CS major (I’m computer engineering).

One of the problems was:

    Given that T(n) = 3n – 1, prove that O(T(n)) = n².

Any ideas? Yeah, I would have said that it was O(n), not O(n²)… so I BS’ed some stuff, totally making up everything I put down. Some of the stuff on trees was straightforward, but the proofs and mathematical theory parts weren’t trivial at all!

So I’m sitting here at 2 AM in front of my laptop, unable to sleep at all. That’s probably because I fell asleep around 8 PM and slept for half and hour. That usually kills the sleep-ability for the night. So here’s to hoping I get some sleep tonight!

I’ve been following the saga of Danica Mace on The D Train website. Why aren’t you?