Scribd
Upload
7 views20 pages

Unit No.6 Queue

A Queue is an abstract data type that operates on a First In First Out (FIFO) basis, with key operations including enqueue, dequeue, and peek. Variants such as Circular Queues, Linked Queues, Deques, and Priority Queues enhance functionality and efficiency, allowing for dynamic sizing and priority management. Each type of queue serves different needs in data management, optimizing space and operation flexibility.

Uploaded by

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

Unit No.6 Queue

A Queue is an abstract data type that operates on a First In First Out (FIFO) basis, with key operations including enqueue, dequeue, and peek. Variants such as Circular Queues, Linked Queues, Deques, and Priority Queues enhance functionality and efficiency, allowing for dynamic sizing and priority management. Each type of queue serves different needs in data management, optimizing space and operation flexibility.

Uploaded by

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

Basic Concept of Queue

• A Queue is an abstract data type that follows the First In First Out
(FIFO) principle, meaning that the first element added to the queue
will be the first one to be removed. This behavior can be compared to
a line of people waiting for service: the first person in line is the first
to be served.
Key Characteristics
• Enqueue: Adding an element to the back of the queue.
• Dequeue: Removing an element from the front of the queue.
• Peek: Retrieving the front element without removing it.
• Empty: Checking if the queue is empty.
Queue as Abstract Data Type (ADT)
• A Queue ADT defines the operations that can be performed on a
queue without specifying how these operations are implemented.
The main operations typically include:
• Enqueue: Add an element to the back.
• Dequeue: Remove an element from the front.
• Front: Return the front element.
• isEmpty: Check if the queue is empty.
• Size: Return the number of elements in the queue.
Representation of Queue Using
Sequential Organization
• Challenges
• Fixed Size: The size of the queue is fixed at initialization.
• Inefficient Space Utilization: If elements are dequeued, the front
indices may leave unused space.
Queue Operations
Circular Queue and Its Advantages
• A Circular Queue is an improvement over the simple queue
implementation. It connects the last position back to the first position
to make use of the free space created by dequeued elements.
Advantages
• Efficient Use of Space: There is no wasted space as in a linear queue
implementation.
• Simple Logic: The circular logic makes it easier to manage the front
and rear indices.
Each queue can be managed independently, and they can share the same array space
. Linked Queue and Operations

Linked Queue uses linked lists to implement queues, allowing dynamic


size and more efficient space utilization.
Operations

• Enqueue: Add a new node at the rear.


• Dequeue: Remove the node from the front.
• Peek: Retrieve the front element without removing it.
8. Deque - Basic Concept
• 8. Deque - Basic Concept A Deque (Double-Ended Queue) is a
generalized version of a queue that allows insertion and deletion from
both ends (front and rear).
• Types of Deque
• Input Restricted Deque: Insertion is allowed only at one end, but
deletion can occur at both ends.
• Output Restricted Deque: Deletion is allowed only at one end, but
insertion can occur at both ends.
• ImplementationA deque can be implemented using arrays or linked
lists, similar to a queue.
9. Priority Queue - Basic
Concept
• A Priority Queue is an abstract data type where each element is associated with a
priority. The element with the highest priority is served before other elements,
regardless of their order in the queue.
• Types of Priority Queue
• Ascending Priority Queue: The smallest (or highest priority) element is served first.
• Descending Priority Queue: The largest (or lowest priority) element is served first.
• Implementation
• Priority queues can be implemented using:
• Arrays: Insertion can take O(n)O(n)O(n) time to maintain the order.
• Heaps: A binary heap can be used for efficient O(log⁡n)O(\log n)O(logn) insertion and
deletion.
Summary

• Queues are essential data structures for managing data in a FIFO


manner.
• Circular queues improve space efficiency.
• Multi-queues allow the management of multiple queues.
• Linked queues offer dynamic size capabilities.
• Deques provide flexibility for operations on both ends.
• Priority queues add the concept of priority to the queue operations.

You might also like