Consider a linear list based implementation in a file system. Each directory is a list of nodes, where each node contains the file name along with the file metadata, such as the list of pointers to the data blocks. Consider a given directory foo.

Which of the following operations will necessarily require a full scan of foo for successful completion?

Which one of the following statements is NOT correct about the B⁺ tree data structure used for creating an index of a relational database table?

B⁺ Trees are considered BALANCED because

A file is organized so that the ordering of data records is the same as or close to the ordering of data entries in some index. Then that index is called