Question Detail

The complexity of linear search algorithm is

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

Answer: Option A

Similar Questions :

1. A linear list from which elements can be added or removed from either end is called

stack
queue
deque
tree

Answer: Option C

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

One
Two
Three
Four

Answer: Option B

3. Recursive problems are implemented by

queues
stacks
linked lists
strings

Answer: Option B

4. Which sorting method is slowest

Quick sort
Heap sort
Shell sort
Bubble sort

Answer: Option D

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

linear list
tree
stack
queue

Answer: Option C

Read more from - Data Structure Questions Answers - Chapter 1