midterm2-review

midterm2-review - 1) Execute the following sequence of...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
1) Execute the following sequence of operations on an initially empty B + -tree of degree 6. insert(2) insert(3) insert(5) insert(7) insert(11) insert(17) insert(19) insert(23) insert(29) insert(31) insert(9) insert(10) insert(8) delete(23) delete(19)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2) Assume a 4 bit machine that implements an extendible hash index structure. Assume the capacity of each bucket is 2 records. Starting with an empty table (and index), show the structure of the directory after the insertion of each of the following (key,value) pairs: a) (0011,v1) b) (0010,v2) c) (1011,v3) d) (1100,v4) e) (0110,v5) f) (1000,v6)
Background image of page 2
3) Consider a disk with block size B= 512 bytes. A block pointer is P = 6 bytes long and a record pointer is PR = 7 bytes long. A file has r = 30,000 EMPLOYEE records of fixed length. Each record has the following fields: Name (30 bytes) SSN (9 bytes) Dept (9 bytes) Address (40 bytes) Phone (9 bytes) Bithdate (8 bytes) Sex (1 byte) JobCode (4 bytes) Salary (4 bytes, real number) An additional byte is used as a deletion marker
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 4

midterm2-review - 1) Execute the following sequence of...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online