CA mcq

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

• Selection Sort
• Bubble Sort
• Quick Sort
• Insertion Sort

The way a card game player arranges his cards as he picks them one by one can be compared to

• Merge sort
• Bubble sort
• Quick sort
• Insertion sort

As part of the maintenance work, you are entrusted with the work of rearranging the library books in a shelf in proper order, at the end of each day. The ideal choice will be

• Merge sort
• Bubble sort
• Quick sort
• Insertion sort

Heap is defined to be a

• binary tree
• tree structure
• complete binary tree
• None of the above

Big O(O) notation looks for____________ value.

• Minimum
• Maximum
• Mean
• Average

Suppose our aim is to sort an array in ascending order. Which of the following statements is true?

• Input in descending order is worst case for selection sort but not for insertion sort
• Input in ascending order is worst case for insertion sort but not for selection sort.
• Input in ascending order is worst case for both selection sort and insertion sort.
• Input in descending order is worst case for both selection sort and insertion sort

Indicate constant time complexity in terms of Big-O notation

• O(logn)
• O(n)
• O(1)
• O(n^2)

The running time of an algorithm is given by T(n) = 8T(n/2) + qn, if n>1 = p, if n=1 where p, q are constants. The order of this algorithm is—

• n2
• n
• n3
• nn

The Average case occurs in the linear search algorithm ……….

• when the item is not the array at all
• when the item is somewhere in the middle of the array
• when the item is the last element in the array
• Item is the last element in the array or item is not there at all

An algorithm in which we divide the problem into subproblem and then we combine the subsolutions to form solution to the original problem is known as _________

• Greedy Algorithm
• Divide and Conquer
• Dynamic Programming
• None of the mentioned