Short Java Questions I. (2) When using a singly linked list to implement a queue

Question

Short Java Questions

I. (2) When using a singly linked list to implement a queue, the-should be the front of the queue. a. b. c. d. head node tail node neither the head node nor the tail node either head node or tail node as both implementations have the same efficiency 2. (2) When using a singly linked list to implement a queue, the should be the rear of the queue. a. b. c. d. head node tail node neither the head node nor the tail node either head node or tail node as both implementations have the same efficiency 3. (2) The LinkedQueue class throws the EmptyCollectionException exception during operation(s) a. enqueue c. getFront e. dequeue and getFront b. dequeue d. enqueue and getFront 4. (2) Any application that could be solved using the handwritten ArrayQueue class could also be solved using the handwritten LinkedQueue class. a. True b. False 5. (2) The Java Queue interface offers a method named the queue. to insert an element to the rear of a. add b. enqueue c. insert d. poll

Explanation / Answer

1. a. head node
2. b. tail node
3. e. dequeue and getFront
4. True
5. a. add
6. a, d
7. c. Priority Queue
8. Collection<String> c = new LinkedList<String>();
9. b.add, c.contains

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

---

---

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