 |
|
#1
11-27-2011, 08:35 AM
|
||||
|
||||
cs502 nov midterms 2011**
Subjective Questions cs502 midterm fall 2011 on 26-11-11
1. Suggest and describe modifications of the implementation of quick sort that will improve its performance. (05 marks) 2. Complete given cost table. (05 marks) 3. Why do we analyze the average case performance of a randomized algorithm and not its worse case performance. (03 marks) 4. Why value in row of a dynamic programming table of knapsack is always non-decreasing? (03 marks) 5. How we build heap? (02 marks) 6. Find cost of (A1(A2A3)). (02 marks) 
|
|
Linear Mode
