…and the second half of the midterm barrage has finally come and gone. I guess it’s back to normal university life?
Anyway, I wrote my CS 350 (Operating Systems) midterm last Friday. As I expected, it was relatively hard. A large portion of it was rote memorization from the lectures, notes and textbook. Then there were a few analytical questions that really required a deep understanding of certain topics (i.e. how virtual addresses are structured to incorporate multi-level page tables, etc.). Good thing ~1/9th of the total marks were for bonus questions. 
CS 348 (Intro. to Database Mgmt.) and CS 341 (Algorithms) were scheduled back-to-back on Wednesday and Thursday. I don’t have much to say about the former – the course is pretty straightforward especially since I had a lot of prior experience with the material in previous work terms and hobby projects. Algorithms, on the other hand, wasn’t anywhere as easy. Though the topic is very interesting (examples here, here and here), proving optimality and determining time complexity is not. Especially when the proofs lead to equations with chain exponents and logarithms. For the midterm I actually had to leave certain questions unfinished because going through the math alone would eat up all of my time. Meh.
Anyway, it doesn’t look like I can relax for a little while longer since I have a ton of assignments to do for various courses. Out of the frying pan and into the fire much?