CP164 Lecture Notes - Lecture 6: Priority Queue, The Queue
Document Summary
The queue adt represents a first-in-first out ( opposite to stack) Insert and remove from queue (not push and pop like stack) Therefore in these way the terminology differs from stack to queues. Initialize method ( create an empty queue) Is full- if queue has a limited size (not allowed to insert into a full data structure. Queues are often used to simulate real life situation (how long is a transaction at a cashier) Servers- entities which are performing a service such as a grocery store clerk a tech support person, bank machine or a. Servers take time to perform their service and this time is assigned a service time distribution. Clients- entities which require and wait in a queue to be served by a server. Simulations may have multiple queues for clients clients join. Like stacks we can solve a maze using a queue.
