EPFL - Databases - Quiz 3
External Sorting
1) Assume we must sort a file having N pages using external sorting, and we have 11 buffer pages available. What is the maximum number N, such that the sorting finishes in 2 passes?
100
111
110
105
2) Answer the same question as above, on condition that the sorting finishes in 3 passes.
1100
1000
1050
1110
3) Assume we double the number of buffer pages from the questions above. By how much the maximum number N of pages will increase, under condition that sorting finishes in 2 passes?
5
4
4 + 2/10
4 + 1/10
Feedback form
If you want to ask for feedback please fill in
this form
with the information of the question, of your answer and any question you may have.
Quiz script provided by
JavaScriptKit.com