Pete's Log: huh
Entry #868, (School)(posted when I was 22 years old.)
so today I made it to algorithms and handed in the homework. Dr Chen immediately asked us about our solutions to the second problem. Some people said they'd gotten O(n log n) solutions to the problem. Chen immediately criticized that as being too slow. From the reaction of the class, it seems most of us had gotten O(n log n) solutions, including me. Well Dr Chen went on to confess that he'd made the second problem a trap for us. Blah. Oh well. Got the first homework back, 45/50, I'd messed up some stupid math (forgot a -1 somewhere) and thus was imperfect. Then worked on comp arch for a while until I got email from Dr Uhran that the due date's been postponed from tomorrow until next tuesday, which is excellent, since I've got this graphics test to study for and such. So I went on to try to compile LTFS on 2.4. Didn't work. They seem to have changed how signal information is stored in struct task_struct in sched.h, so I'll need to do some kernel source reading to figure out how things work now... which means some fun conditional compiling, because this stuff also got changed between 2.0.x and 2.2.x...
Brian and I went shopping, which was definitely necessary.
Watched tv a little while, then began reading graphics. got through about half the reading, then decided to go to campus and install mesa and such on realloc so I could mess with some opengl code at home. turns out debian decided to fuck me over, so I had to leave realloc on campus in a rather unstable state (but I can now compile and run opengl programs on it!) ... came home and read more graphics (one more chapter left to read) then realized I have a meeting with Dr Freeh at 9:45 tomorrow morning, so I gots to get up early. So I think I'll call myself done with graphics for tonight and worry about the rest of it tomorrow.