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
Q11: The maximum number of records in a
Q12: An index file consists of index records.An
Q13: A file is typically partitioned into individual
Q14: In a 2-3 tree,if a node has
Q15: A 2-3 tree is a type of
Q17: Let N be a node in a
Q18: In a B-tree,the key values at each
Q19: Which statement is true about B-trees?
A)Traversals of
Q20: In a binary search tree,if a node
Q21: How does a search of a key
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents