quiz2 - CS351 QUIZ 2 Q: Consider an unsorted file with...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CS351 – QUIZ 2 Q: Consider an unsorted file with record size of 200 bytes and 60,000,000 records. Assume that during sorting 20 MB of sorted segments (runs) are generated using the heap sort algorithm. To obtain the final sorted file 2-way merge is used. Calculate the time needed to sort this file: indicate the times needed by both the heap sort and 2-way merge. Assume an IBM 3380 disk environment. Show your steps and work. Solution: Total file size = 60,000,000 * 200 = 12,000,000,000 bytes = 12,000 MB total number of segments(nsg) = file size / size of sorted segments = 12000 / 20 = 600
Background image of page 1
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.

Ask a homework question - tutors are online