Question: Continuation/counting sort is suitable to sort the elements in range 1 to k?

• 1. K is Large
• 2. K is not known
• 3. K may be small or large
• 4. K is small

Question: An in place sorting algorithm is one that uses __ arrays for storage.

• 1. Two dimensional arrays
• 2. More than one array
• 3. No Additional Array
• 4. None of the above

Question: In counting sort, once we know the ranks, we simply __ numbers to their final positions in an output array.

• 1. Delete
• 2. Copy
• 3. Mark
• 4. arrange

Question: Merge sort is stable sort, but not an in-place algorithm?

• 1. True
• 2. False
• 3. NA
• 4. NA

Question: It is possible to sort without making comparisons?

• 1. True
• 2. False
• 3. NA
• 4. AN

Question: In Quick Sort Constants hidden in T(n log n) are?

• 1. Large
• 2. Medium
• 3. Small
• 4. Not Known

Question: The running time of quick sort depends heavily on the selection of?

• 1. No of inputs
• 2. Arrangement of elements in array
• 3. Size o elements
• 4. Pivot element

Question: After partitioning array in Quick sort, pivot is placed in a position such that?

• 1. Values smaller than pivot are on left and larger than pivot are on right
• 2. Values larger than pivot are on left and smaller than pivot are on right
• 3. Pivot is the first element of array
• 4. Pivot is the last element of array

Question: – What is the total time to heapify?

• 1. O(log n)
• 2. O(n log n)
• 3. O(n^2 log n)
• 4. O(log^2n)

Question: Slow sorting algorithms run in?

• 1. O(n^2)
• 2. O(n)
• 3. O( log n)
• 4. O(n log n)