Sitting in front of my laptop, typing stuff like an emotionless robot, trying to squeeze in every word I think sort of goes with the theme of this post even though I have no idea what I'm writing about. That is exactly what I'm doing right now.
Finished with all the classes of this term, I could've been doing something less boring and meaningless like doing some research about what kind of food I should get for my dog when he's finished with the one I just bought for him. Btw, I have a dog who can't get any cuter.
Anyhow, enough with the bullcrap, let's get down to business and talk about something computer science related. Well, I didn't go to class last week. Looking at the lecture slides, I see stuff like tracing, hunting and memoization which I didn't even know was a real word. In case you want to know what I learnt from class, I'm gonna put the link to this week's slide here, cause it knows more about compsci than I do.
http://www.cdf.toronto.edu/~heap/148/F13/Lectures/W12/w12.pdf
Thursday, November 28, 2013
Wednesday, November 20, 2013
Untitled 2
Call me a psychic because I just got my midterm back and I failed as expected.
The word 'fail' is not enough to describe how bad I did.
Look at me, stuck on how to write this blog just like how I was stuck on how to write the BST codes (short for BullShitTree) in the midterm.
I'll admit it, it was rather unfair saying that about BST. It is actually a very clever data structure that is quite efficient (according to wikipedia, the average time for search, insert and delete are all O(log n)).
Although I might still need some time to fully understand the concept, I do have the confidence to ace the final (like I have a choice. If I don't ace it, I may not get into csc major at all.)
The word 'fail' is not enough to describe how bad I did.
Look at me, stuck on how to write this blog just like how I was stuck on how to write the BST codes (short for BullShitTree) in the midterm.
I'll admit it, it was rather unfair saying that about BST. It is actually a very clever data structure that is quite efficient (according to wikipedia, the average time for search, insert and delete are all O(log n)).
Although I might still need some time to fully understand the concept, I do have the confidence to ace the final (like I have a choice. If I don't ace it, I may not get into csc major at all.)
Wednesday, November 13, 2013
Don't read this. It's a waste of your time.
Wow, someone read my blog, not by accident. I know this because they even COMMENTED.
So this one is for my loyal readers (please have the decency to not point out that loyal readers to my blog do not exist).
Why am I even writing this blog?
Is it because I think it's a very good way for learning?
Is it because I suddenly have the urge to express my feelings?
Get your head out of your XXX.
I'm only writing this thing because I just failed test 2 (don't ask me how I know, I just do) and realized that I haven't written a SLOG in forever and I don't wanna fail and here I am, making up nonsense that's supposed to get me that 6 marks.
Okay, now I'm officially running out of things to say.
Again, I would like to thank the readers that have supported me from day 1. I wouldn't be where I am if it wasn't for you guys.
Subscribe to:
Posts (Atom)