Thursday, 28 November 2013
Slog Update #3
Last class, we studied a new topic (at least to me), which was local, non local and global variables. And is the concept of accessing and changing variables in different locations of the code. Meaning either module-level variables or method-level variables. This seems like a really useful feature as you might want to change a variable that is outside of a function from the current function.
Friday, 22 November 2013
Slog Update #2
I have already got back test #2, and the results weren't surprising, as they pretty much were what I expected. I'm glad I got the part marks I deserved for the question I knew I had messed up. I also already got the marks for assignment, and I'm proud to say that I got a 100%. That will definitely help my grade to compensate for my result on test #1.
Thursday, 14 November 2013
Test 2 Aftermath
For test 2, I expected to see some big-oh notation stuff; to my surprise, there wasn't any. I did also expect recursion, which was pretty much the whole test. I think was over thinking the questions, but at the end, I ended up with something that made sense to me, meaning it should work. I did recognize a mistake afterwards on the last question. I used a break outside of a loop as i thought it would just skip the execution. Still hoping to get part marks for that question.
Friday, 8 November 2013
Searches, Sorts and Linked lists
The past few weeks, we've been doing a lot of recursion that makes code more efficient. For example, Binary Search V.s Linear Search, where binary search is much faster than linear, well, when you are dealing with sufficiently larger list sizes. I get why CSC 165 is taken along with CSC 148, since at the moment we are studying big-oh notation, which explains breaking points and such.
I had done some Sort algorithms in High School, so the concept of bubble sort and such wasn't new, although much clearer now. I found it interesting how there are so many different ways to achieve the same task, but all having different efficiency. Linked Lists was a concept that was quite abstract at the beginning, since I was so used to being able to reference anything on a list, but now I feel much more comfortable with the concept. With Test #2 coming up, I think the topics that I have to focus on the most are Linked Lists and Sorts.
I had done some Sort algorithms in High School, so the concept of bubble sort and such wasn't new, although much clearer now. I found it interesting how there are so many different ways to achieve the same task, but all having different efficiency. Linked Lists was a concept that was quite abstract at the beginning, since I was so used to being able to reference anything on a list, but now I feel much more comfortable with the concept. With Test #2 coming up, I think the topics that I have to focus on the most are Linked Lists and Sorts.
Subscribe to:
Posts (Atom)