Week 10

This week we've been learning about unit test and test cases and assert functions. We've also been talking about minimax for assignment 3. Before starting with assignment 3, we were under the impression that our minimax wasn't working properly so we started with option B. However, after we showed Ms. Horton our code, she said there was nothing wrong with it. Oooookay then...

However, since we've already started with Option B, we're choosing to stick with it. Assignment 3 is going not so bad. It's much better than assignment 2, however. With this assignment, we do get stuck here and there but somehow we manage to figure something out.

Once we're done with the assignment, we'll most probably start revising for final exams.

Jokes aside, whoever's reading this blog, if you're a student, good luck with exams! We're finally almost done with first year!! (or whichever year you're in) If you're a TA grading this post, then welcome back from strike and go easy on us for finals :P

Photos from:

• https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhnu5nG2fv2PrMbKEjRWniK5fZkZ3MeXIwgpFedjwU1xlYyua4ZULfxtnQ0QIFe8fSMofsk1Nh2ciibu8fJQ0Udzx7EQhkIkrDvxRK91GFQeohMJD4kLJY5Q5ce9AY9t10_hYA6HocMeuxA/s320/jackiechan_confused1.jpeg

• http://imstash.com/wp-content/uploads/2012/05/twitter-like-a-boss.jpg

Binary Search Trees

My god, i swear i LOVE this topic. It's really simple and convenient to understand: It has just two children and everything on the left has a smaller value than the parent node and everything on the right has a bigger value. While revising for the first term test, i saw questions about Binary Search Trees on previous papers and i initially found them weird. My first thought: "Why do we have tree-like structures in a Computer Science syllabus?" After studying it, i realised how cool and elegant it is. It's pre-order, in-order and post-order traversal is pretty simple to understand too!

This week was a really nice week for me in the sense that i got to learn something really interesting.

Picture from: http://yannesposito.com/Scratch/img/blog/Haskell-the-Hard-Way/yo_dawg_tree.jpg

SLOG for grading

A few weeks ago, i wrote a SLOG entry titled "Object Oriented Programming" and i would like to consider that to be the entry that the TA's grade (or whoever is grading them at the moment)

Meanwhile, here's a recursive shrek! :D

gif from: http://gph.is/1a006y2