Question 3 1 pts public interface Queue *Returns the number of elements in the q

Question

Question 3 1 pts public interface Queue *Returns the number of elements in the queue int size); * Tests whether the queue is empty. boolean isEmpty); Inserts an element at the rear of the queue void enqueue (Object e); *Returns, but does not remove, the first element of the queue, or null if the queue is em pty Object first); *Removes and returns the first element of the queue, or null if the queue is empty Object dequeueO; Consider the following sequence of operations on a Queue that begins empty. Give the return value for each line. If it causes an error, then write ERROR.

Explanation / Answer

dequeue(): In the queue we have A and B . Queue algorithm will follow FIFO principle. So it will remove and return A.

first(): Now we have only one element in queue. so it will return B.

dequeue(): now in queue we have B and C . so it will remove B and return B.

dequeue(): now we have only C. it will remove C and return .

dequeue():Now we hav empty queue. So it will return null.

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---

---

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