Finished skimmed reading Ch10 and Ch11. Those are about elementary data structure such as linked list, stack , queue and hash tables. As always, there are many things I don't understand about them. Each of them have a lot of trick questions. For example, how to find the middle of a singly-linked list one pass? How to find the length of a circular singly-linked list? These are all trick questions. (In fact, first solved by Turing award winners before becoming a folklore and finally an interview question.....).
A good way to look at all these data structures is to think of them as used for a search operation. That's why in TAOCP there are two chapters just on sorting and searching. So one should think sorting and searching are equally important.
That reminds me, I still owe myself an implementation of linear search.
Browse reading: 287/1144
Exercises up to 2.3-4
Exercises which are finished but not on paper: 2.3-7, 6.1-7, 6.2-3, 6.2-4, 10.1-6 and 10.1-7.
No comments:
Post a Comment