Topic: Application of Stack

Difficulty: High

Year(Marks): May2018(10 mks)

        #include<stdio.h>
        #include<conio.h>

        int stack[20];
        int top = -1;

        void push(int x)
        {
            stack[++top] = x;
        }
        int pop()
        {
            return stack[top--];
        }

        void main()
        {
            char exp[20];
            char *e;
            int n1,n2,n3,num;
            clrscr();
            printf("Enter the expression :: ");
            scanf("%s",exp);
            e = exp;
            while(*e != '\0')
            {
                if(isdigit(*e))
                {
                    num = *e …