Data Structure Lab 6


Source code:

#include <iostream>
using namespace std;
#define size 5
int que[size],front=0,rear=0;
//add value in enque
void enque(int value)
{
if(size==rear && front==0)
{
cout<<"Qeue is full"<<endl;
}
else
{
que[rear]=value;
rear++;
cout<<value<<" value is enqeue in array"<<endl;
}
}
//del value from que
void deque()
{
int no;
if(front==rear)
{
cout<<"Stack is empty"<<endl;
}
else
{
no=que[front];
front++;
cout<<no<<" is deleted from que. "<<endl;
}
}
void display()
{
if(front==rear)
{
cout<<"Stack is empty"<<endl;
}
else
{
for(int i=front;i<rear;i++)
{
cout<<que[i]<<"  ";
}
cout<<endl;
}
}

int main()
{
int choice,value;
do{
cout<<"*****************************"<<endl;
cout<<"1) Enque element"<<endl;
cout<<"2) deque element "<<endl;
   cout<<"3) Display All "<<endl;
   cout<<"4) Exit"<<endl;
   cout<<"*****************************"<<endl;
   cout<<"ENter Your choice: ";
   cin>>choice;
   switch(choice)
   {
    case 1:
   
    cout<<"Enter Value: ";
    cin>>value;
    enque(value);
    break;
  }
  case 2:
 
    cout<<"Enter Value: ";
    cin>>value;
    deque();
    break;
  }
  case 3:
  display();
  break;
 
  case 4:
  break;
 
  default :
  cout<<"invalid"<<endl;
 
  
   
   
   }
   }while(choice!=4);
return 0;
}

Comments

Popular posts from this blog

Computer Programming Lab 5

Computer Programming lab 11

Computer Programming Lab 4