We didn't spend enough time on the Master Method to learn how to prove it or even to understand why it works. All we did was memorize cases. I'm not a big fan of learning by memorization. Therefore although there will be some Master Method questions, they will all be fairly straightforward. You should be able to apply the cases on the wiki page and get the answer directly. There won't be questions about recurrence relations of the form
T(n) = a * T(n/b) + f(n)  when f  is not polynomial.

There won't be questions about recurrence relations of the form T(n) = a * T(n/b) + f(n)  when f  is not polynomial.