Question Detail

Merge sort uses

Divide and conquer strategy
Backtracking approach
Heuristic search
Greedy approach

Answer: Option A

Similar Questions :

1. Which of the following data structure is linear data structure

Trees
Graphs
Array
None of above

Answer: Option C

2. O log(n) can be conneted with

Selection sort
Insertion sort
Binary sort
Merge sort

Answer: Option C

3. Which of the following name does not relate to stacks

FIFO lists
LIFO list
Piles
Push-down lists

Answer: Option A

4. Deletion from one end and insertion from other end is

stack
branch
tree
queue

Answer: Option D

5. Preorder is

depth first order
breadth first order
topological order
linear order

Answer: Option A

Read more from - Data Structure Questions Answers - Chapter 1