I know I know I know, I promised to be more dedicated to this sLOG thing and in my defense, this slog was a lot better than my previous slog (Shoutout to my first sLOG entry). So with this post, I'll be covering week 11 and week 12 for slogs.
Looking back at my sLOG post from week 5, I realized how bad at recursion I was at the time, and how much I've improved since then. Considering that during that week I couldn't even manage to solve the problems that were given during the lab. And now, for the first time in my academic career, I finished a computer science assignment about recursion ahead of time. And looking at other people's sLOGs it wasn't easy learning recursion either.
Check out this guy's slog:
http://148choi.blogspot.ca/search?updated-max=2015-02-14T01:11:00-08:00&max-results=7
Not only will you notice that he has the exact same template for the sLOG, but he also shared my struggle with recursion! However, I believe he had an easier time figuring out recursion than I did.
Now regarding the last few weeks of class, remember when I said that I've been many many classes in earlier sLOG posts? And also that I might not have done too well on the second term test? Yeah, scratch that, I did very well on the second term test. Infact, I got an 89% on it, probably the highest mark I've gotten since I got into this university. And no, it wasn't a mistake in the marking. I'm not trying to say that I got away with a decent mark through cramming, but that's what indeed has happened. Also, during the last few weeks, we've been introduced to big O notation again! I remember this very well from csc165 and I'm just happy that we don't have to do proofs in this course. Essentially big O notation is how we count the complexity of a program (a.k.a. how many times it runs). For example, if you have a simple for loop based on a variable n, the big O notation of that is O(n), since the program runs n times.
And, I guess that's it for CSC148...
