Question

a) Write an algorithm (implement in Java) that provides queue functionality using a stack data structure and stack operations. You should provide operations to enqueue new elements, dequeue elements, peek at the value of the 'next' element for dequeuing, and test if the queue is empty. b) Demonstrate its operation using a small dataset (such as \{3, 8, 6, 2\}) of mask sizes (child and adult only).

          a) Write an algorithm (implement in Java) that provides queue functionality using a stack data
structure and stack operations. You should provide operations to enqueue new elements, dequeue
elements, peek at the value of the 'next' element for dequeuing, and test if the queue is empty.
b) Demonstrate its operation using a small dataset (such as \{3, 8, 6, 2\}) of mask sizes (child and
adult only).

a) Write an algorithm (implement in Java) that provides queue functionality using a stack data
structure and stack operations. You should provide operations to enqueue new elements, dequeue
elements, peek at the value of the 'next' element for dequeuing, and test if the queue is empty.
b) Demonstrate its operation using a small dataset (such as {3, 8, 6, 2}) of mask sizes (child and
adult only).

Added by Chad S.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Lien Le

Step 1

util.Stack; public class QueueUsingStack { private Stack<Integer> stack1; private Stack<Integer> stack2; public QueueUsingStack() { stack1 = new Stack<>(); stack2 = new Stack<>(); } public void enqueue(int element) { Show more…

Show all steps

Thanks for your feedback!

a) Write an algorithm (implemented in Java) that provides queue functionality using a stack data structure and stack operations. You should provide operations to enqueue new elements, dequeue elements, peek at the value of the 'next' element for dequeuing, and test if the queue is empty. b) Demonstrate its operation using a small dataset (such as {3, 8, 6, 2}) of mask sizes (child and adult only).