Question Detail

Merge sort uses

Divide and conquer strategy
Backtracking approach
Heuristic search
Greedy approach

Answer: Option A

Similar Questions :

1. ++i is equivalent to

i = i + 2
i = i + 1
i = i + i
i = i - 1

Answer: Option B

2. The complexity of merge sort algorithm is

O(n)
O(log n)
O(n2)
O(n log n)

Answer: Option D

3. Which sorting method is slowest

Quick sort
Heap sort
Shell sort
Bubble sort

Answer: Option D

4. Repeated execution of simple computation may cause compounding of

round off errors
syntax errors
run time errors
logic errors

Answer: Option A

5. Which is ALGOL based simulation language

FORTRAN
SIMSCRIPT
GASP IV
none of above

Answer: Option B

Read more from - Data Structure Questions Answers - Chapter 1