Data Structures | Level 2 | Lab 4
1 | P a g e
Queue Using Array
1- What is the Queue?
Queue is an abstract data structure, somewhat similar to Stacks. Unlike stacks, a queue is
open at both its ends. One end is always used to insert data (enqueue) and the other is used
to remove data (dequeue). Queue follows First-In-First-Out methodology (FIFO), i.e., the data
item stored first will be accessed first.
1- Applications of Queue data Structure:
- Queue is useful in CPU scheduling, Disk Scheduling.
- Queue is used for synchronization. Examples: IO Buffers, pipes, file IO, etc.
Queue Using Dynamic Array Code:
#include <iostream>
using namespace std;
int front,rear;
int size;
int *Queue;
bool isFull()
{
if (rear==size-1)
return true;
else
return false;
}
bool isEmpty()
{
if (front==-1 || front > rear)
return true;
else
return false;
}
void enqueue(int item)
{
if (isFull())
cout<<"Queue Overflow \n";
else
