Winter class schedule
I just realized I haven't posted my class schedule for this quarter yet.

Winter Quarter 2004 Schedule

	Sunday	Monday	Tuesday	Wednesday	Thursday	Friday	Saturday
9:00
9:30		CSE 341 AB EE1 125		CSE 341 AB EE1 125	CSE 341 AB MOR 220	CSE 341 AB EE1 125
10:00
10:30
11:00
11:30		LATIN 102 C DEN 309	LATIN 102 C DEN 309	LATIN 102 C DEN 309	LATIN 102 C DEN 309	LATIN 102 C DEN 309
12:00
12:30					CSE 451 AA MOR 225
1:00			Work
1:30		CSE 322 A MGH 231		CSE 322 A MGH 231		CSE 322 A MGH 231
2:00
2:30		CSE 451 AA MGH 231		CSE 451 AA MGH 231		CSE 451 AA MGH 231
3:00
3:30
4:00	Work
4:30
5:00
5:30
6:00					Work
6:30
7:00				MUSEN 302 U MNY 268
7:30
8:00
8:30
9:00
9:30
10:00
10:30

This schedule was generated using bitman's Schedule Builder.

And now some brief thoughts on my classes:

CSE 341: Programming Languages

This class is so much fun. We're learning ML right now, which is like the most polymorphic language ever. I soak up new programming languages so easily that I'm doing really well in this class, even though I've already missed class 3 times -- once due to freezing rain, once intentionally because I needed more sleep, and once because my alarm was set to 7:00PM (stupid AM/PM dot). I expected them to teach us LISP, but apparently that got dropped from the curruculum this quarter. How can I live with myself without having at least a little LISP?

CSE 451: Operating Systems

Fun but time-consuming. Our first project involved adding a system call to the Linux kernel. Fortunately the labs had VMware set up to make testing the modified kernel really easy. I really didn't have the time to learn how to use bochs or user mode Linux. We also had to write a simple shell program that used the new system call, as well as fork() and friends. And all in C! I rock at C! My shell was all uber-well-designed, too. They suggested using strtok() to do the command parsing, but strtok() sucks (it's own man page says to never use it, but if you do...), so I did my own parsing using techniques learned from working on KevEdit. It was almost overkill for such a simple assignment.

CSE 322: Introduction to Formal Models

Ever heard of finite automata? They're apparently these abstract things that know how to recognize languages. Thought you knew what a language was? Well, in this class a language is just a set of strings. For example, the English language would be something like the set of all meaningful English sentences. That's a freek'n huge set. The C language? That's the set of all possible C programs. So what a finite automaton does is take in a string one character at a time and tell you whether it's in some language or not. It's pretty easy stuff, but only mildly interesting. We've just now started on regular expressions.

LATIN 102: Latin, take two

OMG, I thought Latin was hard last quarter. This quarter my teacher actually cares about us doing our homework every day. I mean really, how can one expect so much from sleep-deprived college students? In addition to the test at the end of every week, now we have biweekly vocab quizzes. It's crazy. I actually have to spend more time on this class than the hour and a half of time on the bus each morning that I alloted for Latin last quarter.

</dl>