JAVA 3 Lab#4: STACKS

5) Consider the following Java statements, assuming that MyStack is a class that implements the interface StackInterface:

int n = 4;

StackInterface stack = new MyStack();

while (n > 0)

{

stack.push(n);

n--; }

// end while

int result = 1;

while (!stack.isEmpty())

{

int integer = stack.pop();

result = result * integer;

} // end while

System.out.println("result = " + result);

a. What value is displayed when this code executes?

b. What mathematical function does the code evaluate?

6) Show the contents of the stack as you trace the algorithm checkBalance, given in Segment 5.8, for each of the following expressions:

a. a {b [c * (d + e)] - f }

b. {a ( b * c ) / [d + e] / f )- g}

c. a {b [c - d ] e] ) f

What value is displayed when the code executes?

7) Using the algorithm convertToPostfix, given in Segment 5.16, convert each of the following infix expressions to postfix expressions:

a. a * b / (c - d )

b. (a - b * c) / (d * e * f + g)

c. a / b * (c + (d - e))

d. (a ^ b * c - d ) ^ e + f ^ g ^ h

Convert the expressions from infix format to postfix format.

Requirements: You will submit the lab in written format ONLY, no coding is required.