Vous êtes sur la page 1sur 4

1. Linear Hashing has the following characteristics. a.

it avoids having to reorganize the entire hash file at one time b. it maintains overflow buckets when needed c. it incrementally adds new buckets to the primary area d. all of the above 2. Linear Hashing a. supports the efficient reading of the file in order by key value b does not maintain overflow chains c. has a maximum successful search cost of 1 bucket d. does none of the above 3. Consider the insertion of a record into a Linear Hash file that started with 1 bucket where currently the next bucket to split is number 4 and the number of times the file has doubled is 7. If the key value of the record is 601, then what bucket should store this record? a. 5 b. 255 c. 89 d. 11 4.Consider the insertion of a record into a Linear Hash file that started with 1 bucket where currently the next bucket to split is number 2 and the number of times the file has doubled is 5. If the insertion triggers an expansion of the main file, then what bucket number should be added to the file? a. 2 b. 32 c. 34 d. 17 5. Extendible Hashing a. uses an directory b. does not maintain overflow chains c. has a one disk-access search cost if directory fits in memory. d. does all of the above

6. For a B+ tree of order 101, consisting of 3 levels, the maximum number of leaf nodes would be a. 101 b. 303 c. 10201 d. 3 7. The insertion of a record in a B+ tree will always cause the height of the tree to increase by one when

a. the tree consists of only a root node b. the record is to be inserted into a full leaf node c. all the nodes in the path from the root to the desired leaf node are full before insertion d. all the nodes in the B+ tree are half full 8. When searching a B+ tree for a range of key values a. the search always starts at the root node b. the search always ends at a leaf node c. multiple leaf nodes may be accessed d. all of the above 9. Tracks on a disk are a. the smallest unit of access for reading/writing b. concentric circles on a platter, which are comprised of sectors c. composed of a number of cylinders d. non magnetized areas on a disk's surface 10. The average rotational latency of a disk is the average time a. it takes for a sector to rotate under the read head b. for the read head to pass over the gap between sectors c. to move the read head assembly to a cylinder d. between when the read disk block command is issued and that block appears in main memory 11. Consider a disk with the following characteristics: 8,192 cylinders, a block size of 4096 bytes, an average rotational latency of 5ms, an average seek time of 7ms, a block transfer time of 0.5ms. How much time would it take to bring in 100 blocks that are randomly stored on disk into the main memory buffer area? a. 1250ms b. 62ms c. 57ms d. 12.5ms 12. The difference between a dense index and a sparse index is that a. a dense index contains keys and pointers for a subset of the records whereas a sparse index contains keys and pointers for every record b. a dense index can only be a primary index whereas a sparse index can only be a secondary index c. a dense index contains keys and pointers for each record whereas a sparse index contains keys and pointers for a subset of the records d. no difference 13. Records in a file may be variable length because

a. the size of a data field within the record may vary b. a field within the record may be repeated a variable number of times c. a field may appear in only some of the records d. all of the above 14. The difference between files storing spanned versus unspanned records is that a. a file with spanned records will use less disk space for storing records than with unspanned records, if an integral number of records do not fit in a block b. a file with spanned records can have records that are stored on more than one disk block c. a file with spanned records must be used when the size of a record is larger than the block size d. all of the above 15. Which of the following represent possible index combinations for a file? a. one primary index and one or more secondary indexes b. one primary index and one clustered index c. one primary index, one clustered index and one secondary index d. all of the above 16. Which of the following represents a correct B tree organization of order 5?

17. One of the timing components involved with reading data from disk is the seek time, which is the time needed a. to transfer a block from disk to main memory b. for the read/write arm to be positioned on the correct track c. for the desired sector to rotate under the read/write head d. to search the main memory buffer area 18. Given the following B tree of order 3,

What would the B tree look like after deleting key value 5?

19. For a B+ tree of order 101, consisting of 3 levels, the minimum number of leaf nodes would be a. 101 b. 303 c. 102 d. 3

20. If a column of a table is designated as a foreign key, then it can be used in a a. primary index b. secondary index c. clustering index d. both b. and c. Keys: 1. d 2. d 3. c 4. c 5. d 6. c 7. c 8. d 9. b 10. a 11. a 12. c 13. d 14. d 15. a 16. d 17. b 18. c 19. c 20. d