![5. Design, Develop and Implement a Program in C for the following Stack Applications
a. Evaluation of Suffix expression with single digit operands and operators: +, -, *, /, %, ^
b. Solving Tower of Hanoi problem with n disks.
#include<stdio.h>
#include<conio.h>
#define MAX 20 struct
stack
{
int top;
int str[MAX];
}s;
charpostfix[MAX];
int pop();
intisoperand(char);
intoperate(int,int,char); int
main()
{
int i=0;
intans,op1,op2;
clrscr();
s.top=-1;
printf("Enter a VALID POSTFIX Expression:"); scanf("%s",postfix);
while(postfix[i]!='0')
{
if(isoperand(postfix[i]))
push(postfix[i]-48);
else
{
} i++;
}
op1=pop();
op2=pop();
ans=operate(op1,op2,postfix[i]);
push(ans);
printf("%d %c %d = %dn",op2,postfix[i],op1,ans);
printf("Answer=%d",s.str[s.top]); getch();
return;
}](https://image.slidesharecdn.com/prg56-240502104338-495d8770/85/prg5-6-doc-computer-science-and-engineering-1-320.jpg)
![int isoperand(char x)
{
if(x>='0' && x<='9')
return 1;
else
}
return 0;
void push(int x)
{
if(s.top==MAX-1)
{
}
else
}
printf("Enter expression < 20 charn");
getch();
exit(0);
s.str[++s.top]=x;
int pop()
{
if(s.top==-1)
{
}
else
}
printf("INVALIDPOSTFIXEXPRESSIONn");
getch();
exit(0);
returns.str[s.top--]
int operate(int op1,int op2,char a)
{
switch(a)
{
case '+':return op2+op1;
case '-':return op2-op1;
case '*':return op2*op1;
case '/':return op2/op1;
case '%':return op2%op1;
case '^':return pow(op2,op1);
}
return 0;
}](https://image.slidesharecdn.com/prg56-240502104338-495d8770/85/prg5-6-doc-computer-science-and-engineering-2-320.jpg)
![6.Design, Develop and Implement a menu driven Program in C for the following operations on Circular
QUEUE of Characters (Array Implementation of Queue with maximum size MAX)
a. Insert an Element on to Circular QUEUE
b. Delete an Element from Circular QUEUE
c. Demonstrate Overflow and Underflow situations on Circular QUEUE
d. Display the status of Circular QUEUE
e. Exit.
Support the program with appropriate functions for each of the above operations
#include <stdio.h>
#include<conio.h>
#define MAXSIZE 5
int cq[MAXSIZE]={0};
int front,rear;
void insert(int);
void del();
void display();
void main()
{
int ch,i,num;
front = -1;
rear = -1;
clrscr();
printf("nProgram for Circular Queue demonstration through array");
for(;;)
{
printf("nnMAIN
MENUn1.INSERTIONn2.DELETIONn3.DISPLAYn4.EXIT");
printf("nnENTER YOUR CHOICE : ");
scanf("%d",&ch);
switch(ch)
{
case 1: printf("nnENTER THE QUEUE ELEMENT : ");
scanf("%d",&num);
insert(num);
break;
case 2: del();
break;
case 3: display();
break;
case 4: exit(0);
default: printf("nnInvalid Choice.");
}
}
}](https://image.slidesharecdn.com/prg56-240502104338-495d8770/85/prg5-6-doc-computer-science-and-engineering-4-320.jpg)
![void insert(int item)
{
if(front ==(rear+1)%MAXSIZE)
{
}
else
{
printf("nnCIRCULAR QUEUE IS OVERFLOW");
if(front==-1)
front=rear=0;
else
rear=(rear+1)%MAXSIZE;
front);
}
cq[rear]=item;
printf("n Circular Queue Status:Rear = %d Front = %d ",rear ,
}
void del()
{
int a;
if(front == -1)
{
}
else
{
printf("nnCIRCULAR QUEUE IS UNDERFLOW");
a=cq[front];
cq[front]=0;
if(front==rear)
front=rear=-1;
else
front = (front+1)%MAXSIZE;
printf("nDELETED ELEMENT FROM QUEUE IS : %d ",a);
printf("nCircular Queue Status:Rear = %dFront = %d ",rear,front);
}
}
void display()
{
int i;
if(front==-1&&rear==-1)
{
}
else
{
printf("Queue is underflown");
for(i=0; i<MAXSIZE; i++)
printf("%dt", cq[i]);
}
}](https://image.slidesharecdn.com/prg56-240502104338-495d8770/85/prg5-6-doc-computer-science-and-engineering-5-320.jpg)
More Related Content
Similar to prg5,6,.doc computer science and engineering (20)
Recently uploaded (20)
prg5,6,.doc computer science and engineering
- 1. 5. Design, Develop and Implement a Program in C for the following Stack Applications a. Evaluation of Suffix expression with single digit operands and operators: +, -, *, /, %, ^ b. Solving Tower of Hanoi problem with n disks. #include<stdio.h> #include<conio.h> #define MAX 20 struct stack { int top; int str[MAX]; }s; charpostfix[MAX]; int pop(); intisoperand(char); intoperate(int,int,char); int main() { int i=0; intans,op1,op2; clrscr(); s.top=-1; printf("Enter a VALID POSTFIX Expression:"); scanf("%s",postfix); while(postfix[i]!='0') { if(isoperand(postfix[i])) push(postfix[i]-48); else { } i++; } op1=pop(); op2=pop(); ans=operate(op1,op2,postfix[i]); push(ans); printf("%d %c %d = %dn",op2,postfix[i],op1,ans); printf("Answer=%d",s.str[s.top]); getch(); return; }
- 2. int isoperand(char x) { if(x>='0' && x<='9') return 1; else } return 0; void push(int x) { if(s.top==MAX-1) { } else } printf("Enter expression < 20 charn"); getch(); exit(0); s.str[++s.top]=x; int pop() { if(s.top==-1) { } else } printf("INVALIDPOSTFIXEXPRESSIONn"); getch(); exit(0); returns.str[s.top--] int operate(int op1,int op2,char a) { switch(a) { case '+':return op2+op1; case '-':return op2-op1; case '*':return op2*op1; case '/':return op2/op1; case '%':return op2%op1; case '^':return pow(op2,op1); } return 0; }
- 3. B) Tower of hanoi #include <stdio.h> #include<conio.h> void towers(int, char, char, char); int main() { int num; clrscr(); printf("Enter the number of disks : "); scanf("%d", &num); printf("The sequence of moves involved in the Tower of Hanoi are :n"); towers(num, 'A', 'C', 'B'); getch(); return 0; } void towers(int num, char frompeg, char topeg, char auxpeg) { if (num == 1) { printf("n Move disk 1 from peg %c to peg %c", frompeg, topeg); return; } towers(num - 1, frompeg, auxpeg, topeg); printf("n Move disk %d from peg %c to peg %c", num, frompeg, topeg); towers(num - 1, auxpeg, topeg, frompeg); }
- 4. 6.Design, Develop and Implement a menu driven Program in C for the following operations on Circular QUEUE of Characters (Array Implementation of Queue with maximum size MAX) a. Insert an Element on to Circular QUEUE b. Delete an Element from Circular QUEUE c. Demonstrate Overflow and Underflow situations on Circular QUEUE d. Display the status of Circular QUEUE e. Exit. Support the program with appropriate functions for each of the above operations #include <stdio.h> #include<conio.h> #define MAXSIZE 5 int cq[MAXSIZE]={0}; int front,rear; void insert(int); void del(); void display(); void main() { int ch,i,num; front = -1; rear = -1; clrscr(); printf("nProgram for Circular Queue demonstration through array"); for(;;) { printf("nnMAIN MENUn1.INSERTIONn2.DELETIONn3.DISPLAYn4.EXIT"); printf("nnENTER YOUR CHOICE : "); scanf("%d",&ch); switch(ch) { case 1: printf("nnENTER THE QUEUE ELEMENT : "); scanf("%d",&num); insert(num); break; case 2: del(); break; case 3: display(); break; case 4: exit(0); default: printf("nnInvalid Choice."); } } }
- 5. void insert(int item) { if(front ==(rear+1)%MAXSIZE) { } else { printf("nnCIRCULAR QUEUE IS OVERFLOW"); if(front==-1) front=rear=0; else rear=(rear+1)%MAXSIZE; front); } cq[rear]=item; printf("n Circular Queue Status:Rear = %d Front = %d ",rear , } void del() { int a; if(front == -1) { } else { printf("nnCIRCULAR QUEUE IS UNDERFLOW"); a=cq[front]; cq[front]=0; if(front==rear) front=rear=-1; else front = (front+1)%MAXSIZE; printf("nDELETED ELEMENT FROM QUEUE IS : %d ",a); printf("nCircular Queue Status:Rear = %dFront = %d ",rear,front); } } void display() { int i; if(front==-1&&rear==-1) { } else { printf("Queue is underflown"); for(i=0; i<MAXSIZE; i++) printf("%dt", cq[i]); } }