Question Detail

The complexity of merge sort algorithm is

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

Answer: Option D

Similar Questions :

1. ++i is equivalent to

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

Answer: Option B

2. How many divisions are there in COBOL language

Two
Three
Four
Five

Answer: Option C

3. The memory address of the first element of an array is called

floor address
first address
foundation address
base address

Answer: Option D

4. minimum number of stacks of size n required to implement a queue of size n

One
Two
Three
Four

Answer: Option B

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

Trees
Graphs
Array
None of above

Answer: Option C

Read more from - Data Structure Questions Answers - Chapter 1