Question

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

7) Using the algorithm convertToPostfix , given in Segment 5.16, convert each of the following infix expres-sions 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

Problem: Complete Exercises 5, 6, and 7 above..

Exercise 5: Describe SPECIFICALLY a. What value is displayed when the code executes? b. what mathematical function odes it evaluate?

Exercise 6: What value is displayed when the code executes?

Exercise 7: Convert the expressions from infix format to postfix format.

Requirements: You will submit the lab in written format ONLY, no coding is required (Need answers ASAP please)

Answer 1

Answers are as follows :

a.) What value is displayed when this code executes? => 1*2*3*4 = 24 is the answer

b.) What mathematical function does the code evaluate? It computes Factorial



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

Contents of the Stack

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

Stack will contain
1. {
2. { [
3. { [ (
4. { [
5. {
6. Empty

b) { a ( b * c ) / [ d + e ] / f ) - g }
Stack will contain  
1. {   
2. { (
3. {
4. { [
5. { ---> Ends
6. { ---> Ends and returns false

c) a { b [ c - d ] e ] ) f
1. {   
2. { [
3. {
4. { ---> ']' No matching parenthesis '[' found so retiurns false


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

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

a*b / cd-

ab*/cd-
ab* cd - /

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

c) a / b * ( c + ( d - e ))
a / b * cde- +
ab/cde- +*

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

Thanks, let me know if there is any concern.