Write a Java program to accomplish the following tasks. After you are done, send the original Java code along with screenshots of the result. Create an empty stack. Add 5 numbers to the stack. Reverse the order of these numbers in the stack. Hint: After pushing 5 numbers to the stack, popping them to an empty queue then transfers the data to the stack (this is only one of the solutions).

Write a Java program to accomplish the following tasks. After you are done, send the original Java code along with screenshots of the result. Create an empty stack. Add 5 numbers to the stack. Reverse the order of these numbers in the stack. Hint: After pushing 5 numbers to the stack, popping them to an empty queue then transfers the data to the stack (this is only one of the solutions).

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

Implement a simple stack in java using the scenario below. A company wishes to keep track of the order in which it employed staff. Users can enter either "f" to fire, "h" to hire or "e" to end the program. When a member of staff is employed, their employee number is added to the top of a stack when someone has to be made redundant, the last person to join the company is removed from the top of the stack. Hint: Use ArrayList
In a java compiler, Create a program that loads the following elements in a stack. (Oppo, Realme, Samsung, Huawei, Vivo). Remove the last element in the stack and display the remaining elements. Show also the size of the stack and find the position of the element ‘Vivo’ in the stack. Sample output will be given
Write a Java program that extracts the repeated numbers from the stack, i.e. eliminates the repeated numbers
IN JAVA First, Implement the method public void display() which displays the entries in a stack starting from the top. If the stack is empty, print “The stack is empty”. Add the method to ArrrayStack2.java. You do not need to modify StackInterface.java. Then, Implement a method public int remove(int n) The method removes the n top most entries for a stack . If the stack contains less than n items, the stack becomes empty. The method returns the number of items removed. Add the method to ArrrayStack2.java. You do not need to modify StackInterface.java. Then, Suppose that in the array-based stack, the array doubles in size after multiple push operations. But later on, fewer than half of the array’s locations might actually be used by the stack due to pop operations. Revise the implementation so that its array also can shrink in size as objects are removed from the stack. Accomplishing this task will require two new private methods, as follows: The first new method checks whether we…
Write a Java program that allow the user 1.Implement a queue in an array2. Enter the following number 3,4,6,7,2,1,0) in the queue 3. Reverse the queue element using a stack to display them in this order (i.e. 0,1,2,7,6,4,3).
Write a java program which follows conditions written below: Consisting of four (4) book titles entered by the user. Pop the stack's elements one by one; each popped element will be added to a queue. Then, print the content of the queue. Input: Enter four book titles. Book 1: Ibong Adarna Book 2: Florante at Laura Book 3: Ilustrado Book 4: ABNKKBSNPLAko?! Expected Output: New order of books: [ABNKKBSNPLAko?!, Ilustrado, Florante at Laura, Ibong Adarna]
Lab 18: Stack, SentenceReverser Java language Use a stack to reverse the words of a sentence. Keep reading words until you have a word that ends in a period, adding them onto a stack. When you have a word with a period, pop the words off and print them. Stop when there are no more words in the input. For example, you should turn the inputMary had a little lamb. Its fleece was white as snow.intoLamb little a had mary. Snow as white was fleece its.Pay attention to capitalization and the placement of the period.
Write a program and fill a queue with random numbers between 0 and 100. The size of thequeue is assumed to be 15. After filling the array with random numbers, display the elements in the queue and remove the elements of the queue and store these numbers according to the following criteria.If the number in the queue is less than 50, remove it from the queue and store it inside queue 2.Else, remove the number and store these values inside queue 3.Display all three queues on the screen.
Write a complete Program in Java to implement circular queue using array for the following tasks: 1. Method to insert the new element in the circular queue 2. Method to delete an element from the circular queue 3. Method to display all the elements of the circular queue 4. Create the test class to perform the operations on circular queue in the following sequence: a. Add a new element 10 b. Add a new element 20 c. Add a new element 30 d. Add a new element 40 e. Display all elements f. Delete from the circular queue g. Delete from the circular queue h. Add a new element 50 i. Add a new element 60 j. Add a new element 70 Please screenshot of the output
Create a TestStack project. Add a Stack class with all of the methods implemented and commented (constructor, push, pop, is empty, clear, peek, toString). Create a TestStack class with main(). main() should use your Stack class to do one of the following: OPTION A) Use your stack class to reverse a user inputted string. A palindrome is a word that reads the same backwards as it does forwards. For example, madam is a palindrome, hello is not. Use your stack class to test if an input string is a palindrone or not. OPTION B) Use your new Stack to add a function that checks for balanced parenthese in an equation. Use these three equations, plus one of your own to test your code. ((3^2 + 8)*(5/2))/(2+6) ((3^2 + 8)*(5/2))/(2+6)) (((3^2 + 8)*(5/2)/(2+6) When encountering a left parenthese, push it on the stack. Pop one off when you encounter a right parenthese. Return true or false depending if parentheses are balanced or not (stack is empty after last right parenthese causes a…
Create a program that loads the following elements in a stack. (Oppo, Realme, Samsung, Huawei, Vivo). Remove the last element in the stack and display the remaining elements. Show also the size of the stack and find the position of the element ‘Vivo’ in the stack.
Write a Java program to implement the following: Ask the user to enter the names of 3 Books and store them in an ArrayList called Book Remove the second book from the list Add the user to enter a new book name and store to be the first book of the list Ask the user to enter a book name, search for it in list, and print “exist” or “not exist” Print the book name at index 2 Print all list items using loop Print the size of the list