You can work these in teams of up to three people. Turn in only one copy, with everyone's name on it.
Work and hand in the following problems from the textbook:
p.63, 3.5: 1, 2, 3, 4, 5
p.63, 3.6: 1, 2, 3, 5 (1st sentence), 6
p. 82, 4.3 (keep the answers short -- no lengthly explanation needed. By "3 organizations" is meant: random order, sequential, and hashed).
p. 82, 4.4 (don't turn in, just be sure you understand)
p. 110, 5.1: 1 & 2
p. 112, 5.3 (keep answers short but generic).
p. 113, 5.8: 1, 2 ("Bulk loading" loads the data from a sequential file, making each leaf node 1/2 full [i.e., half the max. number of keys that would fit])
p. 306, 12.2
p. 307, 12.4 1, 2, 3, 4. Ignore the part about "minimum # of buffer pages" if you wish. If you make any assumptions about available buffers or memory, be sure to state them.