Data structures and Algorithms MCQ with Answers

Data structures and Algorithms MCQ with Answers

31) Which of the following data structure may give overflow error,even though the current number of element in it is less than its size?

Answer is:

Circular queue

32) Number of ADD and REMOVE operations required to access n/2th elements of a queue of n elements so that the original queue remain the same after the access is (take help of another queue.)

Answer is:

4*n

33) The initial configuration of a queue is a, b, c, d, ('a' is in the front end). To get the configuration d, c, b, a, one needs a minimum of

Answer is:

3 deletions and 3 additions

34) Queue can be used to implement

Answer is:

radix sort

35) The data structure required to evaluate a postfix expression is

Answer is:

Stack

4
5
6
7
8
9
10