Question

A stack is a list with a last-in-first-out (LIFO) ordering of its elements. Stacks are very useful for many applications, such as processing algebraic expressions or reversing the order of lists. Exercise 1: Write a program using the java.util.Stack data structure that prompts for an integer and reverses it: 7359 becomes 9537. Hints: Think of how base-10 works: A base-10 number is a sum of digit * 100 + digit * 101 + digit * 102, etc., where each digit in your number is that digit times a power of 10, that is: 1 x digit + 10 x digit + 100 x digit + .... Using that understanding, you can use modulo and integer arithmetic to get each digit and add it to a stack. Algorithm: Your number % 10 will give you the rightmost number. Example: 7359 % 10 = 9. Put the 9 on the stack. Now divide 7359/10 = 735. Repeat the process, that is 735 % 10 = 5, put the 5 on the stack, 735/10 = 73, use 73 % 10 to get the 3. Keep going, adding digits to the stack until you run out of numbers. Note: when you pop the numbers of your stack (remove), they will come off the stack reversed. You will do that below. Note: when Stack.isEmpty() tells you whet

Name: a stack is a list with a last in first out lifo ordering of its elements stacks are very useful for many applications such as processing algebraic expressions or reversing the order of lists 63815
Uploaded: 2023-09-12T03:47:26-08:00
Duration: 5 min 21 s
Channel: Supreeta N
Description: a stack is a list with a last in first out lifo ordering of its elements stacks are very useful for many applications such as processing algebraic expressions or reversing the order of lists 63815

          A stack is a list with a last-in-first-out (LIFO) ordering of its elements. Stacks are very useful for many applications, such as processing algebraic expressions or reversing the order of lists. 
Exercise 1: 
Write a program using the java.util.Stack data structure that prompts for an integer and reverses it: 7359 becomes 9537. 
Hints: 
Think of how base-10 works: A base-10 number is a sum of digit * 100 + digit * 101 + digit * 102, etc., where each digit in your number is that digit times a power of 10, that is: 1 x digit + 10 x digit + 100 x digit + ....
Using that understanding, you can use modulo and integer arithmetic to get each digit and add it to a stack. Algorithm: Your number % 10 will give you the rightmost number. Example: 7359 % 10 = 9. Put the 9 on the stack. Now divide 7359/10 = 735. Repeat the process, that is 735 % 10 = 5, put the 5 on the stack, 735/10 = 73, use 73 % 10 to get the 3. Keep going, adding digits to the stack until you run out of numbers. 
Note: when you pop the numbers of your stack (remove), they will come off the stack reversed. You will do that below. 
Note: when Stack.isEmpty() tells you whet

Added by Luz O.

Question

Please give Ace some feedback