CHAPTER 4

Queues
Chapter Objectives
 To learn how to represent a waiting line (queue) and how to
use the methods in the Queue interface for insertion (offer
and add), removal (remove and poll), and for accessing the
element at the front (peek and element)
 To understand how to implement the Queue interface using a
single-linked list, a circular array, and a double-linked list
 To become familiar with the Deque interface and how to use
its methods to insert and remove items from either end of a
deque
 To understand how use Queues and random number
generators to simulate the operation of a physical system
that has one or more waiting lines
Queue
 The queue, like the stack, is a widely used data
structure
 A queue differs from a stack in one important way
A stack is LIFO list – Last-In, First-Out
 while a queue is FIFO list, First-In, First-Out
Queue Abstract Data Type
Section 4.1
Queue Abstract Data Type
 A queue can be visualized as a line of customers waiting for
service
 The next person to be served is the one who has waited the
longest
 New elements are placed at the end of the line
Print Queue
 Operating systems use queues to
 keep track of tasks waiting for a scarce resource
 ensure that the tasks are carried out in the order they were
generated
 Print queue: printing is much slower than the process of
selecting pages to print, so a queue is used
Unsuitability of a Print Stack
 Stacks are Last-In, First-Out (LIFO)
 The most recently selected document would be the
next to print
 Unless the printer stack is empty, your print job may
never be executed if others are issuing print jobs
Using a Queue for Traversing a
Multi-Branch Data Structure
 A graph models a network of nodes,
with links connecting nodes
to other nodes in the network
 A node in a graph may have several
neighbors
 Programmers doing a breadth-first traversal often use a
queue to ensure that nodes closer to the starting point
are visited before nodes that are farther away
 You can learn more about graph traversal in Chapter
10
Specification for a Queue Interface

 The Queue interface implements the Collection interface

(and therefore the Iterable interface), so a full
implementation of Queue must implement all required
methods of Collection (and the Iterable interface)
Class LinkedList Implements the
Queue Interface
 The LinkedList class provides methods for inserting and
removing elements at either end of a double-linked list,
which means all Queue methods can be implemented easily
 The Java 5.0 LinkedList class implements the Queue interface
Queue<String> names = new LinkedList<String>();

 creates a new Queue reference, names, that stores references to

String objects
 The actual object referenced by names is of type
LinkedList<String>, but because names is a type
Queue<String> reference, you can apply only the Queue methods
to it
Maintaining a Queue of Customers
Section 4.2
Maintaining a Queue of Customers

 Write a menu-driven program that maintains a list

of customers
 The user should be able to:
 inserta new customer in line
 display the customer who is next in line

 remove the customer who is next in line

 display the length of the line

 determine how many people are ahead of a specified

person
Designing a Queue of Customers
 Use JOptionPane.showOptionDialog() for the menu
 Use a queue as the underlying data structure
 Write a MaintainQueue class which has a
Queue<String> component customers
Designing a Queue of Customers
(cont.)
Algorithm for processCustomers
1. while the user is not finished
2. Display the menu and get the selected operation
3. Perform the selected operation

Algorithm for determining the position of a Customer

1. Get the customer name
2. Set the count of customers ahead of this one to 0
3. for each customer in the queue

4. if the customer is not the one sought

5. increment the counter

6. else

7. display the count of customers and exit the loop

8. if all the customers were examined without success

9. display a message that the customer is not in the queue

Implementing a Queue of Customers

 Listing 4.1(MaintainQueue, page 202)

 Listing 4.2 (method processCustomers in
Class MaintainQueue, pages 203-204)
Implementing the Queue Interface
Section 4.3
Using a Double-Linked List to
Implement the Queue Interface
 Insertion and removal from either end of a double-linked list
is O(1) so either end can be the front (or rear) of the queue
 Java designers decided to make the head of the linked list
the front of the queue and the tail the rear of the queue
 Problem: If a LinkedList object is used as a queue, it will be
possible to apply other LinkedList methods in addition to
the ones required and permitted by the Queue interface
 Solution: Create a new class with a LinkedList component
and then code (by delegation to the LinkedList class) only
the public methods required by the Queue interface
Using a Single-Linked List to
Implement a Queue
 Insertions are at the rear of a queue and removals
are from the front
 We need a reference to the last list node so that
insertions can be performed at O(1)
 The number of elements in the queue is changed by
methods insert and remove

 Listing 4.3 (ListQueue, pages 208-209)

Implementing a Queue Using a
Circular Array
 The time efficiency of using a single- or double-linked list to
implement a queue is acceptable
 However, there are some space inefficiencies
 Storage space is increased when using a linked list due to
references stored in the nodes
 Array Implementation
 Insertion at rear of array is constant time O(1)
 Removal from the front is linear time O(n)
 Removal from rear of array is constant time O(1)
 Insertion at the front is linear time O(n)
 We now discuss how to avoid these inefficiencies in an array
Implementing a Queue Using a
Circular Array (cont.)
Implementing a Queue Using a
Circular Array (cont.)
 Implementing a Queue Using a
Circular Array (cont.)
ArrayQueue q = new ArrayQueue(5);

front = 0 size = 0
capacity = 5

public ArrayQueue(int initCapacity) {

capacity = initCapacity;
theData = (E[])new Object[capacity];
rear = 4
front = 0;
rear = capacity – 1;
size = 0;
}
 Implementing a Queue Using a
Circular Array (cont.)
q.offer('*');

front = 0 * size = 0
1
rear = 0 capacity = 5

public boolean offer(E item) {

if (size == capacity) {
reallocate();
rear = 4
}
size++;
rear = (rear + 1) % capacity;
theData[rear] = item;
return true;
}
 Implementing a Queue Using a
Circular Array (cont.)
q.offer('+');

front = 0 * size = 1
2
rear = 0 capacity = 5
rear = 1 +

public boolean offer(E item) {

if (size == capacity) {
reallocate();
}
size++;
rear = (rear + 1) % capacity;
theData[rear] = item;
return true;
}
 Implementing a Queue Using a
Circular Array (cont.)
q.offer('/');

front = 0 * size = 32
capacity = 5
rear = 1 +

rear = 2 /
public boolean offer(E item) {
if (size == capacity) {
reallocate();
}
size++;
rear = (rear + 1) % capacity;
theData[rear] = item;
return true;
}
 Implementing a Queue Using a
Circular Array (cont.)
q.offer('-');

front = 0 * size = 43
capacity = 5
+

rear = 2 /
public boolean offer(E item) {
rear = 3 - if (size == capacity) {
reallocate();
}
size++;
rear = (rear + 1) % capacity;
theData[rear] = item;
return true;
}
 Implementing a Queue Using a
Circular Array (cont.)
q.offer('A');

front = 0 * size = 54
capacity = 5
+

/
public boolean offer(E item) {
rear = 3 - if (size == capacity) {
reallocate();
rear = 4 A }
size++;
rear = (rear + 1) % capacity;
theData[rear] = item;
return true;
}
 Implementing a Queue Using a
Circular Array (cont.)
next = q.poll();

front = 0 * size = 5
4
capacity = 5
front = 1 +

/
public E poll() {
- if (size == 0) {
return null
rear = 4 A }
E result = theData[front];
front = (front + 1) % capacity;
size--;
return result;
result = '*' }
 Implementing a Queue Using a
Circular Array (cont.)
next = q.poll();

* size = 4
3
capacity = 5
front = 1 +

front = 2 /
public E poll() {
- if (size == 0) {
return null
rear = 4 A }
E result = theData[front];
front = (front + 1) % capacity;
size--;
return result;
result = '+' }
 Implementing a Queue Using a
Circular Array (cont.)
q.offer('B');

rear = 0 B
* size = 3
4
capacity = 5
+

front = 2 /
public boolean offer(E item) {
- if (size == capacity) {
reallocate();
rear = 4 A }
size++;
rear = (rear + 1) % capacity;
theData[rear] = item;
return true;
}
 Implementing a Queue Using a
Circular Array (cont.)
q.offer('C');

rear = 0 B size = 4
5
capacity = 5
rear = 1 C
+

front = 2 /
public boolean offer(E item) {
- if (size == capacity) {
reallocate();
A }
size++;
rear = (rear + 1) % capacity;
theData[rear] = item;
return true;
}
 Implementing a Queue Using a
Circular Array (cont.)
q.offer('D');

B size = 5
capacity = 5
rear = 1 C
+

front = 2 /
public boolean offer(E item) {
- if (size == capacity) {
reallocate();
A }
size++;
rear = (rear + 1) % capacity;
theData[rear] = item;
return true;
}
 Implementing a Queue Using a
Circular Array (cont.) theData

q.offer('D'); B

rear = 1 C
+
B size = 5
front = 2 /
capacity = 5
rear = 1 C
+ -
A
front = 2 /
private void reallocate() {
- int newCapacity = 2 * capacity;
E[] newData = (E[])new Object[newCapacity];
A int j = front;
for (int i = 0; i < size; i++) {
newData[i] = theData[j];
j = (j + 1) % capacity;
}
front = 0;
rear = size – 1;
capacity = newCapacity;
theData = newData;
newCapacity = 10 }
Implementing a Queue Using a Circular Array
(cont.) newData
theData

i = 0 B
q.offer('D');
rear = 1 C
+
size = 5 j = 2
front = 2 /
capacity = 5
-
A

private void reallocate() {

int newCapacity = 2 * capacity;
E[] newData = (E[])new Object[newCapacity];
int j = front;
for (int i = 0; i < size; i++) {
newData[i] = theData[j];
j = (j + 1) % capacity;
}
front = 0;
rear = size – 1;
capacity = newCapacity;
theData = newData;
newCapacity = 10 }
 Implementing a Queue Using a Circular Array
(cont.) newData
theData

i = 0 / B
q.offer('D');

i = 1 rear = 1 C
+
size = 5 j = 2
front = 2 /
capacity = 5 j = 3
-
A

private void reallocate() {

int newCapacity = 2 * capacity;
E[] newData = (E[])new Object[newCapacity];
int j = front;
for (int i = 0; i < size; i++) {
newData[i] = theData[j];
j = (j + 1) % capacity;
}
front = 0;
rear = size – 1;
capacity = newCapacity;
theData = newData;
newCapacity = 10 }
 Implementing a Queue Using a Circular Array
(cont.) newData
theData

/ q.offer('D'); B

i = 1 - rear = 1 C
+
size = 5
front = 2 /
i = 2 capacity = 5 j = 3
-
A j = 4

private void reallocate() {

int newCapacity = 2 * capacity;
E[] newData = (E[])new Object[newCapacity];
int j = front;
for (int i = 0; i < size; i++) {
newData[i] = theData[j];
j = (j + 1) % capacity;
}
front = 0;
rear = size – 1;
capacity = newCapacity;
theData = newData;
newCapacity = 10 }
 Implementing a Queue Using a Circular Array
(cont.) newData
theData

/ B j = 0
q.offer('D');
- rear = 1 C
+
size = 5
front = 2 /
i = 2 A
capacity = 5
-
i = 3 A j = 4

private void reallocate() {

int newCapacity = 2 * capacity;
E[] newData = (E[])new Object[newCapacity];
int j = front;
for (int i = 0; i < size; i++) {
newData[i] = theData[j];
j = (j + 1) % capacity;
}
front = 0;
rear = size – 1;
capacity = newCapacity;
theData = newData;
newCapacity = 10 }
 Implementing a Queue Using a Circular Array
(cont.) newData
theData

/ q.offer('D'); B j = 0

rear = 1 C j = 1
- +
size = 5
front = 2 /
A
capacity = 5
-
i = 3 B A

i = 4
private void reallocate() {
int newCapacity = 2 * capacity;
E[] newData = (E[])new Object[newCapacity];
int j = front;
for (int i = 0; i < size; i++) {
newData[i] = theData[j];
j = (j + 1) % capacity;
}
front = 0;
rear = size – 1;
capacity = newCapacity;
theData = newData;
newCapacity = 10 }
 Implementing a Queue Using a Circular Array
(cont.) newData
theData

/ q.offer('D'); B

rear = 1 C j = 1
- +
size = 5 j = 2
front = 2 /
A
capacity = 5
-
B A

i = 4 C
private void reallocate() {
i = 5 int newCapacity = 2 * capacity;
E[] newData = (E[])new Object[newCapacity];
int j = front;
for (int i = 0; i < size; i++) {
newData[i] = theData[j];
j = (j + 1) % capacity;
}
front = 0;
rear = size – 1;
capacity = newCapacity;
theData = newData;
newCapacity = 10 }
Implementing a Queue Using a Circular Array
(cont.) newData
theData

front = 0 / q.offer('D'); B

- rear = 1 C
+
size = 5 j = 2
front = 2 /
A 10
capacity = 5
-
B A

rear = 4 C
private void reallocate() {
i = 5 int newCapacity = 2 * capacity;
E[] newData = (E[])new Object[newCapacity];
int j = front;
for (int i = 0; i < size; i++) {
newData[i] = theData[j];
j = (j + 1) % capacity;
}
front = 0;
rear = size – 1;
capacity = newCapacity;
theData = newData;
newCapacity = 10 }
Implementing a Queue Using a Circular Array
(cont.) theData

front = 0 / q.offer('D');
-
size = 5
6
A 10
capacity = 5
B

rear = 4 C
public boolean offer(E item) {
rear = 5 D
if (size == capacity) {
reallocate();
}
size++;
rear = (rear + 1) % capacity;
theData[rear] = item;
return true;
}
Implementing a Queue Using a
Circular Array (cont.)
 Listing 4.4 (ArrayQueue, pages 212-214)
Implementing Class
ArrayQueue<E>.Iter (cont.)
private class Iter implements
• Just as for class Iterator<E> {
ListQueue<E>, we must private int index;
implement the missing private int count = 0;
Queue methods and an inner
class Iter to fully implement public Iter() {
the Queue interface index = front;
}

@Override
public boolean hasNext() {
return count < size;
}

....
Implementing Class
ArrayQueue<E>.Iter (cont.)
private class Iter implements
• Just as for class Iterator<E> {
ListQueue<E>, we must private int index;
implement the missing private int count = 0;
Queue methods and an inner
class Iter to fully implement public Iter() {
the Queue interface index = front;
}

index stores the subscript @Override

of the next element to be public boolean hasNext() {
accessed return count < size;
}

....
Implementing Class
ArrayQueue<E>.Iter (cont.)
private class Iter implements
• Just as for class Iterator<E> {
ListQueue<E>, we must private int index;
implement the missing private int count = 0;
Queue methods and an inner
class Iter to fully implement public Iter() {
the Queue interface index = front;
}

The constructor initializes

@Override
index to front when a
public boolean hasNext() {
new Iter object is
return count < size;
created
}

....
Implementing Class
ArrayQueue<E>.Iter (cont.)
private class Iter implements
• Just as for class Iterator<E> {
ListQueue<E>, we must private int index;
implement the missing private int count = 0;
Queue methods and an inner
class Iter to fully implement public Iter() {
the Queue interface index = front;
}

count keeps track of the @Override

number of items accessed public boolean hasNext() {
so far return count < size;
}

....
Implementing Class
ArrayQueue<E>.Iter (cont.)
private class Iter implements
• Just as for class Iterator<E> {
ListQueue<E>, we must private int index;
implement the missing private int count = 0;
Queue methods and an inner
class Iter to fully implement public Iter() {
the Queue interface index = front;
}

hasNext() returns @Override

true if count is less public boolean hasNext() {
than size return count < size;
}

....
Implementing Class
ArrayQueue<E>.Iter (cont.)
@Override
• Just as for class
public E next() {
ListQueue<E>, we must
if (!hasNext()) {
implement the missing
throw new
Queue methods and an inner NoSuchElementException();
class Iter to fully implement }
the Queue interface E returnValue = theData[index];
index = (index + 1) % capacity;
count+;
next() returns the
return returnValue;
element at position index
}
and increments Iter's
fields index and count
@Override
public void remove {
throw new
UnsupportedOperationException();
}
}
Implementing Class
ArrayQueue<E>.Iter (cont.)
@Override
• Just as for class
public E next() {
ListQueue<E>, we must
if (!hasNext()) {
implement the missing
throw new
Queue methods and an inner NoSuchElementException();
class Iter to fully implement }
the Queue interface E returnValue = theData[index];
index = (index + 1) % capacity;
count+;
remove() throws an return returnValue;
exception because
}
removing an item other than
the first item violates the
@Override
queue's contract
public void remove {
throw new
UnsupportedOperationException();
}
}
Comparing the Three Implementations

 Computation time
 All three implementations are comparable in terms of
computation time
 All operations are O(1) regardless of implementation

 Although reallocating an array is O(n), its is amortized

over n items, so the cost per item is O(1)
Comparing the Three Implementations
(cont.)
 Storage
 Linked-list implementations require more storage due to the extra
space required for the links
 Each node for a single-linked list stores two references (one for the
data, one for the link)
 Each node for a double-linked list stores three references (one for the
data, two for the links)
 A double-linked list requires 1.5 times the storage of a single-
linked list
 A circular array that is filled to capacity requires half the storage
of a single-linked list to store the same number of elements,
 but a recently reallocated circular array is half empty, and
requires the same storage as a single-linked list
The Deque Interface

Section 4.4
Deque Interface
 A deque (pronounced "deck") is short for double-ended queue
 A double-ended queue allows insertions and removals from
both ends
 The Java Collections Framework provides two implementations
of the Deque interface
 ArrayDeque

 LinkedList

 ArrayDeque uses a resizable circular array, but (unlike

LinkedList) does not support indexed operations
 ArrayDeque is the recommend implementation
Deque Interface (cont.)
Deque Example
Deque Interface (cont.)
 The Deque interface extends the Queue interface,
so it can be used as a queue
 A deque can be used as a stack if elements are
pushed and popped from the front of the deque
 Using the Deque interface is preferable to using
the legacy Stack class (based on Vector)
Simulating Waiting Lines Using
Queues
Section 4.5
Simulating Waiting Lines Using Queues

 Simulation is used to study the performance of a

physical system by using a physical, mathematical, or
computer model of the system
 Simulation allows designers of a new system to estimate
the expected performance before building it
 Simulation can lead to changes in the design that will
improve the expected performance of the new system
 Simulation is useful when the real system would be too
expensive to build or too dangerous to experiment with
after its construction
Simulating Waiting Lines Using Queues
(cont.)
 System designers often use computer models to
simulate physical systems
 Example: an airline check-in counter
 A branch of mathematics called queuing theory
studies such problems
Case Study
 Blue Skies Airlines (BSA) would like to have two waiting
lines:
 regular customers
 frequent flyers

 Assuming only one ticket agent, BSA would like to

determine the average wait time for taking passengers
from the waiting lines using various strategies:
 take turns serving passengers from both lines (one frequent
flyer, one regular, one frequent flyer, etc.)
 serve the passenger waiting the longest
 serve any frequent flyers before serving regular passengers
Case Study (cont.)
Case Study: Analysis
 To run the simulation, we must keep track of the current time by
maintaining a clock set to an initial time of zero
 The clock will increase by one time unit until the simulation is finished
 During each time interval, one or more of the following events
occur(s):
1. a new frequent flyer arrives in line
2. a new regular flyer arrives in line
3. the ticket agent finishes serving a passenger and begins to serve a
passenger from the frequent flyer line
4. the ticket agent finishes serving a passenger and begins to serve a
passenger from the regular passenger line
5. the ticket agent is idle because there are no passengers to serve
Case Study: Analysis (cont.)
 We can simulate different serving strategies by
introducing a simulation variable, frequentFlyerMax (>
0)
 frequentFlyerMax represents the number of consecutive
frequent flyer passengers served between regular
passengers
 When frequentFlyerMax is:
 1, every other passenger served will be a regular
passenger
 2, every third passenger served will be a regular passenger
 a very large number, any frequent flyers will be served
before regular passengers
Case Study: Design (cont.)
Case Study: Design (cont.)
Case Study: Design (cont.)
Case Study: Design (cont.)
Case Study: Design (cont.)
Case Study: Design (cont.)
Case Study: Design (cont.)
Case Study: Implementation
 Listing 4.6 (Passenger.java, pages 234-235;
PassengerQueue.java, page 231,
AirlineCheckinSim.java, page 228)
Case Study: Testing