Trace the retrieval algorithm for an indexed external file when the searchkey is less than all keys in the index. Assume that the index file stores the index recordssequentially, sorted by their search keys, and contains 20 blocks of 50 records each. Alsoassume that the data file contains 100 blocks, and that each block contains 10 employeerecords. List the calls to the various functions in the order in which they occur.
What will be an ideal response?
```
getItem(indexFile[1..20], dataFile, searchKey)
buf.readBlock(indexFile[1..20], 10)
getItem(indexFile[1..9], dataFile, searchKey)
buf.readBlock(indexFile[1..9], 5)
getItem(indexFile[1..4], dataFile, searchKey)
buf.readBlock(indexFile[1..4], 2)
getItem(indexFile[1..1], dataFile, searchKey)
buf.readBlock(indexFile[1..1], 1)
throwNotFoundException
```
You might also like to view...
A programmer tries to create a subclass of String called MyString. When the programmer compiles her new class, the compiler produces the following message:
``` MyString.java:1: cannot inherit from final java.lang.String public class MyString extends String { ^ 1 error ``` Explain the cause of this error.
?A(n) ____ reference identifies a cell by its location in relation to other cells and changes when a formula is moved or copied.
A. ?absolute B. ?relative C. ?template D. ?vector