Question Detail

O log(n) can be conneted with

Selection sort
Insertion sort
Binary sort
Merge sort

Answer: Option C

Similar Questions :

1. Sort which compares adjacent elements in a list and switches where necessary is

Insertion sort
Heap sort
Quick sort
Bubble sort

Answer: Option D

2. Which data structure is needed to convert infix notations to postfix notations

linear list
tree
stack
queue

Answer: Option C

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

One
Two
Three
Four

Answer: Option B

4. Repeated execution of simple computation may cause compounding of

round off errors
syntax errors
run time errors
logic errors

Answer: Option A

5. The complexity of linear search algorithm is

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

Answer: Option A

Read more from - Data Structure Questions Answers - Chapter 1