Data Abstraction and Problem Solving with JAVA Walls and MirrorsFrank M. Carrano and Janet J. Prichard © 2001 Addison Wesley

Data Abstraction and Problem Solving with JAVA:Data Abstraction and Problem Solving with JAVA:Walls and MirrorsWalls and Mirrors

CarranoCarrano / / PrichardPrichard

QueuesQueues

Data Abstraction and Problem Solving with JAVA Walls and Mirrors; Frank M. Carrano and Janet J. Prichard © 2001 Addison Wesley

Figure 7.1Figure 7.1Some queue operations

Data Abstraction and Problem Solving with JAVA Walls and Mirrors; Frank M. Carrano and Janet J. Prichard © 2001 Addison Wesley

Figure Figure 7.27.2The results of inserting a string into both a queue and a stack

Data Abstraction and Problem Solving with JAVA Walls and Mirrors; Frank M. Carrano and Janet J. Prichard © 2001 Addison Wesley

Figure 7.3aFigure 7.3aA reference-based implementation of a queue: a) a linear linked list with twoexternal references; b) a circular linear linked list with one external reference

Data Abstraction and Problem Solving with JAVA Walls and Mirrors; Frank M. Carrano and Janet J. Prichard © 2001 Addison Wesley

Figure 7.3bFigure 7.3bA reference-based implementation of a queue: a) a linear linked list with twoexternal references; b) a circular linear linked list with one external reference

Data Abstraction and Problem Solving with JAVA Walls and Mirrors; Frank M. Carrano and Janet J. Prichard © 2001 Addison Wesley

Figure Figure 7.47.4Inserting an item into a nonempty queue

Data Abstraction and Problem Solving with JAVA Walls and Mirrors; Frank M. Carrano and Janet J. Prichard © 2001 Addison Wesley

Figure Figure 7.57.5Inserting an item into an empty queue: a) before insertion; b) after insertion

Data Abstraction and Problem Solving with JAVA Walls and Mirrors; Frank M. Carrano and Janet J. Prichard © 2001 Addison Wesley

Figure Figure 7.67.6Deleting an item from a queue of more than one item

Data Abstraction and Problem Solving with JAVA Walls and Mirrors; Frank M. Carrano and Janet J. Prichard © 2001 Addison Wesley

Figure 7.7Figure 7.7a) A naive array-based implementation of a queue; b) rightward drift can causethe queue to appear full

Data Abstraction and Problem Solving with JAVA Walls and Mirrors; Frank M. Carrano and Janet J. Prichard © 2001 Addison Wesley

Figure Figure 7.87.8A circular implementation of a queue

Data Abstraction and Problem Solving with JAVA Walls and Mirrors; Frank M. Carrano and Janet J. Prichard © 2001 Addison Wesley

Figure Figure 7.97.9The effect of some operations of the queue in Figure 7-8

Data Abstraction and Problem Solving with JAVA Walls and Mirrors; Frank M. Carrano and Janet J. Prichard © 2001 Addison Wesley

Figure Figure 7.10a7.10aa) front passes back when the queue becomes empty

Data Abstraction and Problem Solving with JAVA Walls and Mirrors; Frank M. Carrano and Janet J. Prichard © 2001 Addison Wesley

Figure Figure 7.10b7.10bb) back catches up to front when the queue becomes full

Data Abstraction and Problem Solving with JAVA Walls and Mirrors; Frank M. Carrano and Janet J. Prichard © 2001 Addison Wesley

Figure Figure 7.117.11A more efficient circular implementation: a) a full queue; b) an empty queue

Data Abstraction and Problem Solving with JAVA Walls and Mirrors; Frank M. Carrano and Janet J. Prichard © 2001 Addison Wesley

Figure Figure 7.127.12An implementation that uses the ADT list

Data Abstraction and Problem Solving with JAVA Walls and Mirrors; Frank M. Carrano and Janet J. Prichard © 2001 Addison Wesley

Figure Figure 7.13a and 7.13b7.13a and 7.13bA blank line at at time a) 0; b) 12

Data Abstraction and Problem Solving with JAVA Walls and Mirrors; Frank M. Carrano and Janet J. Prichard © 2001 Addison Wesley

Figure 7.13c and 7.13dFigure 7.13c and 7.13dA blank line at at time c) 20; d) 38

Data Abstraction and Problem Solving with JAVA Walls and Mirrors; Frank M. Carrano and Janet J. Prichard © 2001 Addison Wesley

Figure Figure 7.147.14A typical instance of the event list

Data Abstraction and Problem Solving with JAVA Walls and Mirrors; Frank M. Carrano and Janet J. Prichard © 2001 Addison Wesley

Figure 7.15Figure 7.15A Partial trace of the bank simulation algorithm for the data 20 5 23 2 22 4 30 3