Solved

Suppose a B-Tree of Order 5 Contains the Key Values

Question 23

Multiple Choice

Suppose a B-tree of order 5 contains the key values 20,40,60 and 70.What happens when we insert the key value 80?

A) All 5 key values can reside at the root node.
B) The root becomes 80.
C) The root becomes 60.
D) The root becomes 40.

Related Questions

Q18: Which of the following information is not

Q19: An index file consists of index records.An

Q20: Random access file organization behaves like a

Q21: In a B-tree,all leaves must be at

Q22: A file is typically partitioned into individual

Q24: When we access external data,a location that

Q25: In a 2-3 tree,if a node has

Q26: In the external mergesort algorithm,how many buffers

Q27: Name two advantages to storing a data

Q28: The technique of referencing an employee table