Right now, I will say thank to who helped me in this course.
Thanks dear prof , Thanks TA(I knew my TA won't that happen), Thanks my team mate.
Yuan Cao
Monday, April 6, 2015
Last week slog
This is last week slog, and We done all works in this course without final exam. I felt interesting in this course and learned a lot of things. Actually, I never try hard to learn any course like that, because I really want to join computer science program. This semester is troubled, because of strike. My quiz's mark is affected. I didn't do very well in the semester beginning, I thought I have chance, we have more quiz in this semester. But I didn't think TA will strike. But my test and assignment are all good.
Saturday, April 4, 2015
Week 11
The topic of this week requires us to revisit the topics previously discussed and see if our opinion has changed. The three topics that I discussed previously are recursion, trees and linked-lists.
I stated in my earlier posts that recursion is a difficult and very difficult to comprehend. Now when I revisit this topic, I still find the logic beneath recursion to be difficult, but I find recursion problems to be much more solvable. This is my practices of recursion has allowed me to find a rather systematic way to solve recursion questions. The secret is to always establish a basic case and recur back to the case to solve the question. Although I can solve recursion questions, I still find the logic behind recursion to be highly difficult to understand. Perhaps I will need to do more work on this topic.
In terms of Trees, I wrote in my earlier posts that I believe it is a rather clever and intellectual way to demonstrate data, but I didn’t think it was useful. Now that I look back, I think tresses are extremely useful. It is a recursive data structure that helps us to perform many operations. For instance, in Assignment 3, we modified the Minimax function using tree attributes and was able to significantly modify the running speed of Minimax by memorizing the children of trees and call the child once another tree share the same child.
In terms of linked list, I believe my previous impression of linked list has not changed. I still feel that linked list is a simple concept in terms of the current depth we touch upon. However, I also acknowledge that it is extremely easy to make a mistake W.R.T linked list questions due to its complexity.
As this course approaches its end, I feel that I have overall gained good academic development and much better understanding of CS. I hope I can keep this up and become a better computer scientist in the future.
I stated in my earlier posts that recursion is a difficult and very difficult to comprehend. Now when I revisit this topic, I still find the logic beneath recursion to be difficult, but I find recursion problems to be much more solvable. This is my practices of recursion has allowed me to find a rather systematic way to solve recursion questions. The secret is to always establish a basic case and recur back to the case to solve the question. Although I can solve recursion questions, I still find the logic behind recursion to be highly difficult to understand. Perhaps I will need to do more work on this topic.
In terms of Trees, I wrote in my earlier posts that I believe it is a rather clever and intellectual way to demonstrate data, but I didn’t think it was useful. Now that I look back, I think tresses are extremely useful. It is a recursive data structure that helps us to perform many operations. For instance, in Assignment 3, we modified the Minimax function using tree attributes and was able to significantly modify the running speed of Minimax by memorizing the children of trees and call the child once another tree share the same child.
In terms of linked list, I believe my previous impression of linked list has not changed. I still feel that linked list is a simple concept in terms of the current depth we touch upon. However, I also acknowledge that it is extremely easy to make a mistake W.R.T linked list questions due to its complexity.
As this course approaches its end, I feel that I have overall gained good academic development and much better understanding of CS. I hope I can keep this up and become a better computer scientist in the future.
Thursday, April 2, 2015
Week 10 slog
At the beginning of last week, I spent a lot of time to review my second term test. I missed the first one because of sick. I was worried about recursion function. Sometime, I can write true function, it work, but I don't know why it worked.Right now ,We have done second term test last test. It's include Recursion,Tree, Binary Tree, and link list. Hopefully, I will get good mark on that test. Good luck for me.
Subscribe to:
Posts (Atom)