Question: Java Programming: Please answer all the questions. Thank you in advance. Java Programmin 5. Given the following statements: Stack snew Stack Stack tnew Stack s.push

Java Programming: Please answer all the questions. Thank you in advance.
Java Programmin 5. Given the following statements: Stack snew Stack Stack tnew Stack s.push (29) t.push (18) s.push (60) t.push (s.peek Indicate the value displayed by the statement: System.out.print (t.peek s.pop)) II add the two integers and print the sum 1. Given the following statements: Stacks = new Stack ( ); 3 . push ( 36) ; s.push (13) s.push (59) s.pop Indicate the value displayed by the statement: System. out.print (s.pop) Answer 2. Given the following statements: Stack 3= new Stack ( ); s.push (40) s.push (5) s.push (56) s.peek Indicate the value displayed by the statement: System.out.print (s.pop () swer 6. Complete the code segment below, which prints the element at the bottom of the Stack s. The stack elements are restored after the value is printed. The code segment needs to be completed by using a temp stack and the operations push, peek, pop, and empty Stack s new Stack); // Assume code to add elements to s goes here Answer: Stack temp new Stack); String word 3. Given the following statements: Stack snew Stack) s.push (36) s.push (13): s.pop ( 3 . push ( 59) ; s.pop ( Indicate the value displayed by the statement: System. out.print (s.peek // The following loop removes elements from s and adds them to the temp stack while (s.empty ()) word Answer. temp.push (word); 4. Given the following statements: Stack new Stack) Stack tnew Stack s.push (31) 3 . push ( 1 ) ; s.push (46) while ( ! 3 . empty ( ) ) System.out.println(temp.(); // print element at the top of temp // The following loop restores the elements of s in their original order t.push (s.pop()) .empty()) Indicate the value displayed by the statement: System.out.print (t.peek word - temp.pop ) (word); wer
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
