You are running a library catalog. You know that the books in your collection are almost in sorted ascending order by title, with the exception of one book which is in the wrong place. You want the catalog to be completely sorted in ascending order.

• Insertion Sort

• Merge Sort

• Radix Sort

• Heap Sort

• Counting Sort

Which of the following sorting methods would be most suitable for sorting a list which is almost sorted?

• Bubble Sort

• Insertion Sort

• Binary Sort

• Quick Sort

What is the time complexity of the above recursive implementation used to reverse a string?

• O(1)

• O(n)

• O(n²)

• O(n³)

How many recursive calls are there in Recursive matrix multiplication by Strassen’s Method?

• 5

• 7

• 8

• 4

Which of the following statement is true about stack?

• Pop operation removes the top most

  element

• Pop operation removes the bottom most

  element

• Push operation adds new element at the

  bottom

• Push operation removes the top most

  element

Which of the following is considered as the top of the stack in the linked list implementation of the stack?

• Last node

• First node

• Random node

• Middle node

Which of the following is the biggest advantage of selection sort?

• It has low time complexity

• it has low space complexity

• it is easy to implement

• it requires only n swaps under any condition

Recursive selection sort is a comparison based sort.

• True

• False

Which of the following sorting algorithm is NOT stable?

• Selection Sort

• Bubble Sort

• Brick Sort

• Merge Sort

What is the number of swaps required to sort the array arr={5,3,2,4,1} using recursive selection sort?

• 0

• 1

• 2

• 3