Multiple Choice
In the external version of mergesort,if we begin by performing 16 sorted runs with 1 block each,what is the next step?
A) 1 sorted run,16 blocks each
B) 2 sorted runs,8 blocks each
C) 4 sorted runs,4 blocks each
D) 8 sorted runs,2 blocks each
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q4: Let N be a node in a
Q5: A 2-3 tree is a type of
Q6: What is the maximum number of nodes
Q7: Inserting a single key value into a
Q8: Why is random access preferable over sequential
Q10: In a binary search tree,if a node
Q11: If a B-tree of order 5 contains
Q12: When deleting a key value from a
Q13: Which statement is true about B-trees?<br>A)Traversals of
Q14: How does a search of a key