Assuming that, at this point in time, only 800,000 CORKBOARD records are stored on the disk in blocks that are packed to capacity. If the records are stored as a heap, approximately how long would it take on the average to find a record with a given CBID?

Please refer to this diagram for the Questions from here to the end of the exam. Click here to open it in a new tab.  (Remember you can use Ctrl-Tab to switch between tabs, even if Chrome is full-screen and they aren’t shown.) Due to proctoring settings, you will not be able to set the exam tab and diagram tab side-by-side. You will need to switch tabs. Also, the diagram says Q18-25, but as loaded, they will be Q19-26.

Which of the following are desirable properties of a relational decomposition?

At most, how many CORKBOARD records could be stored on this disk if packed to capacity? Give your answer in millions of records (e.g. for 75 million, enter ’75’ without the quotes)

Suppose we decompose the CORKBOARD schema into 3 schemas: Which of the following statements is/are true?

Given a relational schema and associated functional dependencies, in theory which of the following is/are true?

The number of block accesses needed to find a record through a single-level primary index and a single-level secondary index are the same if the secondary index is defined on a candidate key.

Which of the following is/are a superkey for CORKBOARD with respect to F?

If the 800,000 record CORKBOARD file is sorted on CBID and we build a sparse index on it, then how many blocks will be needed for the index assuming that the index blocks are packed to capacity and a block pointer is 4 bytes?

Please refer to this diagram for the first 13 Questions. Click here to open it in a new tab.  (Remember you can use Ctrl-Tab to switch between tabs, even if Chrome is full-screen and they aren’t shown.)  Due to proctoring settings, you will not be able to set the exam tab and diagram tab side-by-side. You will need to switch tabs. The diagram says Q1-13, but as loaded, they will be Q2-14.