CS502 DESIGN AND ANALYSIS OF ALGORITHMS fall 2010 quiz

[Xpert]

[FONT=&quot]
[/FONT]
[FONT=&quot]CS502 DESIGN AND ANALYSIS OF ALGORITHMS[/FONT]
[FONT=&quot]FALL 2010 QUIZ #2 HELD ON 12 NOV 2010[/FONT]
[FONT=&quot]Question # 1 of 10 Total Marks: 1[/FONT]
[FONT=&quot]Memorization is?[/FONT]
[FONT=&quot]1. To store previous results for future use[/FONT]
[FONT=&quot]2. To avoid this unnecessary repetitions by writing down the results of[/FONT]
[FONT=&quot]recursive calls and looking them up again if we need them later[/FONT]
[FONT=&quot]3. To make the process accurate[/FONT]
[FONT=&quot]4. None of the above[/FONT]
[FONT=&quot]Question # 2 of 10 Total Marks: 1[/FONT]
[FONT=&quot]Which sorting algorithm is faster[/FONT]
[FONT=&quot]1. O (n log n)[/FONT]
[FONT=&quot]2. O n^2[/FONT]
[FONT=&quot]3. O (n+k)[/FONT]
[FONT=&quot]4. O n^3[/FONT]
[FONT=&quot]Question # 3 of 10 Total Marks: 1[/FONT]
[FONT=&quot]Quick sort is[/FONT]
[FONT=&quot]1. Stable & in place[/FONT]
[FONT=&quot]2. Not stable but in place[/FONT]
[FONT=&quot]3. Stable but not in place[/FONT]
[FONT=&quot]4. Some time stable & some times in place[/FONT]
[FONT=&quot]Question # 4 of 10 Total Marks: 1[/FONT]
[FONT=&quot]One example of in place but not stable algorithm is[/FONT]
[FONT=&quot]1. Merger Sort[/FONT]
[FONT=&quot]2. Quick Sort[/FONT]
[FONT=&quot]3. Continuation Sort[/FONT]
[FONT=&quot]4. Bubble Sort[/FONT]
[FONT=&quot]Question # 5 of 10 Total Marks: 1[/FONT]
[FONT=&quot]In Quick Sort Constants hidden in T(n log n) are[/FONT]
[FONT=&quot]1. Large[/FONT]
[FONT=&quot]2. Medium[/FONT]
[FONT=&quot]3. Small[/FONT]
[FONT=&quot]4. Not Known[/FONT]
[FONT=&quot]Question # 6 of 10 Total Marks: 1[/FONT]
[FONT=&quot]Continuation sort is suitable to sort the elements in range 1 to k[/FONT]
[FONT=&quot]1. K is Large[/FONT]
[FONT=&quot]2. K is not known[/FONT]
[FONT=&quot]3. K may be small or large[/FONT]
[FONT=&quot]4. K is small[/FONT]
[FONT=&quot]Question # 7 of 10 Total Marks: 1[/FONT]
[FONT=&quot]In stable sorting algorithm.[/FONT]
[FONT=&quot]1. If duplicate elements remain in the same relative position after sorting[/FONT]
[FONT=&quot]2. One array is used[/FONT]
[FONT=&quot]Imrangee[/FONT]
[FONT=&quot]3. More than one arrays are required[/FONT]
[FONT=&quot]4. Duplicating elements not handled[/FONT]
[FONT=&quot]Question # 8 of 10 Total Marks: 1[/FONT]
[FONT=&quot]Which may be a stable sort?[/FONT]
[FONT=&quot]1. Merger[/FONT]
[FONT=&quot]2. Insertion[/FONT]
[FONT=&quot]3. Both above[/FONT]
[FONT=&quot]4. [/FONT][FONT=&quot]None [/FONT][FONT=&quot]of the above[/FONT]
[FONT=&quot]Question # 9 of 10 Total Marks: 1[/FONT]
[FONT=&quot]An in place sorting algorithm is one that uses ___ arrays for storage[/FONT]
[FONT=&quot]1. Two dimensional arrays[/FONT]
[FONT=&quot]2. More than one array[/FONT]
[FONT=&quot]3. No Additional Array[/FONT]
[FONT=&quot]4. None of the above[/FONT]
[FONT=&quot]Question # 10 of 10 Total Marks: 1[/FONT]
[FONT=&quot]Continuing sort has time complexity of ?[/FONT]
[FONT=&quot]1. O(n)[/FONT]
[FONT=&quot]2. O(n+k)[/FONT]
[FONT=&quot]3. O(nlogn)[/FONT]
[FONT=&quot]4. O(k)[/FONT]