Saturday, May 10, 2008

Crybaby.

It's apparently common that people have a hard time understanding the Galilean Transformation Equations.

Well, I don't. I mean, I do. But I can't really use them very well. If at all.

Okay, okay, it's called relative velocity in a Physics text near you.

Ahh, I'm slow but it will be elucidated.

 

Day before, was my Calculus AP. (Read previous entry; you gotta' love my pre-exam incoherence.)

So it didn't go very well.

Sorry CollegeBoard, I still love Calculus.

More than I ever will, standardized tests.

 

Computer Science before that, was relatively better.

Yeah, relatively.

I know it's all I've been doing since I was this (.) small. But the stuff that's part of the AP syllabus, has been stuff I've /wanted/ to do, but never got down to doing. Let's see. malloc(). I kinda' know how it allocates memory on the heap: list of pointers along with a size bound for each pointer; gets appended to, on each call to it; truncated, on each call to free(). But I never actually knew how that list worked. But then again, I never thought I needed to know. I used to think it was rote stuff, sorting and searching through a list: not something that'd be interesting. Something the clerk does at a multi-billion dollar company office. Not snazzy.

But that was a long, long time back.

I stumbled onto Knuth, a bit later.

The guy spent half his life writing a book series on searching. And sorting. And finding random numbers. And other 'rote' stuff.

Killed me, 'cause I couldn't get through two pages after the preface. I don't think I liked how every other exercise problem had an AM next to it. Indicating Advanced Math. And how his terse prose went right damn tangential to my skull.

Since then, though, I've always wanted to be an algorithm guy. Not just someone who could code a network stack* using a library AVL tree. But someone who could write the damn tree. And optimize it. And not just someone who vaguely knew how OSPF was used in implementing big, badass border routing protocols. But someone who could do another OSPF all by himself.

 

I'm happy with myself today. And I think it's because today's planned. Phone switched off, when it needs to be, music turned off when it accounts for more than half my miniscule attention span and y'know, stuff like that.

Well, not actually. But it will be planned by 10:45. And I'm going to stick to it. Any which way, I'll get back to you at the other end of today. Until then, I'll let the dots do the talking.

 

Edit: I can't code network stacks, damnit. It just sounds that much fancier. And well, I had to keep it dramatic. :P

1 comment:

Snow said...

There are series of books on sorting and searching?! wow! Just when I thought it all ended with an insertion sort :|! Hmm, balls to collegeboard! Dont let 'em affect anythin! Well, atleast by studying for your AP's, you've learnt new, interesting stuff that u like :)