Bad Week, but time to move on!

Dismayed as I was with my results for Test 2, greatly below my expectations, the only thing that I can  do now is move on, be strong, and be aware.  In hindsight, for example, I could have put in a bigger effort at looking over the materials given for reviewing for Test 2, such as past tests, solutions for a2, solutions for past tests, etc.  Oh Well! At least I did well on the a2 for CSC108.

I find this week's lectures on proving Big O and Big Omega quite simple, in the sense that, for polynomials at least, the proofs are quite straightforward.  Once you get how to do it, it is very simple to just apply the process, which becomes mechanical, over and over again.  Hopefully, Big O proofs will always remain that easy, but that is probably just wishful thinking.  The pattern that I am noticing for proofs of any properties of polynomials in general is that they are quite easy to do.  In MAT137, delta-epsilon proofs of polynomials are simple, proofs of the derivatives of polynomials are simple, and so is the proofs for Big O.  The halting problem stuff and computability is a understandable but the proof of why initialized(f, v) in non-computable is kinda confusing, I definitely need to ask about that.  I reviewed it enough to understand how I could prove it but I do not have a clear understanding of the proof.

Fingers crossed, I hope my assignment 2 will have great results to make up for the test 2 blip.

Big O problems and Running Steps

Doing CSC108 assignment 2, I can definitely see how calculating the Running steps is important.  An assignment that requires making a lot of functions and some of them complicated, I needed to make the functions as efficient as possible to save time unless I want a program that takes 10 minutes to finish.  At first, I was frustrated because my program was taking so long to finish, and I needed to cut back on the "steps" needed to complete the program so i went back to clean it up.  

I find that Big O and running steps problems could be hard because I'm not used to recording the iterations in my mind, so I definitely need to do some practice, especially since some functions can be very complicated, and then translating the iterations into a formula.  Hopefully, either I get good at doing this or test 3 will be merciful regarding running steps and big O problems.