Stacks and Queues: Important Questions

Data Structures using C ++

Chapter 4: Stacks and Queues

Important Questions

1. Explain the ADT operations for array implementation of stack.

2. Write C++ program to implement stack and its operations PUSH and POP.

3. Explain the operations preformed by stack in detail. Write a C++ program to implement these operations.

4. Write the ADT operation for insertion and deletion routine in stack.

5. With examples explain how a stack can be used to convert an infix expression to a postfix expression.

6. Explain the applications of stack in detail.

7. Explain the process of conversion from infix expression to postfix using stack.

8. What is Queue? Explain by comparing with stack.

9. What is circular queue ? Implement insert and delete operations.

10. What is queue? With algorithms explain about the various operations performed on queues.

11. Write ADT operations for array implementation of a queue.

OR Explain how queues can be implemented using arrays

12. Write algorithms to insert an element into a stack and a queue. Can stack be used for recursion? Justify your answer.

13. Explain the operations performed on QUEUE in detail. Write a C++ program to implement these QUEUE operations.

14. Write pseudo code for insertion and deletion from queue.

15. Develop an algorithm to implement Queue ADT. Give relevant examples and diagrammatic representation.