QUEUE
Download as PPTX, PDF0 likes181 views
A queue is a non-primitive linear data structure that follows the first-in, first-out (FIFO) principle, where new elements are added to the rear end and existing elements are deleted from the front end. Common real-world examples of queues include lines at the printer, cashier, bank ATM, and the operations of a queue include enqueue to insert an element, dequeue to remove an element, and checking if the queue is full or empty.
QUEUE
- 2. QUEUE • Ordered collection of homogenous elements • Non primitive linear data structure • A new element is added at one end called rear end the existing elements are deleted from the other end front end. • This mechanism is called first in first out (FIFO)
- 3. Queue in our life
- 4. Queue example Queue example in computer, accessing the printer in multi user environment Pc-4 Pc-3 Pc-2Pc-1 Front Rear PRINTER QUEUE
- 5. Real World Applications Cashier lines in any store Check out at a bookstore Bank/ATM A line of cars at a toll booth
- 6. Queue Operations The main operations of queue are as follow Enqueue:insertan element in queue Dequeue :remove an element from queue Queue front: return the first element of queue Queue End :Return the last element of queue Is full() Is empty()