CS351HW3-Fall2009-V2 - CS 351 DATA ORGANIZATION AND...

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

View Full Document Right Arrow Icon
CS 351 DATA ORGANIZATION AND MANAGEMENT HW3 Date Given : October 29, 2009 Date Due : November 5, 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 questions 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. 5. When needed assume/use the parameters/values of IBM 3380. 1. Perform replacement selection sort on the following successively entered records with keys 80, 90, 39, 49, 68, 65 and then continue with the key values 100, 15, 120, 25, 35, 130. Assume 6-record memory capacity, i.e., the maximum size of the priority queue is six nodes. Show enough detail of your steps so that it will be easy to follow. 2. Consider an unordered file with 10,000,000 records of 400 bytes each with blocking factor of 6.
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