1.  Stack is used for 
Answer: (c).Recursion

2.  push() and pop() functions are found in 
Answer: (c).stacks

3.  Minimum number of queues required for priority queue implementation? 
Answer: (d).2

4.  What data structure is used for breadth first traversal of a graph? 
Answer: (a).queue

5.  A queue datastructure can be used for − 
Answer: (c).resource allocation

6.  If locality is a concern, you can use _______ to traverse the graph. 
Answer: (b).Depth First Search

7.  Aposterior analysis are more accurate than apriori analysis because − 
Answer: (b).it assumes all other factors to be dynamic.

8.  Prefix notation is also known as 
Answer: (d).Polish Notation

9.  In conversion from prefix to postfix using stack datastructure, if operators and operands are pushed and popped exactly once, then the runtime complexity is 
Answer: (b).Ο(n)

10.  If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations? 
Answer: (d).Ο(1), Ο(1)
