Consider the following two scenarios in a k-way merge sort of a file.
_ The file has 20,000 pages and the buffer has 7 available frames.
_ The file has 2,000,000 pages and buffer has 15 available frames.
For each of the above scenario, answer the following questions assuming the best use of the
(a) How many initial runs will be produced?
(b) How many passes would be needed to complete the sorting?
(c) How many page I/Os would be required to sort the file?
(d) If we want to sort the file in 2 passes, how many buffer frames would be required?
This question belongs to computer science and discusses about two scenarios in a k-way merge sort of a file.
Word count: NA
Download Full Solution