midterm-sample

midterm-sample - A have the same value[27 4 What are the...

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

View Full Document Right Arrow Icon
CMPT 307 Midterm Test Some Day, 2009 This is a sample! Last Name First Name and Initials Student No. NO AIDS allowed. Answer ALL questions on the test paper. Use backs of sheets for scratch work. Total Marks: 100 1. What running times of the insertion sot, heap sort, quick sort, and bucket sort are? [5] 2. Describe how the Radix Sort works. [27] 3. What is the running time of Quicksort whe all elements of array
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: A have the same value? [27] 4. What are the two ways to resolve collisions when constructing a hash table? [14] 5. Suppose that you have a “black box” worst-case linear time median sub-routing. Give a simple, linear time algorithm that solves the selection problem for an arbitrary order statistics. [27]...
View Full Document

This note was uploaded on 11/19/2009 for the course CS CMPT 307 taught by Professor A.bulatov during the Fall '09 term at Simon Fraser.

Ask a homework question - tutors are online