# Data Structures: MCQ Set – 10

#### Q91: Which operation is not possible on Data Structure ?

• (A) Traversing
• (B) Insertion
• (D) Deletion

#### Q92: Recursive functions are executed in a

• (A) First in first out-order
• (B) Last in first out-order
• (C) Parallel fashion

• (A) 12
• (B) 13
• (C) 14
• (D) 15

#### Q94: The complexity of linear search algorithm is

• (A) O(n)
• (B) O(log n)
• (C) O(n2)
• (D) O(n log n)

#### Q95: In-order traversal of binary search tree implies visiting the nodes in __

• (A) Post-order
• (B) The order of increasing magnitude of their key
• (C) Pre-order
• (D) The order of decreasing magnitude of their key N
• (E) Arbitrary order

#### Q96: The problem space of means-end analysis has

• (A) An initial state and one or more goal states
• (B) One or more initial states and one goal state
• (C) One or more initial states and one or more goal state
• (D) One initial state and one goal state
• (E) No goal state

• (A) data
• (B) data
• (C) data
• (D) data
• (E) data

#### Q98: Let the following circular queue can accommodate maximum six elements with the following data

front = 2 rear = 4

queue = _______; L, M, N, ___, ___

What will happen after ADD O operation takes place?

• (A) front = 2 rear = 5 queue = ______; L, M, N, O, ___
• (B) front = 3 rear = 5 queue = L, M, N, O, ___
• (C) front = 3 rear = 4 queue = ______; L, M, N, O, ___
• (D) front = 2 rear = 4 queue = L, M, N, O, ___

#### Q99: Identify the data structure which allows deletions at both ends of the list but insertion at only one end.

• (A) Input-restricted deque
• (B) Output-restricted deque
• (C) Priority queues
• (D) None of above

#### Q100: You have to sort a list L consisting of a sorted list followed by a few “random” elements. Which of the following sorting methods would be especially suitable for such a task?

• (A) Bubble sort
• (B) Selection sort
• (C) Quick sort
• (D) Insertion sort