Top 150+ Data Structure Quiz Questions and Answers - 1

Question: 1

The average case complexity of quick sort for sorting n numbers is

(A) O(n²)

(B) O(nlog₂n)

(C) O(n)

(D) O(log₂n)

Question: 2

A dequeue operation removes an element

(A) From the front of the queue

(B) From any place in the queue

(C) From the rear of the queue

(D) None of above

Question: 3

What is the minimum number of nodes in a complete binary tree with depth 3?

(A) 4

(B) 5

(C) 6

(D) 7

Question: 4

What is the number of nodes in a full binary tree with depth 3?

(A) 5

(B) 6

(C) 7

(D) 8

Question: 5

Which of the following operation is not supported by a queue?

(A) Inserting element at rear

(B) Removing element from front

(C) Removing element from middle

(D) None of above