REPORT ON QUEUE IN DATA STRUCTURE
Page 1: Title Page
Topic: Queue in Data Structure
Name of the Student: Snehasis Saha
Stream: [Link] (CSE)
Semester: 3rd Semester
University Registration Number: 252590120140
Page 2: Content (Table of Contents)
• Statement of Topic
• Topic Description
• Importance of Queue
• Assumptions
• Objective
• Literature Review
• Sample Technique
• Result
• Summary and Conclusion
• References
Page 3: Statement of Topic
The topic of this report is “Queue in Data Structure.”
A queue is a linear data structure that follows the
FIFO (First In First Out) principle. The element
inserted first will be removed first. It is similar to a
real-life queue where people stand in line.
Page 4: Topic Description
A Queue is an abstract data type (ADT) that allows insertion
at one end called rear and deletion at the other end called
front.
Basic Operations of Queue:
• Enqueue – Insert an element at the rear.
• Dequeue – Remove an element from the front.
• Peek/Front – View the front element.
• isEmpty – Check whether queue is empty.
• isFull – Check whether queue is full (in array
implementation).
Types of Queue:
• Simple Queue
• Circular Queue
• Priority Queue
• Deque (Double Ended Queue)
Implementation Methods:
• Using Array
• Using Linked List
Page 5: Importance of Queue
Queue plays an important role in computer science
and real-world applications.
Applications:
• CPU scheduling
• Printer spooling
• Breadth First Search (BFS)
• Handling requests in web servers
• Call center systems
• Traffic management systems
• Queues help in maintaining order and managing
resources efficiently.
Page 6: Assumptions
• The queue follows strictly FIFO principle.
• Overflow occurs when queue is full.
• Underflow occurs when queue is empty.
• Maximum size is fixed in array implementation.
• Data elements are inserted only at rear and
deleted only from front.
Page 7: Objective
• The main objectives of studying Queue are:
• To understand FIFO mechanism.
• To learn queue operations.
• To implement queue using array and linked list.
• To analyze time and space complexity.
• To understand real-world applications.
Page 8: Literature Review
According to various data structure textbooks:
Data Structures and Algorithms by Aho, Hopcroft and
Ullman explain queue as a linear structure with FIFO
access.
Introduction to Algorithms by Cormen (CLRS)
describes queue implementation and its time
complexity.
Many research papers show queue usage in
scheduling algorithms and networking systems.
Queues are fundamental structures in algorithm
design and system programming.
Page 9: Sample Technique
Algorithm for Enqueue (Array Implementation):
Check if rear == MAX-1 → Overflow.
If queue empty, set front = 0.
Increment rear.
Insert element at rear.
Algorithm for Dequeue:
Check if front == -1 or front > rear → Underflow.
Store element at front.
Increment front.
Return deleted element.
Time Complexity:
Enqueue: O(1)
Dequeue: O(1)
Page 10: Result
After studying and implementing Queue:
Queue operations were successfully performed.
FIFO principle was verified.
Applications in scheduling and system processing
were understood.
Both array and linked list implementation were
analyzed.
Page 11: Summary and Conclusion
Queue is an essential linear data structure based on
FIFO principle. It is widely used in operating systems,
networking, and real-time systems. Understanding
queue improves problem-solving skills in algorithm
design. Different types of queues solve different
computational problems efficiently.
Thus, Queue is a fundamental and important
concept in Data Structures.
Page 12: References
Aho, Alfred V., Hopcroft, John E., Ullman, Jeffrey D. –
Data Structures and Algorithms
Cormen, Thomas H. – Introduction to Algorithms
(CLRS)
Weiss, Mark Allen – Data Structures and Algorithm
Analysis
GeeksforGeeks – [Link]
TutorialsPoint – [Link]