5. Trace a queue (called Q) through the following operations: Queue Integer > Q = new...

  

Transcribed Image Text:

5. Trace a queue (called Q) through the following operations: Queue Integer > Q = new Queue <Integer >(); Q. enqueue (new Integer (3)); Integer X Q. dequeue (); Q. enqueue (new Integer (12)); Q. enqueue (new Integer (5)); Q. enqueue (new Integer (1) ); Integer Y Q. first (); = Q. enqueue (new Integer (9)); Integer Z = Q. dequeue (); (a) What is the value of Y after it has been assigned? [2 points] (b) Give the contents of the queue after the code has been executed. Indicate the elements in order and label the front. [2 points] 5. Trace a queue (called Q) through the following operations: Queue Integer > Q = new Queue <Integer >(); Q. enqueue (new Integer (3)); Integer X Q. dequeue (); Q. enqueue (new Integer (12)); Q. enqueue (new Integer (5)); Q. enqueue (new Integer (1) ); Integer Y Q. first (); = Q. enqueue (new Integer (9)); Integer Z = Q. dequeue (); (a) What is the value of Y after it has been assigned? [2 points] (b) Give the contents of the queue after the code has been executed. Indicate the elements in order and label the front. [2 points]

Answer rating: 100% (QA)

a It appears that there is a typo in the question The vari... View the full answer