This week, we were given our marks for our mid term examination. Well, the exam was pretty easy, and I did receive a good grade in it. Happy, but not satisfied. Made a trivial error while passing the arguments in the second question.Will try to be more careful next time and not lose marks for the things I know. The new topic introduced this week was linked lists. They have some characteristics of lists as well as some of trees. Like lists, they store a data value, and like trees, they lead us to the next data member. Not that difficult to learn, once we understand the implementation of trees and the Node class from exercise 5. Attempted exercise 5 and got the (a) part at the first try. While implementing the (b) part, forgot to consider the case when the elements are "None", as wrote it in a hurry, at its preliminary stage. Don't know when I'll stop making these kind of errors. But corrected it as soon as I got some time to revisit it.Overall, learning is on the track and I'm enjoying it!!!
No comments:
Post a Comment