Test my Merit My Results Create Exam

Higher Study | Programming and Data Structure | Stack

In what order the elements of a pushdown stack are accessed?
Which of the following is the postfix equivalent of (9 - 5) + 2 ?
Which of the following data structures is most suitable for evaluating postfix expressions? 
Which of the following applications may use a stack? (a) Parenthesis balancing program (b) Process scheduling operating system (c) Conversion of infix arithmetic expression to postfix form
A stack is implemented with an array of ‘A [0..N – 1]’ and a variable ‘pos’. The push and pop operations are defined by the following code. push(x)                 A[pos] ← x                 pos ← pos – 1 end push pop( )                 pos ← pos + 1                 return A[pos] end pop Which of the following will initialize an empty stack with capacity N for the above implementation?
What is the postfix representation of the following infix expression? (A + B) * C – D * E / F
Ads