Ahhh today, today was a good day. Not too much on the heavy end, more on the insight - thinking out of the box .
It was very interesting seeing Dan revisit the Fib function today and proposing faster ways to do this. Actually when we touched about Fib functions at the beginning of class I had the idea to use some sort of dictionary and the function would check if the value is not already saved in the dictionary before doing a ton of recursion.
But when Dan proposed no recursion and just solving it iteratively, that blew my mind. It was difficult...
Monday, 31 March 2014
Saturday, 29 March 2014
Posted by Unknown on 13:05 with No comments
Fear. Probably the word the describes what most students are going through. For some (if not many) students, the exam is what may decide whether or not they will pass this course.
Now that's aside, HOW SHOULD I STUDY FOR EXAMS? Should I just practice writing code and so forth? I'm not sure exactly what to study for. Regarding the Big-Oh , it seems like it's just identifying how many loops are written into the program. That aside, unfortunately I'll have to keep this blog short - I need to get back to study...
Tuesday, 25 March 2014
Posted by Unknown on 14:39 with 3 comments
A bit overwhelmed at the moment, forgot I haven't been updating the blog with my adventures into Python. Right now, I'm currently tackling some previous labs as review for the test tomorrow, learned a lot of things the past few weeks, not sure what was last mentioned - sorry! I think the biggest subject we learnt was the Big Oh. It helps a lot to understand how fast a program can do its job just by a simple glance. It really has a movie-esque feel to it - when a pro-programmer (haha) can just simply glance at a code and understand a certain aspect...
Wednesday, 12 March 2014
Posted by Unknown on 00:09 with No comments
Have my readers ever done a course called mathematical proofs, which is very instinctive, and certain things don't come together until you realize you were "magically" supposed to have realized you needed to add 2? That's where recursion comes in.
Recursion is a lot like induction in mathematical proofs: it requires a base case and everything you prove after it relates back to the base case. The difference is, in proofs we have the function (or the method in direct correlation) and in Python we don't. We have to realize what style of recursion...
Thursday, 6 March 2014
Posted by Unknown on 20:25 with No comments
So remembering the properties (mentioned in the previous lecture) with maximum number of nodes and nodes per height was pretty easy. We touched a bit upon Balanced Trees but it seemed too complex for our inferior minds to fully grasp at the moment, so it was only lightly skimmed over.
Reviewing LinkedLists like we have been doing in lab has been somewhat helpful, but it still makes things a lot more confusing. It'll take a lot of self appointed practice time to fully understand LinkedList, especially the head/value/rests part of each list. From...
Tuesday, 4 March 2014
Posted by Unknown on 18:35 with No comments
Learnt about Binary Search Tree's the other day (or BST for short) it seemed pretty easy! Left side of the tree: if smaller than the root node and right side of the tree: if larger, and I can sense using some form of a recursion step you could search through a tree for numbers pretty easily. Of course I'm wondering, if a BST is just used for numbers, how would you order and search through for items and objects ? Maybe it's not possible and a BST really is just for numbers haha !
Hmmm... I finished Part One of the assignment pretty early ... IT...
Thursday, 27 February 2014
Posted by Unknown on 20:16 with No comments
I hope people aren't overly discouraged by their Test 1 marks... OR OVERCONFIDENT HAHA...
I expected a higher mark, but was penalized strictly for what I realized about the minor syntax errors and little flaws. I received a much lower mark than expected-that was brutal. Otherwise, the test was fair enough. I think I should've studied harder or made everything very concise.
Now we're moving onto nested lists..May the heavens bless us
We started ListedLists this week and i'am a bit confused on it. I'll probably be consulting some books...
Monday, 24 February 2014
Posted by Unknown on 11:32 with No comments
Reading week is OVER, and I'm proud to say... I actually studied a bit and finished Assignment 1 for my computer science course! (Actually learnt tons from Assignment 1-like error reading that's actually really handy debugging i mean)
Concerning the test that's yet to be written, how will we debug? How will this be marked? Are we supposed to know it 100%? That's one of my biggest worries, I personally have to debug several times before my code working perfectly without kinks, so I'll just have to study extra hard right after this post
Today's...
Monday, 10 February 2014
Posted by Unknown on 14:41 with No comments
Been busy, lots of midterms, did not forget about the blog at all. Moving on...
Damn assignment 1. It's been a handful- it taught a lot of things and made other things more confusing. It's made me very aware at how much Python itself can change over versions ... such as how global variables are labeled. It's a confusing assignment, difficult to know where to dive in and how to make your code fit. You have to make variables to fit into a program that's already written- it's all very confusing. And that's why you should start on it early! Updates...
Sunday, 12 January 2014
Posted by Unknown on 17:30 with No comments
To start off, I would like to explain the purpose of this blog. It was created for a class I'm taking at the University of Toronto. Entries written will describe experiences and struggles with the class. Currently, we're learning Python as you probably figured out from the title.
Now then first week, this first post will be short ... not 'cause I'm lazy but because a Polar Vortex hit Toronto, and it dropped down to -40C ..No one wants to get frostbite! ... I think. Polar Vortex though yeah...global warming ...moving on.
OOP. Ohhhh OOP ....
Subscribe to:
Posts (Atom)