cs351project1report

cs351project1report - method faster by using binary search...

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

View Full Document Right Arrow Icon
Orhun Alp Oral 20801143 Section: 1 CS351 – Project 1 Report 1. Write execution times for Part A, B and C in terms of ms (milliseconds). Order the execution times. Execution time for part A: 733032 ms. Execution time for part B: 374566 ms. Execution time for part C: 355622 ms 2. Which case did perform the best? Did you expect these results? Explain. Part C has performed the best. I expected this result; because since the CPU time is more efficent than the I/O operations at part C we decreased the input operations therefore there is a high time difference between part A and we make the
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: method faster by using binary search algorithm instead of sequencial search algorithms by doing this we also make the algorithm more efficent than part B. 3. Which case did perform the worst? Did you expect these results? Explain Part A has performed the worst. I expected this result; because at part A we have used the least efficent algorithm for making intersection files. For each record we have opened and closed a connection through the file. We also did not fetch the records in to our main memory....
View Full Document

This note was uploaded on 02/19/2011 for the course MATH 315 taught by Professor Selcuk during the Fall '10 term at Bilkent University.

Ask a homework question - tutors are online