CS351HW2-Fall2009

CS351HW2-Fall2009 - CS 351 DATA ORGANIZATION AND MANAGEMENT HW2 Date Given October 7 2009 Date Due Important Notes 1 Please submit the Homework to

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

View Full Document Right Arrow Icon
CS 351 DATA ORGANIZATION AND MANAGEMENT HW2 Date Given : October 7, 2009 Date Due : October 16, 2009 Important Notes: 1. Please submit the Homework to Room EA 231 on the due date by 5:00 pm (no late submission will be accepted). 2. Answer the following 5 question in the order they are given using a standard size paper. 3. Handwritten submissions are accepted, a word document is preferred. 4. Staple all papers and write your name on them. 1. Suppose you have two track-sized buffers for processing a file of b blocks where the effective block transfer time is ebt. (For the concept of track sized buckets please refere to Salzberg’s book, p. 37.) a. If it takes 0.5 times the read time to process one block of data, what is the total processing time for the whole file? Justify your answer. b. If it takes 1.5 times the read time to process one block of data, what is the total processing time for the whole file? Justify your answer.
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 12/01/2011 for the course CS 351 taught by Professor Fazlıcan during the Spring '11 term at Bilkent University.

Page1 / 2

CS351HW2-Fall2009 - CS 351 DATA ORGANIZATION AND MANAGEMENT HW2 Date Given October 7 2009 Date Due Important Notes 1 Please submit the Homework to

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