Comments on: C++ program to implement circular queue using array

By: hina

hina — Wed, 02 Sep 2015 20:22:39 +0000

in above comment i read that there is no concept of Full… but i run it There is concept of IS FULL… just type Int in place of void and run it,,,

By: iqra

iqra — Wed, 02 Sep 2015 20:21:38 +0000

in above comment i read that there is no concept of Full… but i run it There is concept of IS FULL… just type Int in place of void and run it,,,

By: iqra

iqra — Wed, 02 Sep 2015 20:19:29 +0000

the above code is correct 100%. just one mistake there , in void main( ). type int main () . then program will run correctly.. i run it .. it works with all operation like is Full , is Empty , Dequeue and enqueue etc.. it works all .. in c-Free or Dev

By: C++ Program Using Arrays Functions

C++ Program Using Arrays Functions — Sat, 10 Jan 2015 19:39:39 +0000

[…] PDF File Name: C++ program to implement circular queue using array Source: studentprojects.in » DOWNLOAD « […]

By: edzel

edzel — Tue, 16 Sep 2014 11:22:20 +0000

I Hope , This Code will Help you!!! 🙂

By: edzel

edzel — Tue, 16 Sep 2014 11:19:59 +0000

/*
* C++ Program to Implement Circular Queue
*/
#include
#define MAX 5
using namespace std;
/*
* Class Circular Queue
*/
class Circular_Queue
{
private:
int *cqueue_arr;
int front, rear;
public:
Circular_Queue()
{
cqueue_arr = new int [MAX];
rear = front = -1;
}
/*
* Insert into Circular Queue
*/
void insert(int item)
{
if ((front == 0 && rear == MAX-1) || (front == rear+1))
{
cout<<"Queue Overflow \n";
return;
}
if (front == -1)
{
front = 0;
rear = 0;
}
else
{
if (rear == MAX – 1)
rear = 0;
else
rear = rear + 1;
}
cqueue_arr[rear] = item ;
}
/*
* Delete from Circular Queue
*/
void del()
{
if (front == -1)
{
cout<<"Queue Underflow\n";
return ;
}
cout<<"Element deleted from queue is : "< if (front == rear)
{
front = -1;
rear = -1;
}
else
{
if (front == MAX – 1)
front = 0;
else
front = front + 1;
}
}
/*
* Display Circular Queue
*/
void display()
{
int front_pos = front, rear_pos = rear;
if (front == -1)
{
cout<<"Queue is empty\n";
return;
}
cout<<"Queue elements :\n";
if (front_pos <= rear_pos)
{
while (front_pos <= rear_pos)
{
cout< front_pos++;
}
}
else
{
while (front_pos <= MAX – 1)
{
cout< front_pos++;
}
front_pos = 0;
while (front_pos <= rear_pos)
{
cout< front_pos++;
}
}
cout< }
};
/*
* Main
*/
int main()
{
int choice, item;
Circular_Queue cq;
do
{
cout<<"1.Insert\n";
cout<<"2.Delete\n";
cout<<"3.Display\n";
cout<<"4.Quit\n";
cout<>choice;
switch(choice)
{
case 1:
cout<>item;
cq.insert(item);
break;
case 2:
cq.del();
break;
case 3:
cq.display();
break;
case 4:
break;
default:
cout<<"Wrong choice\n";
}/*End of switch*/
}
while(choice != 4);
return 0;
}

By: dasa

dasa — Mon, 11 Mar 2013 04:36:23 +0000

bkwass mariiii hoi haiiiiiiiiiiiiiiiiii

By: unknown

unknown — Sun, 09 Dec 2012 13:47:36 +0000

this code is wrong it doesn’t move the item inside it