a3 - COMPUTER SCIENCE 5443 Assignment #3 Points: 100 Due:...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
COMPUTER SCIENCE 5443 Assignment #3 Points : 100 Weight : 5% Due : April 15, 2010 at 5:30 pm in class Note : Late assignment will not be accepted without instructor’s pre–approval. The following assignment should be completed individually. Please make sure that your answer is legible. 1. [25] 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 buffer. . (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? 2. [25] Consider the join R 1 R.a = S.b S of relations R and S with the following information. R has 10,000 tuples and a blocking factor of 10.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/13/2010 for the course CS 5443 taught by Professor Wzhang during the Three '10 term at University of Technology, Sydney.

Page1 / 2

a3 - COMPUTER SCIENCE 5443 Assignment #3 Points: 100 Due:...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online