Page 1 of 1
Suppose we have N = 112 pages of fixed-length records in a heap file. We have B = 5 available pages in memory to sort th
Posted: Fri May 20, 2022 5:32 pm
by answerhappygod
- Suppose We Have N 112 Pages Of Fixed Length Records In A Heap File We Have B 5 Available Pages In Memory To Sort Th 1 (111.56 KiB) Viewed 68 times
Suppose we have N = 112 pages of fixed-length records in a heap file. We have B = 5 available pages in memory to sort the file using the external sort algorithm covered in the lectures. Work out the answers to the following questions and write the answers in the text box: 1) How many sorted runs are produced by PASS O? And how many pages does each run have? 2) How many sorted runs are produced by PASS 1? And how many pages does each run have? 3) Including PASS O, how many passes do we need to sort the file? 4) How many 1/Os are required to sort the file, excluding the writes in the last pass? 5) Suppose if we have a chance to increase the memory size to sort the file, to finish the sorting within only 2 passes, how many pages of memory do we need to allocate?