Example Code Ch 13-5
Consider the following operations on a queue data structure that stores int values:
Queue q = new Queue();
q.enqueue(3);
q.enqueue(5);
q.enqueue(9);
System.out.println(q.dequeue()); // d1
q.enqueue(2);
q.enqueue(4);
System.out.println(q.dequeue()); // d2
System.out.println(q.dequeue()); // d3
q.enqueue(1);
q.enqueue(8);
-Refer to Example Code Ch 13-5: What value is returned by the last dequeue operation, denoted with a d3 as a comment.
A) 3
B) 5
C) 9
D) 2
E) 4

Question

Quizplus · Accepted Answer

Based on the operations performed, the queue currently stores the values 2, 4, 1, and 8. The next value to be dequeued is the first item that was added to the queue, which was 9. Therefore, the last dequeue operation will return the value 9.