Sorting and Searching Mcqs

Our collections of Multiple choice questions and answers focuses on study of ” Sorting and Searching ” in Data Structures. These questions are chosen from a collection of most authoritative and best reference books on Data Structures. Our aim is to prepare an individual for competitive exams like NTS | GAT | ECAT | Data Warehouse jobs | Data Mining | DB administration jobs Software House and Computer Programmer jobs | University and College entrance exams and various tests and job interviews. One should practice our Mcqs to assimilate Sorting and Searching comprehensively.

  1. Home
  2. »
  3. Computer Science Mcqs
  4. »
  5. Data Structures Mcqs
  6. »
  7. Sorting and Searching Mcqs
  8. »
  9. Page 2

16.
An adaptive sorting algorithm −

Adapts to new computers.

Takes advantage of already sorted elements.

Takes input which is already sorted.

None of the above.

17.
An array sorted in the reverse order is the __________ case input.

Worst

Best

Somewhat bad

None of the above

18.
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

Heap sort

Bubble sort

Selection sort

Insertion sort

19.
At most, how many comparisons are required to search a sorted vector of 1023 elements using the binary search algorithm?

10

15

20

30

20.
A________search begins the search with the element that is located in the middle of the array.

Serial

Parallel

Random

Binary Search

21.
Binary search algorithm can not be applied to

Sorted linked list

Sorted binary trees

Sorted linear array

Pointer array

22.
Binary Search can be categorized into which of the following?

Brute Force technique

Divide and conquer

Greedy algorithm

Dynamic programming

23.
Brute-force search, commonly known as_________.

Naive algorithm

Uninformed algorithm

Both (a) and (b)

Search algorithm

28.
Choose the correct statements

External sorting needs auxilary storage

External sorting is used if the number of items to be sorted is very large.

Both (a) and (b)

Internal sorting is used if the number of items to be sorted is very large.

29.
Choose the recursive formula for the Fibonacci series.(n>=1)

F(n) = F(n+1) + F(n+2)

F(n) = F(n) + F(n+1)

F(n) = F(n-1) + F(n-2)

F(n) = F(n-1) – F(n-2)

30.
Compared to insertion sort, _________ are more advanced algorithms.

Quick sort

Heap sort

Merge sort

All of the above

error: You are not allowed to do so.....
0Shares
0
Scroll to Top