Data Structures Algorithms MCQ (Multiple Choice Questions), Data Structures Algorithms Online Quiz

1 .

Which of the following is not the required condition for binary search algorithm?

A)

The list must be sorted

B)

There must be mechanism to delete and/or insert elements in list

C)

there should be the direct access to the middle element in any sublist

D)

None of the above

Correct Answer : Option (B) : There must be mechanism to delete and/or insert elements in list

2 .

Interpolation search is an improved variant of binary search. It is necessary for this search algorithm to work that

A)

data collection should be equally distributed but not sorted.

B)

data collection should be in sorted form and equally distributed.

C)

data collection should be in sorted form and but not equally distributed.

D)

None of the above.

Correct Answer : Option (B) : data collection should be in sorted form and equally distributed.

Explanation : For this algorithm to work properly the data collection should be in sorted form and equally distributed.

3 .

In a min-heap_______

A)

parent nodes have values greater than or equal to their childs

B)

parent nodes have values less than or equal to their childs

C)

both statements are true

D)

both statements are wrong

Correct Answer : Option (A) : parent nodes have values greater than or equal to their childs

Explanation : In a min heap, parents always have lesser or equal values than that of their childs.

4 .

What data structure is used for breadth first traversal of a graph?

A)

list

B)

stack

C)

queue

D)

None of the above

Correct Answer : Option (C) : queue

Explanation : Queue is used for breadth first traversal whereas stack is used for depth first traversal.

5 .

____ is not the component of data structure.

A)

Operations

B)

Algorithms

C)

Storage Structures

D)

None of the above

Correct Answer : Option (D) : None of the above

6 .

Which of the following data structure can't store the non-homogeneous data elements?

A)

Arrays

B)

Records

C)

Pointers

D)

None of the above

Correct Answer : Option (A) : Arrays

7 .

Travelling salesman problem is an example of_______

A)

Divide & Conquer

B)

Recursive Approach

C)

Dynamic Algorithm

D)

Greedy Algorithm

Correct Answer : Option (D) : Greedy Algorithm

Explanation : Travelling salesman is an example of greedy algorithm. Greedy algorithms tries to find localized optimum solution which may eventually land in globally optimized solutions.

8 .

Which of the following algorithm is not stable?

A)

Merge Sort

B)

Quick Sort

C)

Bubble Sort

D)

Insertion Sort

Correct Answer : Option (B) : Quick Sort

Explanation : Among the given, only quick sort is not stable that is it may re-arrange the already sorted items.

9 .

Which of the below given sorting techniques has highest best-case runtime complexity_______

A)

quick sort

B)

bubble sort

C)

selection sort

D)

insertion sort

Correct Answer : Option (C) : selection sort

10 .

If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations?

A)

Ο(1), Ο(n)

B)

Ο(1), Ο(1)

C)

Ο(n), Ο(n)

D)

Ο(n), Ο(1)

Correct Answer : Option (B) : Ο(1), Ο(1)

Explanation : As queue is maintained by two separate pointers for queue and dequeue operations, the run time for both is Ο(1).