 |
|
#1
11-27-2011, 08:01 AM
|
||||
|
||||
cs502 midterm 2010 new***
write these word 3 different format
"MATHS and ARTS" 3marks explain the average and worst case of quick sort. 2marks how many combination of ......... (sorry i forgot) 2marks define the cost table of initial stae of 3marks suggest and describe one modification of implmenting quick sort 5marks Cs502 Design and Analysis of Algorithms time 60 mins Total 26 Questions 20 MCQs longs 2+2+3+3+5+5 Q-Write a pseudo code Fibonacci With memorization? -- (3) Sol MEMOFIB(n) 1 if (n < 2) 2 then return n 3 if (F[n] is undefined) 4 then F[n] MEMOFIB(n − 1) + MEMOFIB(n − 2) 5 return F[n] Q- How construct Optimal solution for 0/1 knapsack ? (3) Q – what is the maximum and minimum number of elements in Heap h ?? (5) Q – Write Down the steps of Dynamic programming (5) RUNNING TIME OF 2 MAXIMA RUNNING AND WORST TIME OF QUICK SORT CATALAN NUMBERS AND FORMULAE -- 3 NUMBERS NO PSEDUE CODE CAME KNAPSACK MATRIX MULTIPLICATION DIVIDE-CONQURE-COMBINE ALGORITHM IS STEP BY STEP---- 
|
|
#2
11-27-2011, 08:01 AM
|
||||
|
||||
|
thanks works great
|
|
Linear Mode
