Database Query Processing Question: Q1: Q2: Refer to the question from Q1
Posted: Wed Apr 27, 2022 3:06 pm
Database Query Processing Question:
Q1:
Q2: Refer to the question from Q1
Suppose you have a file with 10000 pages and you have three buffer pages. If a most general external merge sort algorithm is used, how many runs will you produce in the first pass (pass 0)? 3334 100 3 10000 3333
Refer to the previous question. How many passes will it take to sort the file completely? (Note: an online log calculator can be found at https://www.calculator.net/log-calculator.html ) 11 10 O 3 12 O 13
Q1:
Q2: Refer to the question from Q1
Suppose you have a file with 10000 pages and you have three buffer pages. If a most general external merge sort algorithm is used, how many runs will you produce in the first pass (pass 0)? 3334 100 3 10000 3333
Refer to the previous question. How many passes will it take to sort the file completely? (Note: an online log calculator can be found at https://www.calculator.net/log-calculator.html ) 11 10 O 3 12 O 13