https://shikshamentor.

com/data-structure-
using-c-for-msbte-3k-scheme/

313301 – Data Structure (Sem III)

As per MSBTE’s K Scheme
CO / CM / IF

Unit IV Stack Marks – 12

S. N. Exam
MSBTE Board Asked Questions Marks
Year
1 Define stack with suitable example S -24 02

2 Explain PUSH and POP operation on stack with suitable example S -24 04
S -24
Convert the following infix expression to postfix expression using stack and
3 S – 23 04
show the details of stack in each step : ((A+B)*C)^(D-E)
W - 19
4 Evaluate the given infix expression to the postfix expression using stack:
S -24 06
((a/(b-c+d))*(e-a)*c)
Convert the following infix expression to its postfix form using stack: A + B –
5 S -23 06
C*D/E+F
Convert the given infix expression to postfix expression using stack and the
6 details of stack at each step of conversion Expression: A * B C – D / E +[F / S -23 04
G]
Show the effect of PUSH and POP operation on the stack of size 10. The stack
contains 10, 20, 25, 15, 30 and 40 with 40 being at top of stack. Show
7 S -23 04
diagrammatically the effect of
i) PUSH (45) ii) PUSH (50) iii) POP iv) PUSH (55)
Find out prefix equivalent of the expression,
8 I [(A+B)+C]*D S -23 06
II A[(B * C) + D]

9 Write any two-operation performed on the stack S -23 02

10 Enlist operations on stack. S – 22 02

11 Explain stack overflow and underflow condition with example. S – 23 04
Show the effect of PUSH and POP operation on to the stack of size 10. The
stack contains 10, 20,30,40,50, and 60, with 60 being at top of the stack. Show
12 diagrammatically the effect of- S – 23 04
i PUSH 55
ii PUSH 70
 iii POP
iv POP

Sketch the final structure of stack after performing the above said operation
13 Evaluate the following postfix expression: 4 6 24 + * 6 3 / - S – 23 06

14 List any four applications of stack W – 22 02

Convert following expression into postfix form with illustration of all steps
15 W – 22 04
using stack :(A + B – C + D*E/F^G)
W – 22
16 Differentiate between Stack and Queue (any four points). 04
W – 18
W - 22
17 Explain stack overflow and stack underflow with example. 04
S – 19
Write a menu driven ‘C’ program to implement stack using array with the W – 22
following menu: i) push ii) pop iii) display iv) exit
18 06
Write a program to implement a stack with push, pop and display operations. S – 22
Evaluate the following postfix expression: 10, 2, *, 15, 3, /, +, 12, 3, +, + Show
20 S – 22 04
diagrammatically each step of evaluation using stack.
Convert the following Infix expression to its prefix form using stack. Show the
21 S – 22 06
details of stack at each step of conversion. Expression: P * Q R – S / T + (U/V)
22 Define the terms ‘overflow’ and ‘underflow’ with respect to stack. W – 19 02
Evaluate the following arithmetic expression P written in postfix notation :P : 4,
23 W – 19 04
2, ^, 3, *, 3, -, 8, 4, /, +
Convert the following infix expression to postfix expression using stack and
24 W – 19 04
show the details of stack in each step. ((A+B)*D)^(E-F) ((A+B)*D)^(E-F)
Show the effect of PUSH and POP operations on the stack of size 10.
26 W – 19 04
PUSH(10) , PUSH(20), POP, PUSH(30)
26 Explain the concept of recursion using stack. W – 19 06
Show the memory representation of stack using array with the help of a
27 S – 19 02
diagram.
Evaluate the following postfix expression: 5, 6, 2, +, *, 12, 4, /, – Show
28 S – 19 04
diagrammatically each step of evolution using stack.
Evaluate the following prefix expression: – * + 4 3 2 5 Show diagrammatically
29 S – 19 04
each step of evaluation using stack.
Show the effect of PUSH and POP operation on to the stack of size 10. The
stack contains 40, 30, 52, 86, 39, 45, 50 with 50 being at top of the stack. Show
diagrammatically the effect of :
30 (i)PUSH 59 (ii) PUSH 85 (iii) POP (iv) POP (v) PUSH 59 (vi) POP .Sketch the S – 19 06
final structure of stack after performing the above said operations.

31 Evaluate the following postfix expression: 57 + 62 – * = S – 19 06

Convert infix expression into prefix expression:
32 W – 18 04
(A + B)*(C / G) + F
Convert infix expression into prefix expression:
33 W – 18 04
(A + B)*(C / G) + F
Convert infix expression into prefix expression:
34 W – 18 04
(A + B)*(C / G) + F
 Thank You
https://shikshamentor.com/data-structure-using-c-for-
msbte-3k-scheme/

Visit
https://shikshamentor.com/