Database Query Processing Question Q1 Q2 Refer To The Question From Q1 1 (19.72 KiB) Viewed 58 times
Q2: Refer to the question from Q1
Database Query Processing Question Q1 Q2 Refer To The Question From Q1 2 (17.05 KiB) Viewed 58 times
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
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!