@y28chen: "An old midterm exam is posted, under the exam webpage in the course 
website.
Some comments:
Problem 1:
a, b, c, e, f, g are covered.
d is not explicitly covered, but we mensioned.
h and i will be in the final
Problem 2:
Covered.
Problem 3:
Covered.
Problem 4:
We have not cover count-sort, radix-sort yet, but you should make a 
comparison between heapsort, insertion sort, randomized quicksort, 
selection sort and mergesort for your review.
Problem 5:
Covered.
Problem 6 and 7:
Covered. Acutally we covered more in depth. We talked about two versions 
of deletion and insertion on a b-tree.
The term they use is a little bit different from us. By order, they mean 
each node can have b/2 to b keys (all inclusive). By term b, we mean each 
node can have b-1 to 2b-1 keys.
You can try to do operations based on the trees in this exam, but stick 
with the term we use, in our midterm.
Problem 8:
Will be in the final.
Problem 9:
Covered.
Problem 10:
Covered. This is a hard question, based an a very good understanding on 
sorting. Related to the decision tree stuff.
What we have more:
We covered probabilities and randomization more in depth. We discussed the 
analysis on probabilities more in detail.
We discussed the analysis on running time more in depth. We have given 
three recursion templates. We learned how to analyze the running time from 
an overall image.
We have covered kd-trees, quad-trees, range-trees. Those are not covered 
in the sample exam.
We have MTF, Splay trees, Interpolation search, order by frequency. Those 
are not covered in the sample exam."
    @y28chen: "Sorry, that link was from previous terms. We actually have turned it off.
Your answers should be similar to what we have in the posted solutions. If 
justification is asked, you should explain a little bit as what we did. 
Bascially, imagine you are reading the solution. You should be able to 
find the idea behind, after you read it.
We did not post the solution for the old-exam, the exam itself is in the 
exam page.
-Eric (Instructor cs240)
<quote>"
{'source': 'USENET', 'other_information': '{"reply_count": 1, "forum_name": "uw.cs.cs240.20150604.mbox"}', 'file': 'data/output/usenet-uw.cs.parquet'}