how to write the algorithm in this code int main() { queue a; int c; while(1) { cout<<"\nPlease Select which operation you want from the list:\n "; cout<<"\n1.Insert an element on to circular queue "; cout<<"\n2.Delete an element from circular queue "; cout<<"\n3.Demonstrate overflow and underflow situations on circular queue "; cout<<"\n4.Display the status of circular queue"; cout<<"\n5.Exit"; cout<<"\n enter your choice:\n"; cin>>c; switch(c) { case 1: a.enqueue(); break; case 2: a.dequeue(); break; case 3: a.underflow(); a.overflow(); break; case 4: a.display(); break; case 5: cout<<"Thanks"; return 0; default: cout<<"\nselect choice " ; break; } } return 0;
how to write the
int main()
{
queue a;
int c;
while(1)
{
cout<<"\nPlease Select which operation you want from the list:\n ";
cout<<"\n1.Insert an element on to circular queue ";
cout<<"\n2.Delete an element from circular queue ";
cout<<"\n3.Demonstrate overflow and underflow situations on circular queue ";
cout<<"\n4.Display the status of circular queue";
cout<<"\n5.Exit";
cout<<"\n enter your choice:\n";
cin>>c;
switch(c)
{
case 1:
a.enqueue();
break;
case 2:
a.dequeue();
break;
case 3:
a.underflow();
a.overflow();
break;
case 4:
a.display();
break;
case 5:
cout<<"Thanks";
return 0;
default:
cout<<"\nselect choice " ;
break;
}
}
return 0;
}
Queue overflow() results from attempting to add an element to a complete queue,
Queue underflow() occurs when trying to delete an element from an empty queue.
Enqueue()-add (store) an object to the queue.
Dequeue()-remove (access) an item from the queue.
Step by step
Solved in 2 steps
