3-HW-dueNov13

3-HW-dueNov13 - /2 n T(1 = 1 T n = 4 T n/2 n 2 T(1 = 1 T n...

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

HW 3 CSC 3102: Advanced data structures and algorithmic analysis Due: 11/13, Thursday Name: Answer any six questions. Each question is 0.5 points worth so the total point is 3. Submit a hard copy of your answers during the class time. No late submission will be allowed. 1. Answer the question 4 from the exercises 3.4. Complete the application of exhaustive search to solve the instance of the assignment problem started in the textbook (also see lecture note on Brute Force). 2. Solve the question 6 from the exercises 4.1 to sort the list E, X, A, M, P, L, E. in the alphabetical order using the mergesort algorithm. 3. Solve the following recurrence relations using Master Theorem. T ( n ) = 4 T ( n
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: /2)+ n , T (1) = 1 T ( n ) = 4 T ( n /2)+ n 2 , T (1) = 1 T ( n ) = 4 T ( n /2)+ n 3 , T (1) = 1 4. Generate all permutations of {1, 2, 3, 4} by Johnson-Trotter algorithm. 5. Apply the partition-based algorithm to find the median of the list of numbers 4, 1, 11, 9, 7, 13, 8, 3, 18. 6. Does the partition-based algorithm used in question 5 qualify for the variable-size-decrease approach? Justify your answer. 7. Give specific examples of inputs that make the quickhull algorithm run in linear time (the best-case) and quadratic time (the worst-case). 8. Answer the question 7 from the Exercise 4.2 to solve the average-case recurrence for quicksort....
View Full Document

This note was uploaded on 10/06/2009 for the course CSC 3102 taught by Professor Kraft,d during the Fall '08 term at LSU.

Ask a homework question - tutors are online