Studying for Test

I've spent my past weekend studying for the mid term monday. While I am super stressed, I do find that not an overwhelming amount of material was covered since the last test, so if i studying properly I should be fine. As of right now my main problem is while I read the textbook/course notes and can follow them and understand, when asked to perform these proofs I fail to remember everything. The only real solution right now is to just do as many examples as possible.

Assingment 2

I've been looking over Assignment 2 for quite sometime just thinking about how to approach the 2 questions given. As of yesterday I have started working on it. At first I found the assignment to be very intimidating but after constant look overs I feel I will be able to do them. Neither of the questions I find to be super difficult to understand, but both will still take a lot of time to work out.

So far for question 1, I was able to figure out the pattern and define a recursive function for checkOMCOFS. I am currently though having trouble trying to figure out how to unwind the function and find a close form for it.

In terms of question 2, I am currently just trying to figure out how to recreate the lemma that was given. Normally we see T(k/2) + T(k/2), but now its you take the max of them, which has me a little confused on how to write the proof then for it.