Week 11 - Revisiting Past Posts

In posts I made near the beginning of the year, I discussed how I was thoroughly enjoying this class and the material we were learning. Revisiting that now, I can say that I was right. Hoping to pursue a major in Computer Science, this class has really helped develop skills that will go a long way in helping me succeed. Coming into this class at the beginning of the semester, I had minimal knowledge of recursion, trees or linked lists. Now I can proudly say that I have learned all of these concepts and hope to expand my knowledge on them in the near future. My experience in this class has definitely been a positive one thanks to my wonderful classmates and of course, the great professors and TA's who worked endlessly to make this a successful course.

Throughout the semester I have been following along with posts from some of my fellow classmates. I found some of these points very interesting and also useful to acknowledge.

Anam Alvi:
I came across a post Anam made earlier in the year (Week 4) discussing her experience in the course at that time. She talked about how the course was her favorite one of the semester and how she really enjoys the concepts covered in the course. I can relate to that because as I mentioned above, my experiences in this class seem to be similar to hers and I don't find that surprising since she's going to be pursuing a Computer Science specialist which only means this course is an interest of hers.

The post can be found here: http://148slogs.blogspot.ca/2015/02/week-4-whos-your-daddy.html

All in all, Anam also offers some good insight on the topics covered in the course (along with very creative names for her posts) and sometimes reading other peoples course logs can be very helpful in a number of ways for example, understanding some material that was unclear or to relate to other peoples experiences.

Abhinav Chawla:
Abhinav also has nothing but positive things to say about this course which once again, I do not find surprising at all because it is a great course with a good structure and amazing professors / TA's.

However, instead of discussing his experiences in this class, I want to focus on one of his posts from earlier in the year (Why Geeks Should Write?) as I found this to be a very interesting and well thought out post. I liked the way he started his post with some background on what the word "geek" really means and how it came into existence. Without going into much detail about his post (link to the post can be found below), I would just like to briefly say that when I first read this post earlier in the year, I was inspired by some of the things he mentioned. One example of this would be how he discusses that instead of memorizing formulas, if we take the time to write down the concept and understand it, it goes a long way and that truly is something many people take for granted. Relating this to Computer Science, it makes sense that writing can truly come in handy. For example, when stuck on a problem, I like to sit down and maybe write some pseudocode or just the logic behind the problem and try to understand it. Therefore, I feel like this was a very well written post and I agree with the insight Abhinav had to offer on the topic at hand.
The post can be found here: http://abhinavchawlacsc148.blogspot.ca/2015/01/why-geeks-should-write.html

These are just a couple of the many wonderful course logs I have come across throughout the semester. Looking back at them now that we're coming to an end, I can say that it was a good learning experience. Reading over what other people have to say is wonderful as it helps the individual relate to others, learn from them and also assist them in any way they can. These course logs were a wonderful way to stay organized and also for students to seek others help when facing a challenging situation.

Week 10

Well now the test is over with and out of the way. Now we just have one assignment and the final exam left in the course. However, going back to the test, it was not very difficult and I had sufficient amount of time to complete it. The first question was very straightforward and I was able to complete that within 5 minutes. Part a) was simple once I realized the logic behind it and drew a picture which did not take much time and part b) required us to traverse through the tree given which I also found easy because I had reviewed all three traversal methods that we learned beforehand. However, the next two questions required me to think for a few minutes before I got anywhere. For the second question, it was very simple to a function we wrote in a previous lab exercise. I noticed the main difference was that this only returned even numbers which I quickly realized can be done with one simple if statement. The last question was about linked lists and this took me a while to complete. I first drew a picture like I had done for all the linked lists questions I've ever done. After drawing a picture and understanding the problem, I started to implement it making sure I keep track of everything I'm required too. The aid sheet I made for this test was very helpful because for one of the questions, it helped me solve a small mistake I encountered during the test. Now, all that's left is to see how I did and prepare for the next assignment and exam.

Week 9

It feels like this course just started yesterday and now we're already finished two thirds of the course. The course has been a very interesting one and I'm learning a lot which is making this class very enjoyable. The second assignment was submitted recently and there were a bunch of remarks about the assignment. The assignment was an interesting one as it took a lot of time for my group and I to just sit down and think about the logic behind it.

The first part, implementing Tippy was not very difficult after we sat down and played the game ourselves a few times to understand how it works and the different winning possibilities. However, the strategy we were told to implement, Minimax took extremely long to understand. We were given a lot of help from the professors on the logic behind the strategy and that went a long way in helping us implement the strategy. It took a lot of time but even then, I think it was an interesting assignment that really tested our knowledge of recursion and helped us master it.

Furthermore, on another note, we learned linked lists this week and the reading posted on the class website was very helpful in understanding linked lists. Professor Heap emphasized that we should draw pictures to help us understand the problem and even though I'm not very fond of this method, turns out it was the most helpful thing I could have done. The lab exercise was also very helpful in further understanding linked lists. By drawing pictures, I was able to understand how to implement the functions required and finish the lab.

Week 8

In the lectures last week, we mainly covered binary trees and binary search trees. We also went over how to traverse through trees by inorder, preorder and postorder traversals. Binary trees are something I looked over before coming to class so I did not think I would have much difficulty with it and the same goes for binary search trees as it is not very different from binary trees except for one or two conditions. However, at first glance, I got a little confused with a couple of the methods we completed but as we kept going, I started understanding everything and also being able to predict what the next step would be while writing recursive functions. I am hoping to be able to keep up with what we do and also be able to complete parts of the other functions myself without first seeing how professor Heap does it. It's crucial that I'm on top of all the work because of our test next week which hopefully won't be too difficult.

In the lab exercise for that week, we were supposed to implement recursive functions for binary trees and the lab took a while to complete, however it was a good learning experience as it was good practice for the upcoming test.