SLOG #6

It turns out that I performed extremely well on the mid-term. It was reassuring that a lot of the questions resembled ones we had gone over previously with some minor differences. Also, I was able to score well on the quiz in last week's tutorial, so my results on both evaluations were definitely a confidence booster. The material for the big O is not overly complicated, but the proofs for upper and lower bounds are somewhat confusing because I'm not entirely sure how to prove it correctly since it appears that you can prove them in more than one way. Hopefully this will be clarified in next week's tutorial.

SLOG #5

I am beginning to understand the concept of proofs a lot more after completing the assignment. After looking at the assignment solutions, I was able to determine where exactly I went wrong so that I know not to repeat the same mistake on the midterm. However, the current material we are learning regarding worst-case complexity and O notation is confusing to me. In tutorial, we counted each step in a line of code, where as in the lectures, we counted each line as a single step of code. I found this really confusing at first but now that I am aware of the difference, it is slightly more clear. Hopefully reading over the course notes and lecture notes again will clear out some of these confusions. Currently, I am polishing my knowledge of proofs so that I can perform well on this mid-term.