True/False (10)

Chapter 10 - Queues, Deques, and Priority Queues

1. Queues are used in operating systems.

2. The item most recently added to a queue is at the back of the queue.

3. Unlike a stack, a queue does not restrict access to its entries.

4. The Java Class Library interface for Queue has no operation to modify the contents of the front

entry.

5. You can push, pop and get items at either end of the ADT deque.

6. The Queue interface extends the Deque interface.

7. A priority queue cannot have null entries

8. The null value can be used to signal failure to remove or retrieve an entry from a priority queue

when it is empty.

9. The Java Class Library ADT PriorityQueue uses the compareTo method to determine how to

order entries.

10. The ArrayDeque class implements the Stack interface.