Shortcut for chapter specific information

Showing posts with label Chapter10. Show all posts
Showing posts with label Chapter10. Show all posts

Friday, July 8, 2011

status 20110708(e)

Solved 10.2-1,2 and 10.2-6,7.  Much better. I guess I can sense my true issue in linked list. 

In any case, the point of doing exercises by jumping chapters around is more on making myself warm up different material when I am really working on that chapter.  For me, this is usually very effective.

Browse reading: 485/1144
Exercises up to 4-3.1
Revisit : 4.2-{3-5}
Checking up to P2.1
Needs write up: 2-3.7 (cute solution using merging) P2.1c, 3-2.4, 3-2.8, P3.1
Exercises checked: 2.1-2, 2.1-3, 2.2-{1,4}, 2.3-{3,7}
Exercises which are finished but not on paper: 1.1-2, 1.2-2, 1.2-3, P1-1, 4.2-6, 4.2-7, 4.3-{1,2,4,5,6}, The whole Section 4.4, 4.5-1, P4.4(a-c), P4.6b, 5.1-{1,2}, whole Section 6.1, 6.2-{1,2,4,5,6}, 6.3-1, whole Section 7.1, 7.2-{1-3}, whole Section 7.3 and 7.4.3, 10.1-{1-4,6,7}, 10.2-{1,2,6,7}, 12.1-{1,2,3,4} 12.2-{1,2,3,6}, 12.4-4, P12.4(a), 15-1.1, 15.1-3, 15.3-3, 15.5, 17-1.1, A.1-{1,2,3,4,5,7},  C.1-{2,4,5,7,8,9,14}, C.2-{1,2,4,5}, C.3-{1,2,10}, all in D.1. and D.2-2.

status 20110708(d)

Solved 10-1.{1-4}.  Those ... are trivial exercises.  What it bugs me is that I have some remote feeling when I looked at the linked list sections.  Ah, after all, if you hadn't implemented this stuff, it would take a while to get use to this feeling.

Browse reading: 485/1144
Exercises up to 4-3.1
Revisit : 4.2-{3-5}
Checking up to P2.1
Needs write up: 2-3.7 (cute solution using merging) P2.1c, 3-2.4, 3-2.8, P3.1
Exercises checked: 2.1-2, 2.1-3, 2.2-{1,4}, 2.3-{3,7}
Exercises which are finished but not on paper: 1.1-2, 1.2-2, 1.2-3, P1-1, 4.2-6, 4.2-7, 4.3-{1,2,4,5,6}, The whole Section 4.4, 4.5-1, P4.4(a-c), P4.6b, 5.1-{1,2}, whole Section 6.1, 6.2-{1,2,4,5,6}, 6.3-1, whole Section 7.1, 7.2-{1-3}, whole Section 7.3 and 7.4.3, 10.1-{1-4,6,7}, 12.1-{1,2,3,4} 12.2-{1,2,3,6}, 12.4-4, P12.4(a), 15-1.1, 15.1-3, 15.3-3, 15.5, 17-1.1, A.1-{1,2,3,4,5,7},  C.1-{2,4,5,7,8,9,14}, C.2-{1,2,4,5}, C.3-{1,2,10}, all in D.1. and D.2-2.

Friday, May 6, 2011

Status at 20110506

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.

Thursday, April 28, 2011

Status at 20110428(b)

Just got out of my sorting routine a bit.  It turns out is not that difficult to solve some of the problems such as 10-1.6 and 10-1.7.   Of course, there are tons of this kind of trick question about elementary structure.

Finished the reading on median.  The algorithm is very smart!  In fact, I should spend more time on thinking using similar technique to solve problems.

Also started the basic data structure chapter.  This is also where all the classical data structures are presented in the style of CLRS pseudocode.  It certainly makes much more sense to me now.

Browse Read: 236/1144
Exercises up to Section 2.3-2
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.

Status at 20110428

Finished the reading on median.  The algorithm is very smart!  In fact, I should spend more time on thinking using similar technique to solve problems.

Also started the basic data structure chapter.  This is also where all the classical data structures are presented in the style of CLRS pseudocode.  It certainly makes much more sense to me now.

Browse Read: 236/1144
Exercises up to Section 2.3-2
Exercises which are finished but not on paper: 2.3-7, 6.1-7, 6.2-3 and 6.2-4.