Weeks 6, 7, Assignment 2

Lost a mark in the midterm for not assuming n > 8 in the proof of the question that had to do with Fibonacci numbers, guess I'll have to be more careful when proving (especially by induction). Turns out the proof of the recBinSearch(A, f, l, x) in class was really helpful for problem set 4. Proving program correctness and runtime seems much easier than it was CSC165, I think it's actually easier. Seems like we'll be dealing a lot with floors and ceilings, especially with sorting and searching algorithms (I think). Glad to finally have ps4 and a2 off my neck, an exercise and part of a project due in 207, ps4 and a2 in 236, all in one day, plus two midterms and another assignment within 3 days, seems like school only gets more stressful as the weeks and years pass by. In the meanwhile, I have to go prepare for the tests that seem to never stop coming (thankfully there are only 2 left - I think - for the semester after the ones I have next week). Thats all for now, till my next post, ciao.

Week 5 and Term test

Treated more of the golden ratio, turns out it has an unexpected connection to fibonacci numbers. I honestly wonder how people sit down to figure this stuff out and come up with endless theor(ies/rems) and formulas. Well the numbers make a whole lot more sense, or do they? There was more on unwinding recursions, not really much to say about that. It seems somewhat straightforward in most cases (actually in all the cases I've seen). Then there was the term test, it was way better than I thot it would be, given that the first assignment was tough. And thankfully it turned out better than my advanced calculus quiz earlier last week. I think the only "surprise" is each question was worth 8 marks, instead of 5 marks as in the case of the past tests. Makes no difference tho since every question is worth a third of the total mark. The first question was the toughest for me, even tho it was more straightforward than the last. The solution to the last hit me less than five minutes to the end of the test. Thankfully I had written the base case and everything in the inductive step except the line that proves it. Overall the test was good and now I have to go work on the third problem set. Later daiz.

Week 4

Treated recursive definitions last week, I must confess the whole thing's a little confusing, but thank God for the textbook, at least I get to read it and understand the text. I still hope not much of it is on the test though. The golden ratio seems very useful in many mathematical applications, I have a feeling I'll be seeing more of it throughout the semester.
That seems to be all that's happened so far, there'll probably be more to tell in my next blog. Laterz.