Much has been slow recently, which is actually very nice, compared to the overarching responsibilities of other courses.
It would be great if this would continue, however, i doubt that it would.
Much of the current material is based on prior-knowledge of CSC108, which is exceedingly easy to grasp for the second time around.
Although recursion definitely requires much more time for complete comprehension, I somehow has enough confidence in myself on this particular subject.
The most-recent lab on running-efficiency was very insightful indeed.
Although I have not encountered any mass data structure to significantly affect running time, I do believe that I definitely will in the future.
Even though I could not comprehend the reason behind why the queue was exceedingly slow, the lab experience definitely emphasized the importance of organized data structure for me.
I know I am not a seasoned programmer, but I definitely would attain more experience as I proceed.
Someday, I shall understand the subtleties behind running time, and I hope when that day comes, I would be able to pick the best data structure for every situation.
Assignment 1 has been introduced. It seems fairly interesting but exceedingly difficult to grasp.
The thought of considering n pieces of cheese has not been a pleasant experience for me.
Fortunately, I am not expected to attain the general solution to the problem anyways.
As the pace picks up here, and elsewhere, I am not sure how the course will turn out for me.
Maybe next week.
Write about the concepts in the topic and discuss them.
ReplyDelete