FinalPart2Sp00 - EEL 4851 Final NAME_ Spring 2000 SS#_...

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

View Full Document Right Arrow Icon
EEL 4851 Final Spring 2000 NAME_____________________________ SS#_____________________________ Note: For all questions, an explanation of your answer allows me to give partial credit if the answer is wrong. 1. (Short questions 30% @ 3% each) . For each question you must explain your answer. Write neatly. I can not give you credit if I can not read your answer. A. What is the best sorting algorithm for sorting a list where the items are in a file and it takes a long time to swap the items? B. What did the Quick sort and Merge sort algorithms do to achieve a running time of ) log ( n n O ? C. The Shell sort consists of a series of insertion sort routines sorting different parts of the list at a time. Why does the Shell sort go through all of this work instead of simply doing an insertion sort once on the whole list? D. Is the problem of solving the Towers of Hanoi, which is known to take a fast computer millions of years to solve, considered an undecidable problem? Why? E. Why is it important to that the problems in the set NP are non-deterministic (makes optimal decision always)?
Background image of page 1

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

View Full DocumentRight Arrow Icon
F. Is there such a thing as an undecidable problem? Why?
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This document was uploaded on 01/14/2012.

Page1 / 6

FinalPart2Sp00 - EEL 4851 Final NAME_ Spring 2000 SS#_...

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

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