TYPES IN QUEUES IN DATA STRUCTURES AND ALOGORITHM IN C PROGRAMMING

This ppt describes about types of queues in data structure and algorithm in c programming.

1. TYPES IN QUEUES IN DS DATA STRUCTURES USING C PRESENTED BY : SANJAY S II ND YEAR CSE(AI&ML)

2. INTRODUCTION TO QUEUE Definition: A queue is a linear data structure that follows the FIFO (First In First Out) principle . Basic Operations: Enqueue : Insert an element at the rear Dequeue : Remove an element from the front Analogy: Like people standing in a line at a ticket counter.

3. TYPES OF QUEUE Simple Queue (Linear Queue ) Circular Queue Priority Queue Double-Ended Queue ( Deque )

4. LINEAR QUEUE Definition: A basic queue where insertion happens at the rear and deletion happens at the front . Real-Life Example: People waiting in line for bus tickets .

5. CIRCULAR QUEUE Definition: A queue where the last position connects back to the first position, forming a circle. Real-Life Example: CPU process scheduling .

6. PRIORITY QUEUE Definition: A queue where each element has a priority, and higher-priority elements are served before lower ones. Real-Life Example: Hospital emergency room – critical patients treated first.

7. DOUBLE-ENDED QUEUE (DEQUE) Definition: A queue in which insertion and deletion can be done from both ends . Real-Life Example: Browser history (forward & backward navigation).

8. COMPARISON TABLE Type of Queue Insertion Deletion Example Use Case Simple Queue Rear Front Ticket counters Circular Queue Rear (circular) Front (circular) CPU scheduling Priority Queue Based on priority Based on priority Hospitals, OS tasks Deque Both ends Both ends Browser history

9. CONCLUSION Queue is a fundamental linear data structure in C . Different types solve different real-world problems . Simple: Linear order tasks. Circular: Efficient memory use in buffers. Priority: Time-critical applications. Deque : Flexible double-end operations.

10. THANK YOU….