#include <conio.h> #include <stdio.h> #include <string.h> int menu() { int ch; printf("\n\nMENU"); pr...

Program: #include <stdio.h> #include <string.h> int push(char item,char s[],int top) {     top=top+1;     s[top]=item;  ...

Program: #include<stdio.h> #include<string.h> int pr(char op) {     switch(op)     {         case '*': return 2;...

Algorithm 1.Read the size of array A and assign it to m 2.Print "Enter elements of array A" 3.for(i=0;i<m;i++)     ...

Algorithm_Push(): 1.if ((top>=size-1) OR (top>=rear-1))               //check top occupies whole arrray (ie, size-1) or just before ...