This question is for \" Data Structure course \". ( check the image below ) I pr

Question

This question is for "Data Structure course". (check the image below)

I prefer a brief answer & If you are going to use any programming language to solve this problem, then use JAVA language.

** Please don't provide a handwritten solution or a picture of the solution. Just post the answer here so I can read it easily.

Problem 2. Suppose that element Apple', 'Banana', 'Cake', 'Doughnut are pushed onto a stack in that order. Alice popped three elements from the stack and inserted into a queue in the order in which they were popped Describe what elements are present in the queue in what order.

Explanation / Answer

Note that stack follows the Last-in-First-out technique.
And queue follows the First-in-First-out technique.

Push instruction is called with push(element) where the element is pushed onto the stack.
And pop instruction is called with pop() where the element is popped from the top of the stack.
Insert instruction is called with insert(element) where the element will be inserted at the rear of the queue.
Delete instruction is called with delete() where the element will be deleted at the front of the queue.
So, coming to the instructions:
push('Apple'):   Pushes the element 'Apple' onto the top of the stack. And now the stack is: 'Apple'.
push('Banana'):   Pushes the element 'Banana' onto the top of the stack. And now the stack is: 'Apple', 'Banana'.
push('Cake'):   Pushes the element 'Cake' onto the top of the stack. And now the stack is: 'Apple', 'Banana', 'Cake'.
push('Doughnut'): Pushes the element 'Doughtnut' onto the top of the stack. And now the stack is: 'Apple', 'Banana', 'Cake', 'Doughnut'.

And now, popping the three elements, and inserting them into queue in that order:
insert(pop()):   Pops the top element from the stack. Here the top element is 'Doughnut', and will be popped. So, the remaining elements in the stack is: 'Apple', 'Banana', 'Cake'.
               And that will be inserted to the queue. So, the queue is now holding: 'Doughnut'.
insert(pop()):   Pops the top element from the stack. Here the top element is 'Cake', and will be popped. So, the remaining elements in the stack is: 'Apple', 'Banana'.
               And that will be inserted to the queue. So, the queue is now holding: 'Doughnut', 'Cake'.
insert(pop()):   Pops the top element from the stack. Here the top element is 'Banana', and will be popped. So, the remaining elements in the stack is: 'Apple'.
               And that will be inserted to the queue. So, the queue is now holding: 'Doughnut', 'Cake', 'Banana'.  
Now, the stack holds: 'Apple'. And it pointing to the top of the stack.
Queue holds: 'Doughnut', 'Cake', 'Banana'.   And here, front points to 'Doughnut', and rear points to 'Banana'.

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.