Scribd
Upload
2 views

7-Queue Data Structure

The document provides an overview of the queue data structure, defining it as a FIFO (First In First Out) method for storing and retrieving data. It outlines key operations such as enqueue and dequeue, and discusses implementations using arrays and linked lists, along with their advantages and disadvantages. Additionally, it includes practical examples and applications of queues in various computing scenarios.

Uploaded by

monycc2024
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

7-Queue Data Structure

The document provides an overview of the queue data structure, defining it as a FIFO (First In First Out) method for storing and retrieving data. It outlines key operations such as enqueue and dequeue, and discusses implementations using arrays and linked lists, along with their advantages and disadvantages. Additionally, it includes practical examples and applications of queues in various computing scenarios.

Uploaded by

monycc2024
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 15

Data structure &

Programming ii
Queue data structure

1
Outline
❑ A Brief of Outline

▪ What is Queue?

▪ What are Queue operations?

▪ How to implement Queue in C++

▪ Examples

2
What is Queue?
❑ Definition

▪ A queue is a data structure that stores data in such a way that the element
stored first will be retrieved first

▪ This method is also called FIFO (First In First Out)

Real life examples:


➢ A queue of vehicles waiting at the petro pump
➢ People waiting at the bus store for the bus
➢ The first person to enter the queue is the first one to leave the queue
➢ Last person to join the queue is the last person to leave the queue

3
Applications of Queue
❑ Definition

▪ Queue finds their use in


▪ CPU scheduling,

▪ Message queuing,

▪ Computer networks

▪ etc.

▪ In time sharing system, queue helps in scheduling of jobs

4
Queue Operations
❑ Operation
▪ A queue is controlled by two main operations which implement the FIFO method
▪ Insertion
▪ Add element to the queue.

▪ This method is called enqueue

▪ Deletion enqueue()
dequeue()
▪ Remove element from the queue.
rear
front
▪ This method is called dequeue

▪ Two variables, FRONT and REAR are used


Queue
▪ FRONT : used for keep track the first element of the queue
▪ REAR : used for keep track the last element of the queue

5
Queue Operations
❑ More operations

▪ enqueue: Add element to end of queue

▪ dequeue: Remove element from front of queue

▪ isEmpty: Check if queue is empty

▪ isFull: Check if queue is full

▪ peek: Get the value of the front of queue without removing it

6
Queue Implementation
❑ Definition

▪ Queue can be implemented in two ways


1. As an Array front variable is used to store the index of the first element
Queue as Array rear variable is used to store the index of the last element

2. As a Linked List
Queue as Linked List

front variable is head of the list


rear variable is tail of the list

7
Disadvantage of Queue as Array
❑ Definition

▪ Implementing queue as an array has one major drawback


▪ Since arrays are fixed in size, elements can not be inserted beyond the max size of the array

For example:
➢ This queue is considered as full although there are two
empty spaces in the beginning of the queue

unused block

8
Implementing Queue as
Linked List
9
Queue Implementation
❑ Queue as a Linked List

10
Queue Implementation: Examples
❑ Queue as a Linked List
How to implement this queue?

Demo coding in class

11
Queue Implementation
❑ Queue as a Linked List

▪ Implementing queue as a linked list is just like implementing a linked list


with some choices
Choice 1

▪ Element is added to the end of the list (enqueue operation)

▪ Element can be only removed from the beginning of the list (dequeue operation)

Choice 2

▪ Element is added to the beginning of the list (enqueue operation)

▪ Element can be only removed from the end of the list (dequeue operation)
Remark: Choice 1 is recommended.

12
Let’s code it!

13
Practice
Using queue data structure

Create a queue that stores each letter for an English word input by a
user. Then add each letter of this word to this queue.
▪ Ask another user to input a word then test whether a word stored in this queue is the
same.

14
Q and A

15

You might also like