Week 12: Say it ain't So

CSC 148 Entry 11

     Ahh, here we are again in a familiar position. Similar to last term when I had to write about slogs in 165. It's sad to see that the course is over already. I find that I enjoy all my computer science courses the most. Perhaps, that's why I decided to try and do a specialist. When I look back at the past challenges which I have encountered I do not think they are as hard as they are. That opinion might be biased but it's a valid thought. I feel like I have grown this past semester over this course.

     The big take away in the material I have learned would be recursion and various data structures such as trees, linked lists, binary search trees and a lot of different techniques of implementation. I found that I actually enjoyed all of the assignments. I was sort of disappointed with the last assignment because professor heap originally said that we might implement chess and possibly a chess AI. I was quite intrigued with this challenge.

     The biggest conceptual hurtle I had was wrapping my head around recursion but eventually through the shear amount of problems encountered I am very glad I went through the trials and tribulations to understand recursion. I can really envision me 10 years from now in my office thinking about first year in university. And I would nod to myself and say one word recursion.

Week 11: Back to the Streets Where We Began!!! AGAIN

CSC 148 Entry 10

      In my previous slogs I talked about quite a lot about recursion and I still agree with the opinions which I had previously how powerful a tool recursion is. I think took a less serious tone in my slogs trying to make small jokes and making some pop-culture references. Like the title "Back to the Streets Where We Belong" is actually lyrics in the song Nine in the Afternoon by Panic! I put this as the title originally because of the way recursive functions call on themselves and it reminded me of this song for some reason. Some people I know took a more serous approach to the slogs and had more focuses on the technical aspects of the slogs. 

http://csc148justinsong.blogspot.ca/search?updated-max=2015-02-12T18:02:00-08:00&max-results=7

Personally I sort of wish I took a more serious approach to how I addressed things in slogs similar to my colleagues. However I also do not regret my decision to how I talked about my slogs. I think that the term expression is open enough to warrant different approaches on how to write about it. As for the actual content which I wrote I still agree with what I had to say about recursion. Except now that I have so much experience with recursion I do not have same amazement I had originally of it.

Week 10: ...

CSC 148 Entry 9

     I don`t think there was much to reflect on this week besides binary search trees. Due to the test and strike we only had one lecture this week. I do feel very impacted by the strike however since my tutorials were one of my motivations for reviewing the course materials. I feel that because of the strike I have become more lazy and actually spend quite a bit of time not doing much since all my tutorials have been canceled.

     After being shown how to implement insert and delete for the binary search tree I was not as impressed as I was by the other concepts when we encountered them. Although the binary search tree is ordered and is very useful it did not have as big an impression as when I encounter the other concepts. As I have already mentioned in my previous post I feel that did quite well on the test and I am quite at ease.

Week 9: Chooo Chooo, Coming Through!!!

CSC 148 Entry 8

     We learned about linked lists last week. I did not think that linked lists were that difficult and I found it quite intuitive actually. Sort of like a chu chu train. When iterating through this type of data structures as long as several variables are tracked such as what the previous node was doing manipulations of the linked lists isn't as difficult as it seems. It's sorta like playing with toy trains and just combing them in different ways. I find that after I made the visual distinction of train cars being linked to each other I found this concept to be fairly simple.

     I'm somewhat worried about the test when I was studying for it however, after writing the test I was quite confident about my answers. I stuck around a bit at the end and even had a quick chat with professor heap and I found out some of my answers were write and this gave me a very powerful calmness when I was walking back to residence.

I took a look at some various slogs and I was brought to shame when I saw this monster of a post

http://computersciencemaggie.blogspot.ca/2015/03/summary-of-object-oriented-programming.html?showComment=1426384453547

I think this is one of the posts which I actually found useful when to read through. No other posts were developed or expanded on to this extent.

Week 8: And the Plot Thickens.

CSC 148 Entry 7

     The past week I have been focusing very heavily on the second assignment. Minimax was quite challenging to implement and it kept me wondering about what problems we will be given in assignment 3. I think assignment 2 is officially the most challenging formal programming task I have worked on. In other news the TAs are on strike. I completely did not expect this I wonder what will become of labs and whether or not our assignment 2 are even going to be marked. 

     Week 7 had quite a bit of interesting focusing mainly on binary trees which only have two children in the tree. When we were first introduced to the subject I immediately through of binary searching something which encounter in 108 beforehand. Tree traversal was somewhat interesting, the various tree traversal techniques such as in-order traversal, pre-order traversal and post-order traversal. These concepts are as hard to grasp as recursion and I found it pretty simple of just drawing a tree and going through how the various nodes would be visited.

Week 7: Pimp My Function

 CSC 148 Entry 6

     Yo dawg I heard you like to write functions, so I made you a function that calls on itself so you can use the function to iterate through trees and other types of data structures.

     The more I learn about recursion the more I am impressed by the various possible things which can be done with recursion. For example, we learned how to iterate through lists nested in lists. When I originally saw the problem I was thinking of possible convoluted solution to the problem. However, the solution was so simple and elegant.

if isinstance(variable, list):

     return something([funciton(x) for x in variable])

This solution to the problem of iterating through the nested lists seemed so rudimentary yet complex at the same time. It really touched me and and I had a thought that this is what computer science is about coming up with elegant solutions to problems instead of brute forcing them. From then I see recursion in a new light.

     Most of the problems posted in lab 5 and 6 required the use of recursion to solve and this was actually quite challenging to try and solve. The problem was because it was a lot of work and that it required a lot convoluted code to solve; the problem was trying to wrap your mind around the concept of how the function would run over and over again and the possible cases which there are. I found the advice which Professor heap gave in lectures to think of all the different possible cases starting with the base case extremely helpful because it gave me a focus to start off from and eventually solve the problem.

    Although I found the recursive problems very hard, the more problems I see, the more simpler recursion seems. I think this is because all of the solutions to the problems are very similar. You just have to focus on the bases case, accounting for different scenarios and write the recursive step. When working on minimax I found it really helpful to draw diagrams of what is going to happen in each case, I think this is the key to recursion, its not how it will be implemented it's thinking of the conditions for the recursive function. After knowing what to account for the code basically writes itself.

Week 404 not found: Under the Weather

CSC 148 Entry 5

     Unfortunately after some partying with friends I'm now sick. ): I haven't been this sick all term. I feel sort of thankful though that I'm sick when there's no class.