Stacks and Queues

1. What will be the front and rear of an initially empty queue after the following operations - enqueue(2), enqueue(11), enqueue(3), dequeue(), enqueue(8), dequeue(), enqueue(5), dequeue()
Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

2.You are given a simple queue with elements 2, 3, 8, 1, 9, 7 where 2 is the front of the queue. The elements are dequeued one-by-one and pushed into a stack, until the queue becomes empty. The elements are again popped from the stack one-by-one and enqueued into the original queue. What is the final arrangement of elements in the queue?
Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

3.What is the minimum number of stacks needed to implement a queue?

Explanation

Explanation

Explanation

Explanation

Explanation