Day of Days

Well, today is any other day, but being in the Department, I feel compelled to announce my presence to the world. The next time you may see me is the second day of the new year.

Not much to report, actually. May spend some time transcribing the second CS 131 module.

Giving In

Well, by democratic decision, the CS 135 exam for Friday has moved to January, allowing more time to... I'm not sure. Study? Make more problems? Better clarify? Not too sure. There is tomorrow's CS 11 exam which will not be problematic in the least... unless if I decide that there will be three sets...

Timing Issues

A little laxity is always going to bite you in the arse a little. I may have arrived too late for some students to get their CDs. Oh well. C'est la vie?

Winding Down

Lateness in the morning translates to lateness in the afternoon. I feel a bit of the comprehension gap that occurs when discussing the correctness of bubblesort. I wonder if there's something I'm doing wrong. This sem's discussion is tighter and more mathematically sound than last sem's "Err... yes, this does mean that we can conclude that... I think" approach.

Rest for the Wicked

After outlining in grueling detail the solutions (and some alternative solutions) to the problems of the third Machine Exercise, I feel not up to the task of purchasing copious amounts of homogenized somewhat frozen flavored dairy product, so I may yet give an ice cream treat in the next year, instead, knowing the cornucopia of festivities festooned with generous foodstuffs to arrive in the next week and a half.

I find myself with a rather worrisome deep cough I may have picked up from MH 209. I will block out the rest of the world through the use of earphones and focus on making things better for those students taking exams next week. Those students taking exams next year will have to wait for my generosity (and free time) next week.

Loop-de-Loop

Iterative algorithms are the rite of passage for the young mathematician programmers today. What with the flavor of Fibonacci sequence, prime factorization, GCD and LCM, and a bit of nondeterminism and just a smattering of ASCII, we have a hodgepodge of problems that may prove toughest yet. Will they realize that the tougher the problems are, the harder it is to make the long examination questions tough? They probably will never know...

Edit: Removed the ASCII portion to make the second bonus concern the nontermination of the program (redoing the operation) until a specific input is provided.

Birthing Pains

Still problems covering average-case time complexity and correctness proofs, and now having problems looking for the perfect rootfinding method. And still half the day to go, too. Ugh.

Graeffe's of Wrath (Punny #100)

Graeffe's Root-Squaring Method is so tedious to perform without a calculator. I guess that means that I should do all my initial calculations at home on the Windows calculator, and bring those notes to class, for the practice next week. And so many! Ugh.

Must remember to upload PS#2 for CS 135. And maybe the solutions. And finish the first level of encoding module 1 for CS 131. And rush my special project. :P

Post #100!

Barely In the Water and Already Drenched

Have days like these? Sweating profusely before even riding the first jeepney? Panting heavily as you get to your desk? We go on to discussing the second machine exercise, and bring MHX up to speed today. Hopefully will finish module one for today and do something special for the rest of the days in the week that I have.