Page 543 - Computer science 868 Class 12
P. 543
The reverse of the expression ( ( F - E ) / D ) * ( C + B / A ))
Prefix
Symbol Stack status Output
( (
( ( (
F ( ( F
- ( ( - F
E ( ( - F E
) ( ( - ) F E -
/ ( / F E -
D ( / F E - D
) ( / ) F E - D /
* * F E - D /
( *( F E - D /
C *( F E - D / C
+ *( + F E - D / C
B *( + F E - D / C B
/ *( + / F E- D / C B
A *(+ / F E - D / C B A
) *(+/ ) F E - D / C B A / + *
Reversing the expression * + / A B C / D - E F
4. Give the output of the following program segment:
class Stack
{ final int size = 50;
private int stak[];
private int top;
public Stack()
{ top=0; stak=new int[size]; }
public void push(int x) { stak[top++]= x; }
public int pop() { return stak[top--]; }
public void main()
{ Stack s1=new Stack();
s1.push(51);
s1.push(27);
s1.push(5);
System.out.println("\n"+s1.pop());
System.out.println("\n"+s1.pop());
s1.push(18);
s1.push(72);
System.out.println("\n"+s1.pop());
}
}
541
Data Structures 541

