Stacks and Queues in c

1. Stack is also called as :

2. Inserting an item into the stack when stack is not full is called ____ operation.

3. Deletion of item form the stack, when stack is not empty is called ____ operation.

4. ______ is used in which items are added at one end and removed from the other.

5. _______ is very useful in situation when data have to store and then retrieved in reverse order.

6. Which of the following is not a type of queue?

7. _____ is used to add and remove nodes from a queue

8. New nodes are added to the ____ of the queue

9. What happens when you push a new node onto a stack?

10. Which of the following name does not relate to stacks?

11. The term push and pop is related to

12. The elements are removed from a stack in ____ order

13. A pointer variable which contains the location at the top element of the stack is called as ______

14. Before inserting into stack one must check the following condition

15. Before deleting into stack one must check the following condition

16. The condition that indicate the queue is empty.

17. The value of rear is increased by 1 when

18. Dequeue full form

19. Which of the following operation is not performed on the queue

Match the Following