Question Detail

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

One
Two
Three
Four

Answer: Option B

Similar Questions :

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

linear list
tree
stack
queue

Answer: Option C

2. Which is problem oriented language

BASIC
PL/I
FORTRAN
none of above

Answer: Option D

3. Merge sort uses

Divide and conquer strategy
Backtracking approach
Heuristic search
Greedy approach

Answer: Option A

4. Preorder is

depth first order
breadth first order
topological order
linear order

Answer: Option A

5. Which statement we should ignore in structure programming

WHILE-DO
GO-TO
IT-ELSE
SWITCH

Answer: Option B

Read more from - Data Structure Questions Answers - Chapter 1