chapter 7: queues
DESCRIPTION
Chapter 7: Queues. Data Abstraction & Problem Solving with C++ Fifth Edition by Frank M. Carrano. The Abstract Data Type Queue. A QUEUE New items enter at the back, or rear, of the queue Items leave from the front of the queue First-in, first-out (FIFO) proper ty - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/1.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0.
Chapter 7: Queues
Data Abstraction & Problem Solving withC++
Fifth Edition
by Frank M. Carrano
![Page 2: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/2.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 2
The Abstract Data Type Queue
• A QUEUE– New items enter at the back, or rear, of the
queue– Items leave from the front of the queue– First-in, first-out (FIFO) property
• The first item inserted into a queue is the first item to leave
![Page 3: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/3.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 3
The Abstract Data Type Queue
• Queues– Are appropriate for many real-world situations
• Example: A line to buy a movie ticket
– Have applications in computer science• Example: A request to print a document• Waiting queue for calling hotline number
– Simulation• A study to see how to reduce the wait involved in an
application
![Page 4: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/4.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 4
The Abstract Data Type Queue
• ADT queue operations1. Create an empty queue
2. Destroy a queue
3. Determine whether a queue is empty
4. Add a new item to the queue
5. Remove the item that was added earliest
6. Retrieve the item that was added earliest
![Page 5: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/5.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 5
The Abstract Data Type Queue
• Operation Contract for the ADT QueueisEmpty():boolean {query}
enqueue(in newItem:QueueItemType)
throw QueueException
dequeue() throw QueueException
dequeue(out queueFront:QueueItemType)
throw QueueException
getFront(out queueFront:QueueItemType) {query}
throw QueueException
![Page 6: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/6.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 6
The Abstract Data Type Queue
Figure 7-2 Some queue operations
![Page 7: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/7.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0.
Exercise
What is the output?num1=5, num2=1, num3=4aQueue.enqueue(num2)
aQueue.enqueue(num3)aQueue.dequeue()aQueue.enqueue(num1-num2)
num1 = aQueue.dequeue()num2 = aQueue.dequeue()cout << num2 <<num1<<num3
7
![Page 8: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/8.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 8
Reading a String of Characters
• A queue can retain characters in the order in which they are typedaQueue.createQueue()while (not end of line){ Read a new character ch aQueue.enqueue(ch)
} // end while
• Once the characters are in a queue, the system can process them as necessary
![Page 9: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/9.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 9
Recognizing Palindromes
• A palindrome– A string of characters that reads the same from
left to right as its does from right to left
• To recognize a palindrome, you can use a queue in conjunction with a stack– A stack reverses the order of occurrences– A queue preserves the order of occurrences
![Page 10: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/10.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 10
Recognizing Palindromes
• A nonrecursive recognition algorithm for palindromes– As you traverse the character string from left to right,
insert each character into both a queue and a stack– Compare the characters at the front of the queue and
the top of the stack– If char is the same, delete.– Repeat until empty, thus the string is PALINDROME.– Example : EYE, RADAR
![Page 11: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/11.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 11
Recognizing Palindromes
Figure 7-3
The results of inserting a string into
both a queue and a stack
![Page 12: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/12.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 12
Implementations of the ADT Queue
• An array-based implementation• Possible implementations of a pointer-based
queue – A linear linked list with two external references
• A reference to the front• A reference to the back
– A circular linked list with one external reference
• A reference to the back
![Page 13: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/13.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 13
A Pointer-Based Implementation
Figure 7-4 A pointer-based implementation of a queue: (a) a linear linked list with two
external pointers; (b) a circular linear linked list with one external pointer
![Page 14: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/14.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 14
A Pointer-Based Implementation
Figure 7-7 Deleting an
item from a queue of
more than one item
Figure 7-6 Inserting an
item into an empty queue:
(a) before insertion;
(b) after insertion
Figure 7-5 Inserting
an item into a
nonempty queue
![Page 15: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/15.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 15
An Array-Based Implementation
Figure 7-8
a) A naive array-based implementation of a queue; (b) rightward drift can cause the queue to
appear full
![Page 16: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/16.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 16
An Array-Based Implementation
• A circular array – Eliminates the problem of rightward drift– BUT front and back cannot be used to
distinguish between queue-full and queue-empty conditions
![Page 17: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/17.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 17
An Array-Based Implementation
Figure 7-11
(a) front passes back when
the queue becomes empty;
(b) back catches up to front
when the queue becomes full
![Page 18: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/18.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 18
An Array-Based Implementation
• To detect queue-full and queue-empty conditions– Keep a count of the queue items
• To initialize the queue, setfront to 0
back to MAX_QUEUE – 1
count to 0
![Page 19: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/19.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 19
An Array-Based Implementation
• Inserting into a queueback = (back+1) % MAX_QUEUE;
items[back] = newItem;
++count;
• Deleting from a queuefront = (front+1) % MAX_QUEUE;
--count;
![Page 20: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/20.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 20
An Array-Based Implementation
• Variations of the array-based implementation
1. Use a flag isFull to distinguish between the full and empty conditions
2. Declare MAX_QUEUE + 1 locations for the array items, but use only MAX_QUEUE of them for queue items
![Page 21: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/21.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 21
An Array-Based Implementation
Figure 7-12
A more efficient circular
implementation: (a) a
full queue; (b) an empty
queue
![Page 22: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/22.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 22
An Implementation That Uses the ADT List
The front of the queue is at position 1 of the list;The back of the queue is at the end of the list
Figure 7-13
An implementation that uses the ADT list
![Page 23: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/23.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 23
An Implementation That Uses the ADT List
• aList enqueue()aList.insert(aList.getLength()+1, newItem)
• dequeue()aList.remove(1)
• getFront(queueFront)aList.retrieve(1, queueFront)
![Page 24: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/24.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 24
The Standard Template Library Class queue
• Some operations in the STL queue – Enqueue and dequeue operations are called push and pop, respectively, as for a stack
– The back method returns a reference to the last item
– The size method returns the number of items• An adaptor container
– Implemented using a more basic container type– The default queue container class is deque
![Page 25: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/25.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 25
Comparing Implementations
• Fixed size versus dynamic size– A statically allocated array-based implementation
• Fixed-size queue that can get full
• Prevents the enqueue operation from adding an item to the queue, if the array is full
– A dynamically allocated array-based implementation or a pointer-based implementation
• No size restriction on the queue
![Page 26: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/26.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 26
Comparing Implementations
• A pointer-based implementation vs. one that uses a pointer-based implementation of the ADT list– Pointer-based implementation is more efficient– ADT list approach reuses an already
implemented class• Much simpler to write
• Saves programming time
![Page 27: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/27.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 27
A Summary of Position-Oriented ADTs
• Position-oriented ADTs– List– Stack– Queue
• Stacks and queues– Only the end positions can be accessed
• Lists– All positions can be accessed
![Page 28: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/28.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 28
A Summary of Position-Oriented ADTs
• Stacks and queues are very similar– Operations of stacks and queues can be paired
off as•createStack and createQueue• Stack isEmpty and queue isEmpty•push and enqueue•pop and dequeue• Stack getTop and queue getFront
![Page 29: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/29.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 29
A Summary of Position-Oriented ADTs
• ADT list operations generalize stack and queue operations– getLength– insert– remove– retrieve
![Page 30: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/30.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 30
Application: Simulation
• Simulation– A technique for modeling the behavior of both
natural and human-made systems– Goal
• Generate statistics that summarize the performance of an existing system
• Predict the performance of a proposed system
– Example• A simulation of the behavior of a bank
![Page 31: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/31.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 31
Application: Simulation
Figure 7-14 A bank line at
time (a) 0; (b) 12; (c) 20;
(d) 38
![Page 32: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/32.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 32
Application: Simulation
• A time-driven simulation– Simulated time advances by one time unit– The time of an event is determined randomly
and compared with the simulated time
![Page 33: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/33.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 33
Application: Simulation
• An event-driven simulation– Simulated time advances to time of next event– Events are generated by using a mathematical
model based on statistics and probability
![Page 34: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/34.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 34
Application: Simulation
• The bank simulation is concerned with– Arrival events
• External events: the input file specifies the times at which the arrival events occur
– Departure events• Internal events: the simulation determines the times
at which the departure events occur
![Page 35: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/35.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 35
Application: Simulation
• Bank simulation is event-driven and uses an event list– Keeps track of arrival and departure events that
will occur but have not occurred yet– Contains at most one arrival event and one
departure event
![Page 36: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/36.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 36
Application: Simulation
Figure 7-16 A partial trace of the bank simulation for the data 20 5, 22 4, 23 2, 30 3
![Page 37: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/37.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 37
Summary
• The definition of the queue operations gives the ADT queue first-in, first-out (FIFO) behavior
• A pointer-based implementation of a queue uses either– A circular linked list– A linear linked list with both a head pointer and
a tail pointer
![Page 38: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/38.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 38
Summary
• A circular array eliminates the problem of rightward drift in an array-based implementation
• To distinguish between the queue-full and queue-empty conditions in a circular array– Count the number of items in the queue– Use an isFull flag– Leave one array location empty
![Page 39: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/39.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0. 39
Summary
• Simulations– In a time-driven simulation
• Time advances by one time unit
– In an event-driven simulation• Time advances to the time of the next event
– To implement an event-driven simulation, you maintain an event list that contains events that have not yet occurred
![Page 40: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/40.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0.
Lab exercise answer2a) struct Node {
string name; int id_number;//member item int age; Node *next;// Pointer to next node};Node *head = NULL;
2b) for (Node *cur = head; cur != NULL; cur = cur->next){cout << cur->name << endl;cout << cur->id_number << endl;cout << cur->age << endl;}
2c) newPtr -> next = cur;prev -> next = newPtr;
2d) cur->next = NULL; delete cur; cur = NULL;
40
![Page 41: Chapter 7: Queues](https://reader035.vdocument.in/reader035/viewer/2022081504/56813b1d550346895da3cf17/html5/thumbnails/41.jpg)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver. 5.0.
Quiz 2
• List the differences between a stack and a queue?
• What is the difference between stack pop and getTop operations?
• Explain what is enqueue and dequeue?
41