Presentation is loading. Please wait.

Presentation is loading. Please wait.

Data Structures( 数据结构 ) Course 5:Queue. 2 西南财经大学天府学院 Vocabulary queue 队列 enqueue 进队 dequeue 出队 queue front 队头 queue rear 队尾 Queuing theory 排队论.

Similar presentations


Presentation on theme: "Data Structures( 数据结构 ) Course 5:Queue. 2 西南财经大学天府学院 Vocabulary queue 队列 enqueue 进队 dequeue 出队 queue front 队头 queue rear 队尾 Queuing theory 排队论."— Presentation transcript:

1 Data Structures( 数据结构 ) Course 5:Queue

2 2 西南财经大学天府学院 Vocabulary queue 队列 enqueue 进队 dequeue 出队 queue front 队头 queue rear 队尾 Queuing theory 排队论

3 3 西南财经大学天府学院 5.1 Queue Operations A queue is a linear list in which data can be inserted at one end, called the rear, and deleted from the other end, called the front. It is a first in-first out (FIFO) data structure. frontrear Remove (dequeue) A computer queue (Enqueue)

4 4 西南财经大学天府学院 Enqueue: Enqueue inserts an element at the rear of the queue. plumkiwi frontrear Enqueue plumgrape frontrear kiwi grape data Queue Operation Queue Dequeue: Dequeue deletes an element at the front of the queue. kiwi frontrear Dequeue plumgrape frontrear kiwi plum data Queue Operation Queue grape

5 5 西南财经大学天府学院 Queue Front: Queue front examines the element at the front of the queue. plumgrape frontrear kiwi Queue plumgrape frontrear kiwi Queue front Queue front plum data Operation Queue Rear: Queue rear examines the element at the rear of the queue. plumgrape frontrear kiwi Queue plumgrape frontrear kiwi Queue rear Queue rear grape data Operation

6 6 西南财经大学天府学院 5.2 Queue Linked List Design Data structure: For the linked list implementation of a queue, we use tow types of structures: a head and a node. Queue head: The queue head contains the two pointers and a count of the queue. Queue data node: The queue data node contains the user data and a link field pointing to the next node.

7 7 西南财经大学天府学院 plum kiwigrapefig frontrear Conceptual queue plumkiwigrapefig frontrear 4 front rear Physical queue frontrear count datanext Head structure Node structure

8 8 西南财经大学天府学院 Queue Algorithms Create queue: set the metadata pointers to null and the count to 0. ??? frontrear count Before 0 frontrear count After No queue Algorithm createQueue (ref queue 1queue.fornt = null 2Queue.rear = null 3Queue.count = 0 End createQueue Algorithm createQueue (ref queue 1queue.fornt = null 2Queue.rear = null 3Queue.count = 0 End createQueue

9 9 西南财经大学天府学院 Enqueue: Three conditions need to be considered: 1.insert into an empty queue. 2. Insert into a queue with data. 3. Insertinto a queue when there is no memory left in the heap. 0 frontrear count plum next data plum next data newPtr 1 frontrear count Before After Insert into empty queue

10 10 西南财经大学天府学院 plum next data 1 frontrear count kiwi next data newPtr plum next data 2 frontrear count kiwi next data newPtr Before After Insert into queue with data Algorithm enqueue (ref queue dataIn 1If (queue full) 1 return false 2End if 3Allocate (newPtr) 4newPtr->data = dataIn 5newPtr->next = null pointer 6If (queue.count zero) // inserting into null queue 1 queue.front = newPtr 7Else // insert data 1 queue.rear->next = newPtr 8End if 9Queue.rear = newPtr 10Queue.count = queue.count Return true End enqueue Algorithm enqueue (ref queue dataIn 1If (queue full) 1 return false 2End if 3Allocate (newPtr) 4newPtr->data = dataIn 5newPtr->next = null pointer 6If (queue.count zero) // inserting into null queue 1 queue.front = newPtr 7Else // insert data 1 queue.rear->next = newPtr 8End if 9Queue.rear = newPtr 10Queue.count = queue.count Return true End enqueue There are four ways to test if the queue is null 1.Front null 2.Rear null 3.Count 0 4.Emptyqueue

11 11 西南财经大学天府学院 Dequeue: 1. Ensure that the queue contains data. 2. Pass the data back through the parameter list and then set the front pointer to the next item in the queue. 3. If the queue is now empty, set the rear pointer to null. plum next data 1 frontrear count 0 frontrear count deleteLoc (recycled) Before After Delete only item in queue

12 12 西南财经大学天府学院 plum next data 2 frontrear count kiwi next data Before plum next data 1 frontrear count kiwi next data (recycled) deleteLoc After Algorithm dequeue (ref queue ref item ) 1If (queue.count is 0) 1 return false 2End if 3Item = queue.front->data 4deleteLoc = queue.front 5If (queue.count 1) // Delete only item in queue 1 queue.rear = null pointer 6End if 7Queue.front = queue.front->next 8Queue.count = queue.count – 1 9Recycle (deleteLoc) 10Return true End dequeue Algorithm dequeue (ref queue ref item ) 1If (queue.count is 0) 1 return false 2End if 3Item = queue.front->data 4deleteLoc = queue.front 5If (queue.count 1) // Delete only item in queue 1 queue.rear = null pointer 6End if 7Queue.front = queue.front->next 8Queue.count = queue.count – 1 9Recycle (deleteLoc) 10Return true End dequeue

13 13 西南财经大学天府学院 Retrieving Queue Data: the logic of retrieving data is the same to that of dequeue except that the data are not deleted from the queue. Algorithm queueFront ( val queue, ref dataOut ) 1If (queue.count is 0) 1 return false 2End if 3dataOut = queue.front->data 4Return true End queueFront Algorithm queueFront ( val queue, ref dataOut ) 1If (queue.count is 0) 1 return false 2End if 3dataOut = queue.front->data 4Return true End queueFront

14 14 西南财经大学天府学院 Empty Queue: it returns true if the queue is empty and false if the queue contains data. Algorithm emptyQueue ( val queue ) 1Return (queue.count equal 0) End emptyQueue Algorithm emptyQueue ( val queue ) 1Return (queue.count equal 0) End emptyQueue Full Queue: By allocating a node and then releasing the memory we can determine whether there is room for at least one more node. Algorithm fullQueue ( val queue ) 1Allocate (tempPtr) 2If (allocate successful) 1 recycle (tempPtr) 2 return false 3Else 1 return true 4End if End fullQueue Algorithm fullQueue ( val queue ) 1Allocate (tempPtr) 2If (allocate successful) 1 recycle (tempPtr) 2 return false 3Else 1 return true 4End if End fullQueue

15 15 西南财经大学天府学院 Destroy Queue: it deletes all data in the queue and recycles their memory. Queue Count: it returns the number of elements currently in the queue by returning the count found in the queue head node. Algorithm Queuecount ( val queue ) 1Return (queue.count) End queueCount Algorithm Queuecount ( val queue ) 1Return (queue.count) End queueCount Algorithm destroyQueue ( ref queue ) 1pWalker = queue.front 2Loop (pWalker not null) 1 deletePtr = pWalker 2 pWalker = pWalker.next 3 recycle (deletePtr) 3End loop 4Queue.front = null 5Queue.rear = null 6Queue.count = 0 7return End destroyQueue Algorithm destroyQueue ( ref queue ) 1pWalker = queue.front 2Loop (pWalker not null) 1 deletePtr = pWalker 2 pWalker = pWalker.next 3 recycle (deletePtr) 3End loop 4Queue.front = null 5Queue.rear = null 6Queue.count = 0 7return End destroyQueue

16 16 西南财经大学天府学院 5.3 Queuing Theory Queuing theory is a field of applied mathematics that is used to predict the performance of queues. A Single-server queue can provide service to only one customer at a time. Example: the hot-food vendor. A Multi-server queue can provide service to many customers at a time. Example: a bank in which there is one line with many bank tellers providing service.

17 17 西南财经大学天府学院 Two elements to all queues A customer is any person or thing needing service. Such as jobs in computer, packages being sent… The service is any activity needed to accomplish the required result. Two factors affect the queue The arriving rate( 比率 ) is the rate at which customers arrive in the queue for service. Depending on the service being provided, the arrival rate may be random or regular. Service time is the average time required to complete the processing of a customer request. The arriving rate and service time are the factors that most affect the performance of queues.

18 18 西南财经大学天府学院 The faster customers arrive and the higher the service time, the longer the queue will be. The ideal is arrival rate matches service time The importance of queuing theory: it can predict the queue patterns including queue time(that is, the average length of time customers wait in the queue), the average size of the queue, and the maximum queue size. So, we can build a model of queue and used the model to study proposed changes to the system. For example, In the banking queue, if we were able to add automation improvements that would reduce the average service by 15%,how many fewer tellers would we need?

19 19 西南财经大学天府学院 Server Queue time Service time Response time A queuing theory model

20 20 西南财经大学天府学院 5.4 Queue Applications Two queue implementations: Queue simulation and categorizing data Queue simulation: a modeling activity used to generate statistics about the performance of queues. An example: a saltwater taffy store on a beach boardwalk. The store has one window and a clerk can service only one customer at a time. The store also ships boxes of taffy anywhere in the country.The time to serve customers varies between 1 and 10 minutes.(8hs per day, 7 days a week)

21 21 西南财经大学天府学院 Events : completed process new customer module: determine the arrival of a new customer. The owner found that, on average, a customer arrives every 4 minutes. An arrival rate is simulated by using a random number generator that returns a values between 1 and 4. If = 4, customer arrived; 1,2,3 customer not arrived. server free module: determine whether the clerk is busy or idle. If the clerk is idle, then the next waiting customer in line can be served. If the clerk is busy, then the waiting customers remain in the queue. Completed processing: determine whether it has completed processing for the current customer. Then processing time for the current customer is determined by a random number generator when the processing is started. When customers has been completely served, we gather statistics about sale and set server to an idle state

22 22 西南财经大学天府学院 Data structures : Four data structure are required for the queue simulation Queue head: It contains two node pointers – front and rear – and a count of the number of elements currently in the queue. Queue node: It contains the customer data and a next node pointer. The customer data consist of a sequential customer number and the arrival time. Current Customer status: We use customer’s number, arrival time, the start time and the processing time to describe customer status.(random generator to calculate) Simulation statistics: It stores the total number of customers processed in the simulation, the total and average service time, the total and average wait time, and the maximum number of customers in the queue at one time.

23 23 西南财经大学天府学院 2 frontrear count next custNum arriveTime custNum arriveTime startTimesvcTime numCust totSvcTime totWaitTimemaxQueueSize simStats custStatus node head Figure 5-13 queue data structures

24 24 西南财经大学天府学院 Output: the statistics gathered during the simulation and the average queue wait time and average queue service time, the basic statistics for each customer: arrival time, start time, wait time, service time etc. Simulator Print stats New customer Server free Service complete Create queue Figure 5-14 design for queue simulation

25 25 西南财经大学天府学院 Simulation Algorithm Simulator Algorithm taffySimulation Data Structures data number arrivalTime end data head front count rear end head node custData next end node Algorithm taffySimulation Data Structures data number arrivalTime end data head front count rear end head node custData next end node custStatus custNum arriveTime startTime svcTime end custstatus simStats numCust totSvcTime totWaitTime maxQueueSize end simstats custStatus custNum arriveTime startTime svcTime end custstatus simStats numCust totSvcTime totWaitTime maxQueueSize end simstats

26 26 西南财经大学天府学院 Statements 1CreateQueue (queue) 2Clock = 1 3endTime = 8*60 4custNum = 0 5Loop (clock <=endTime or moreCusts) 1 newCustomer (queue, clock, custNum) 2 serverFree (queue, clock, custStatus, moreCusts) 3 svcComplete (queue, clock, custStatus, runStats, moreCusts) 4 if ( not emptyQueue (queue)) 1 moreCusts = true 5 end if 6 clock = clock + 1 6End loop 7printStats (runStats) 8return end taffySimulation Statements 1CreateQueue (queue) 2Clock = 1 3endTime = 8*60 4custNum = 0 5Loop (clock <=endTime or moreCusts) 1 newCustomer (queue, clock, custNum) 2 serverFree (queue, clock, custStatus, moreCusts) 3 svcComplete (queue, clock, custStatus, runStats, moreCusts) 4 if ( not emptyQueue (queue)) 1 moreCusts = true 5 end if 6 clock = clock + 1 6End loop 7printStats (runStats) 8return end taffySimulation Algorithm 5-9 queue simulation: driver

27 27 西南财经大学天府学院 New customer Algorithm newCustomer (ref queue, val clock, ref custNum ) 1Arrival = (random number modulo 4) + 1 2If (arrival equal 4) // new customer has arrived 1 custNum = custNum custData.number = custNum 3 custData.arriveTime = clock 4 enqueue (queue, custData) 3End if 4Return End newCustomer Algorithm newCustomer (ref queue, val clock, ref custNum ) 1Arrival = (random number modulo 4) + 1 2If (arrival equal 4) // new customer has arrived 1 custNum = custNum custData.number = custNum 3 custData.arriveTime = clock 4 enqueue (queue, custData) 3End if 4Return End newCustomer

28 28 西南财经大学天府学院 Server free Algorithm serverFree ( ref queue, val clock, ref status, ref moreCusts ) 1If (clock > status.startTime + status.svcTime – 1) // server is idle 1 if (not emptyQueue (queue)) 1 dequeue (queue,custData) 2 status.custNum = custData.number 3 status.arriveTime = custData.arriverTime 4 status.startTime = clock 5 status.svcTime = random service time 6 moreCusts = true 2 end if 2End if 3Return End serverFreestatus Algorithm serverFree ( ref queue, val clock, ref status, ref moreCusts ) 1If (clock > status.startTime + status.svcTime – 1) // server is idle 1 if (not emptyQueue (queue)) 1 dequeue (queue,custData) 2 status.custNum = custData.number 3 status.arriveTime = custData.arriverTime 4 status.startTime = clock 5 status.svcTime = random service time 6 moreCusts = true 2 end if 2End if 3Return End serverFreestatus

29 29 西南财经大学天府学院 Service complete Algorithm svcComplete (ref queue, val clock, ref status, ref stats, ref moreCusts ) 1If (clock equal status.startTime + status.svcTime – 1) //current call complete 1 waitTime = status.startTime – status.arriveTime 2 stats.numCust = stats.numCust stats.totSvcTime = stats.totSvcTime + status.svcTime 4 stas.totWaitTime = stats.totWaitTime + waitTime 5 queueSize = queueCount (queue) 6 if (stas.maxQueueSize < queueSize) 1 stats.maxQueueSize = queueSize 7 end if 8 print ( status.custNum status.arriveTime status.startTime status.svcTime waitTime queueCount(queue)) 9 moreCusts = false 2Return End svcComplete Algorithm svcComplete (ref queue, val clock, ref status, ref stats, ref moreCusts ) 1If (clock equal status.startTime + status.svcTime – 1) //current call complete 1 waitTime = status.startTime – status.arriveTime 2 stats.numCust = stats.numCust stats.totSvcTime = stats.totSvcTime + status.svcTime 4 stas.totWaitTime = stats.totWaitTime + waitTime 5 queueSize = queueCount (queue) 6 if (stas.maxQueueSize < queueSize) 1 stats.maxQueueSize = queueSize 7 end if 8 print ( status.custNum status.arriveTime status.startTime status.svcTime waitTime queueCount(queue)) 9 moreCusts = false 2Return End svcComplete

30 30 西南财经大学天府学院 Algorithm printStats ( stats ) 1Print (Simulation Statistics: ) 2Print (Total customers: stats.numCust) 3Print (Total service time: stats.totSvcTime) 4avrgSvcTime = stats.totSvcTime / stats.numCust 5Print (Average service time: arvgSvcTime) 6avrgWaitTime = stats.totWaitTime / stats.numCust 7Print (Average wait time: avrgWaitTime) 8Print (,Maximum queue size: stats.maxQueueSize) 9return End printstats Algorithm printStats ( stats ) 1Print (Simulation Statistics: ) 2Print (Total customers: stats.numCust) 3Print (Total service time: stats.totSvcTime) 4avrgSvcTime = stats.totSvcTime / stats.numCust 5Print (Average service time: arvgSvcTime) 6avrgWaitTime = stats.totWaitTime / stats.numCust 7Print (Average wait time: avrgWaitTime) 8Print (,Maximum queue size: stats.maxQueueSize) 9return End printstats Print stats

31 31 西南财经大学天府学院 Categorizing Data: It is often necessary to rearrange data without destroying their basic sequence. For example, given the following list of numbers then categorize them into four different groups: Group1: less than 10 Group2: between 10 and 19 Group3: between 20 and 29 Group4: 30 and greater

32 32 西南财经大学天府学院 Algorithm categorize 1CreateQueue (q0to9) 2createQueue (q10to19) 3createQueue (q20to29) 4createQueue (qOver29) 5fillQueues (q0t09, q10to19,q20to29, qOver29) 6printQueues (q0to9, q10to19, q20to29,qOver29) 7Return End categorize Algorithm categorize 1CreateQueue (q0to9) 2createQueue (q10to19) 3createQueue (q20to29) 4createQueue (qOver29) 5fillQueues (q0t09, q10to19,q20to29, qOver29) 6printQueues (q0to9, q10to19, q20to29,qOver29) 7Return End categorize

33 33 西南财经大学天府学院 Algorithm fillQueues (ref q0to9, ref q10to19, ref q20to29, ref qOver29 ) 1Loop (not EOF) 1 read (number) 2 if (number < 10) 1 enqueue (q0to9, number) 3 elseif (number<20) 1 enqueue (q10to19, number) 4 elseif (number<30) 1 enqueue (q20to29, number) 5 else 1 enqueue (qOver29, number) 6 end if 2End loop 3Return End fillQueue Algorithm fillQueues (ref q0to9, ref q10to19, ref q20to29, ref qOver29 ) 1Loop (not EOF) 1 read (number) 2 if (number < 10) 1 enqueue (q0to9, number) 3 elseif (number<20) 1 enqueue (q10to19, number) 4 elseif (number<30) 1 enqueue (q20to29, number) 5 else 1 enqueue (qOver29, number) 6 end if 2End loop 3Return End fillQueue

34 34 西南财经大学天府学院 5.8 Summary A queue is a linear list in which data can only be inserted at one end, called the rear, and deleted from the other end, called the front. A queue is a first in-first out (FIFO) structure. There are four basic queue operations: enqueue, dequeue, queue front, and queue rear. The enqueue operation inserts an element at the rear of the queue. The dequeue operation deletes the element at the front of the queue. The queue front operation examines the element at the front of the queue without deleting it. The queue rear operation examines the element at the rear of the queue without deleting it.

35 35 西南财经大学天府学院 To implement the queue using a linked list, we use two types of structures: a head and a node. Queuing theory is a field of applied mathematics that is used to predict the performance of queues. Queue applications can be divided into single servers and multi- servers. A single-server queue application provides service to only one customer at a time. A multi-server queue application provides service to only several customers at a time. The two features that most affect the performance of queues are the arrival rate and the service time. The rate at which the customers arrive in the queue for service is known as the arrival rate. Service time is the average time required to complete the processing of a customer request.

36 36 西南财经大学天府学院 The queue time is the average length of time customers wait in the queue. The response time is a measure of average time from the point at which customers enter the queue until the moment they leave the server. It is queue time plus service time. One application of queues is queue simulation, which is a modeling activity used to generate statistics about the performance of a queue. Another application of queues is categorization. Queues are used to categorize data into different groups without losing the original ordering of the data. Queues can be implemented suing linked lists or arrays.

37 37 西南财经大学天府学院 Exercise Imagine you have a stack of integers,S,and a queue of integers,Q. Draw a picture of S and Q after the following operation: PushStack(S,3) PushStack(S,12) Enqueue(Q,5) Enqueue(Q,8) PopStack(S,x) pushStack(S,2) Enqueue(Q,x) Dequeue(Q,y) PushStack(S,x) PushStack(S,y)

38 38 西南财经大学天府学院 Exercise What would be the contents of queue Q1 and Q2 after the following code is executed and the following data are entered? Q1=createQueue Q2=createQueue Loop (not end of file) read number enqueue(Q1,number) enqueue(Q2,number) loop (Not empty Q1) dequeue(Q1,x) enqueue(Q2,x) End loop The data are 5,7,12,4,0,4,6


Download ppt "Data Structures( 数据结构 ) Course 5:Queue. 2 西南财经大学天府学院 Vocabulary queue 队列 enqueue 进队 dequeue 出队 queue front 队头 queue rear 队尾 Queuing theory 排队论."

Similar presentations


Ads by Google