Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 351 DATA ORGANIZATION AND MANAGEMENT HW 4 Date Given : November 18,2009 Date Due : December 4, 2009 Important Notes: 1. Please submit the Homework to Room EA 231 on the due date by 5:00 pm (no late submission will be accepted). 2. Answer the following 5 question in the order they are given using a standard size paper. 3. Handwritten submissions are accepted, a word document is preferred. 4. Staple all papers and write your name on them. 1. a. Insert the records with the keys 6, 8, 30, 40, 50, 61, and 70 into a B-tree of order (degree) one. b. Insert the records with the keys 12, 29, 30, 31, 32, 33, and 56 into a B-tree of order one. c. From the results of a and b, what conclusion can you draw about the effect of key distribution on retrieval performance in a B-tree? d. Give a B-tree containing the above keys (submitted in a different sequence, of course) that has the minimum number of nodes.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/01/2011 for the course CS 351 taught by Professor Fazlıcan during the Spring '11 term at Bilkent University.

Ask a homework question - tutors are online