OMKAR BOMBLE

 Practical No: -13 Experiment No. 13: Pizza parlor accepting maximum M orders. Orders are served in first come first served basis. Order once placed cannot be cancelled. Write C++ program to simulate the system using circular queue using array. Code: #include<iostream> using namespace std; #define SIZE 3 int Queue[SIZE]; int front=-1; int rear=-1; int isEmpty() { if(front==rear+1) { cout<<"\n Queue Empty:" ; return(1); } return(0); } int Qfull() { if((rear+1) % SIZE==front) { cout<<"\n Queue Full:\n" ; return(1); } return(0); } void enque(int data) { if(!Qfull()) { if(front==-1) front=0; rear++; Queue[rear]=data; cout<<"\n Inserted :"<<data<<"\n"; return; } cout<<"\n Cannot insert:"<<data<<"\n"; } int deque() { if(!isEmpty()) { int t=Queue[front]; front++; cout<<"\n Front:"<<front<<"\n"; return(t); } } int main() { enque(10); enque(20);...

 Practical No: -12 Experiment No. 12: A double-ended queue(deque) is a linear list in which additions and deletions may be made at either end. Obtain a data representation mapping a deque into a one-dimensional array. Write C++ program to simulate deque with functions to add and delete elements from either end of the deque. Code: using namespace std; #include<iostream> #include<stdio.h> #include<process.h> #define MAX 30 typedef struct dequeue {  int data[MAX];  int rear,front; }dequeue; void initialize(dequeue *p); int isEmpty(dequeue *p); int isFull(dequeue *p); void enqueueRear(dequeue *p,int x); void enqueueFront(dequeue *p,int x); int dequeueFront(dequeue *p); int dequeueRear(dequeue *p); void display(dequeue *p); main() {  int i,x,choice,n;  dequeue q;  initialize(&q);  do  {  cout<<"\n 1.Create \n 2.Insert(rear) \n 3.Insert(front) \n 4.Delete(rear) \n 5.Delete(front)";  cout<<"\n 6.Display \n 7.Ex...

 Practical No: -11 Experiment No. 11: Queues are frequently used in computer programming, and a typical example is the creation of a job queue by an operating system. If the operating system does not use priorities, then the jobs are processed in the order they enter the system. Write C++ program for simulating job queue. Write functions add job and delete job from queue. Code: using namespace std; #include<iostream> #include<stdio.h> #include<conio.h> #include<stdlib.h> #define SIZE 5 void enqueue(int x); void dequeue(); void display(); int FRONT=-1; int REAR=-1; int QUEUE[SIZE]; main() {  int x,ch;  while(1)  {  cout<<"\n 1:Add Job";  cout<<"\n 2:Delete Job";  cout<<"\n 3:Display";  cout<<"\n 4:Exit";  cout<<"\n Enter Your Choice:";  cin>>ch;  switch(ch)  {  case 1:  cout<<"Enter Job:";  cin>>x;  enqueue(x);  break;  case 2: ...

 Practical No: -10 Experiment No. 10: In any language program mostly syntax error occurs due to unbalancing delimiter such as (), {}, []. Write a C++ program using stack to check whether given expression is well parenthesized or not. Code: #include<iostream> using namespace std; const int MAX=20; class Stack {  char expr[MAX];  int top;  public:  Stack()  {  top=-1;  }  void push(char ch);  char pop();  bool isEmpty();  bool isFull();  void display();  void checkParenthesis(); }; bool Stack::isEmpty() {  if(top==-1)  return 1;  else  return 0; } bool Stack::isFull() {  if(top==MAX-1)  return 1;  else  return 0; } void Stack::display() {  if(isEmpty()==1)  cout<<"\n Stack is empty";  else  {  for(int i=0;i<=top;i++)  {  cout<<""<<expr[i];  }  } } void Stack::push(char ch) {  if(!isFull())  {  t...

 Practical No: -9 Experiment No. 9: A palindrome is a string of character that’s the same forward and backward. Typically, punctuation, capitalization, and spaces are ignored. For example, “Poor Dan is in a droop” is a palindrome, as can be seen by examining the characters “poor danisina droop” and observing that they are the same forward and backward. One way to check for a palindrome is to reverse the characters in the string and then compare with them the original-in a palindrome, the sequence will be identical. Write C++ program with functionsa) To print original string followed by reversed string using stack b) To check whether given string is palindrome or not Code: #include<iostream> #include<string.h> #define max 50 using namespace std; class STACK {  private:  char a[max];  int top;  public:  STACK()  {  top=-1;  }  void push(char);  void reverse();  void convert(char[]);  void palindrome(); }; void ST...

 Practical No: -8 Experiment No. 8: Write C++ program for storing binary number using doubly linked lists. Write functionsa) To compute 1’s and 2’s complement. b) Add two binary numbers. Code: #include<iostream> using namespace std; class binary; class node {  node *prev;  bool n;  node*next; public:  node()  {  prev=next=NULL;  }  node(bool b)  {  n=b;  prev=next=NULL;  }  friend class binary; }; class binary {  node *start;  public:  binary()  {  start=NULL;  }  void generateBinary(int no);  void displayBinary();  void onesComplement();  void twoscomplement();  binary operator +(binary n1);  bool addBitAtBegin(bool val)  {  node *nodee=new node(val);  if(start==NULL)  {  start=nodee;  }  else  {  nodee->next=start;  start->prev=nodee;  start=nodee;  }  return true;  } }; void ...