Trace a Queue (called Q) through the following operations: Queue Q = new Queue()

ID: 3691117 • Letter: T

Question

Trace a Queue (called Q) through the following operations:

Queue Q = new Queue();

Q.enqueue(new Integer(4));

Q.enqueue(new Integer(3));

//a) What is the content of the queue at this point?

Integer Y = Q.dequeue();

Q.enqueue(new Integer(7));

Q.enqueue(new Integer(2));

Q.enqueue(new Integer(5));

Q.enqueue(new Integer(9));

//b) What is the content of the queue at this point?

Integer Y = Q.dequeue();

Q.enqueue(new Integer(3));

Q.enqueue(new Integer(9));

//c) What is the content of the queue at this point?

a) queue is a datastructure which follows FIFO technique. First - IN- First- Out method.

This is just like a queue in theatres.The one who went first in one way movues first out in the other way.

queue: 4,3

4 is removed

queue: 3,7,2,5,9

remove 3 from queue

queue: 7,2,5,9,3,9

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