Scribd
Upload
20 views7 pages

DSA Queue Part 1

Uploaded by

Sameeksh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
20 views7 pages

DSA Queue Part 1

Uploaded by

Sameeksh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Queue

• A queue is a useful data structure in programming. It is similar


to the ticket queue outside a cinema hall, where the first person
entering the queue is the first person who gets the ticket.
• Queue follows the First In First Out (FIFO) rule - the item that
goes in first is the item that comes out first.

• In programming terms, putting items in the queue is called enqueue, and


removing items from the queue is called dequeue.

This video is sole property of Talent Battle Pvt. Ltd. Strict penal action will be taken against unauthorized piracy of this video
Basic Operations of Queue

A queue is an object (an abstract data structure - ADT) that allows the

following operations:

•Enqueue: Add an element to the end of the queue

•Dequeue: Remove an element from the front of the queue

•IsEmpty: Check if the queue is empty

•IsFull: Check if the queue is full

•Peek: Get the value of the front of the queue without removing it.

This video is sole property of Talent Battle Pvt. Ltd. Strict penal action will be taken against unauthorized piracy of this video
Working of Queue

Queue operations work as follows:


• two pointers FRONT and REAR
• FRONT track the first element of the queue
• REAR track the last element of the queue
• initially, set value of FRONT and REAR to -1
Enqueue Operation
• check if the queue is full
• for the first element, set the value of FRONT to 0
• increase the REAR index by 1
• add the new element in the position pointed to by REAR
Dequeue Operation
• check if the queue is empty
• return the value pointed by FRONT
• increase the FRONT index by 1
• for the last element, reset the values of FRONT and REAR to -1
This video is sole property of Talent Battle Pvt. Ltd. Strict penal action will be taken against unauthorized piracy of this video
Queue Implementation

This video is sole property of Talent Battle Pvt. Ltd. Strict penal action will be taken against unauthorized piracy of this video
Complexity Analysis &
Applications of Queue

The complexity of enqueue and dequeue operations in a queue using an array i

Applications of Queue
•CPU scheduling, Disk Scheduling
•When data is transferred asynchronously between two processes. The queue is
used for synchronization. For example: IO Buffers, pipes, file IO, etc.
•Handling of interrupts in real-time systems.
•Call Center phone systems use Queues to hold people calling them in order.

This video is sole property of Talent Battle Pvt. Ltd. Strict penal action will be taken against unauthorized piracy of this video
Types of Queue

There are four different types of


queues:
•Simple Queue
•Circular Queue
•Priority Queue
•Double Ended Queue
This video is sole property of Talent Battle Pvt. Ltd. Strict penal action will be taken against unauthorized piracy of this video
Simple Queue

In a simple queue, insertion takes place at the rear and removal occurs at the
front. It strictly follows the FIFO (First in First out) rule.

This video is sole property of Talent Battle Pvt. Ltd. Strict penal action will be taken against unauthorized piracy of this video

You might also like