Question 1: In this question, you are provided with a class TowersofHanoiand you will be solving the Towers of Hanoi problem using a stack-based iterativesolution. To save your time, this lab will allow you to use the Java built-in Stackclass. Here's a code snippet of creating a stack that accepts integers and some of itsoperations:Stack myStackmyStack.push (5); // add 5 to the top oI the stackmyStack.peek ();- new Stack<> ();// return the top of the stack this7/ is actually the top method we/ defined in our NumebrStack ADT.myStack.pop();// remove and return the element at/ the top of the stackStep 1-Crcate a helper mcthod named move which takes two parameters of typeStack called source and destination.Your method should check the following conditions.•if the destination stack is empty, then add a dise from source.• if the souEce stack is empty, then add a disc from the destination.• if the top clement of the source stack is smaller than the top element of thedestinaton stack, then pop the source stack and push the clementonto the destination stack, otherwise, do the opposite,Step 2-Create a method name solveTOH that takes one int and three Stackparameters named, n, 2ource, helper, and dest respectively.Your method should contain:OAn int variable named numofMoves that stores 2"-1 minimum numberof moves to solve the puzzle.•A loop that iterates for nusOfMoves times.Inside the loop. create three if statements, each Statement should move adisc based on the result of:% 3, where i is the cITent number of moves and3 is the number of stacks.樂When 1 % 3 is equal to 1. move a dise from source to destination. o When i % 3 is equal to 2, move a disc from the source to the helperstacko When i % 3 is equal to 0, move a disc in from the destination to thehelper stack.• An if statement that swaps the destination and helper stacks.• Print statements that print the contents of all three stacks as arrays.With the given main method, enter the number of dises you would like to test.Sample Outputs:Please enter the number of disks: 3State 1:[3,2] [) [1)State 2: [3] [2] [1]State 3: [3] (2, 1] OState 4: [] (2, 1] [3]State 5: [1] (2] (3]State 6:[1] 0 [3, 2]State 7: 00 (3, 2, 1]

Java code for tower of Hanoi public class Hanoi{ static void towerOfHanoi(int n, char from_rod, char…

Question 1: In this question, you are provided with a class TowersofHanoi you will be solving the Towers of Hanoi problem using a stack-based iterative solution. To save your time, this lab will allow you to use the Java built-in Stack class. Here's a code snippet of creating a stack that accepts integers and some of its operations: and

Question 1: In this question, you are provided with a class TowersofHanoi you will be solving the Towers of Hanoi problem using a stack-based iterative solution. To save your time, this lab will allow you to use the Java built-in Stack class. Here's a code snippet of creating a stack that accepts integers and some of its operations: and

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

Given a stack of positive integers, write a Java method called movePrimes that rearranges elements of the stack such that all prime numbers are below none primes regardless to the order of primes. Note: You are allowed to create only one other stack. You can not use other data structures such as array, arraylist, queue, ....etc. Consider the following example:
You will create two programs. The first one will use the data structure Stack and the other program will use the data structure Queue. Keep in mind that you should already know from your video and free textbook that Java uses a LinkedList integration for Queue. Stack Program Create a deck of cards using an array (Array size 15). Each card is an object. So you will have to create a Card class that has a value (1 - 10, Jack, Queen, King, Ace) and suit (clubs, diamonds, heart, spade). You will create a stack and randomly pick a card from the deck to put be pushed onto the stack. You will repeat this 5 times. Then you will take cards off the top of the stack (pop) and reveal the values of the cards in the output. As a challenge, you may have the user guess the value and suit of the card at the bottom of the stack. Queue Program There is a new concert coming to town. This concert is popular and has a long line. The line uses the data structure Queue. The people in the line are objects…
Please use the starter code below to answer the question in the screenshot. Please make sure to put the code in the solution and screenshot of the successful program run. public class Stack_Queue_Driver {// You would like a nice representation of a stack public static void main(String[] args) {// FOR OPTION 1ArrayStack myStack = new ArrayStack();myStack.push(1);myStack.push(2);myStack.push(3);myStack.push(4);myStack.push(5);myStack.push(6);myStack.push(7);myStack.push(8);myStack.push(9);System.out.println("My stack:");displayS(myStack);System.out.println();ArrayStack reversed = reverseStack(myStack);System.out.println("My reversed stack:");displayS(reversed);System.out.println();//-----------------------// FOR OPTION 2ArrayQueue<Integer> myQueue = new ArrayQueue<Integer>();myQueue.add(3);myQueue.add(5);myQueue.add(2);myQueue.add(1);myQueue.add(4);System.out.println("My queue:");displayQ(myQueue);System.out.println();ArrayQueue<Integer> sortedQ =…
Please use the starter code below to answer the question in the screenshot. Please make sure to put the code in the solution and screenshot of the successful program run. Please also explain what the coding is doing in separate paragraphs. public class Stack_Queue_Driver {// You would like a nice representation of a stack public static void main(String[] args) {// FOR OPTION 1ArrayStack myStack = new ArrayStack();myStack.push(1);myStack.push(2);myStack.push(3);myStack.push(4);myStack.push(5);myStack.push(6);myStack.push(7);myStack.push(8);myStack.push(9);System.out.println("My stack:");displayS(myStack);System.out.println();ArrayStack reversed = reverseStack(myStack);System.out.println("My reversed stack:");displayS(reversed);System.out.println();//-----------------------// FOR OPTION 2ArrayQueue<Integer> myQueue = new ArrayQueue<Integer>();myQueue.add(3);myQueue.add(5);myQueue.add(2);myQueue.add(1);myQueue.add(4);System.out.println("My…
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
Write a method that takes as parameters two sorted stacks of integers s1 and s2 (where the lowest value is at the top) and returns a sorted stack (lowest on top) that contains the values of both s1 and s2. You are allowed to use only the stack operations such as pop, push, and top. You are allowed to use only stacks as temporary storage. No other data structures such as arrays are allowed. The header of the method is: public static Stack mergeSortedStacks (Stack s1, Stack s2) Write a main method in which you create two sorted stacks and call the above method to test it.
Use stacks from the STL to implement a video game library functionality. In this implementation, consider a VideoGame class with title, release year, genre and publisher as variables. Provide setters and getters to these variables. In main, create a stack of video games. Add 5 different game objects into the stack. Then in a loop, for each item that you retrieve from the stack display the game information as follows: TITLEYEARGENREPUBLISHER
Java programming question
Note: I hope that the solution to this question will be private in the sense that it is not taken from other sites and that it will be solved in less than an hour. Thank you
1. Use a below-given starter code. Use StackInterface.(h), and ArrayStack.(h,cpp). You will write your own StackDriver.cpp application file. IT'S IN C++Also...If the class that you create is Star, remember that you will declare your stack as follows:ArrayStack<Star> myStarStack;and you will push, pop, and peek Star objects.2. Create your own class definition. I should have at least one attribute, a constructor, and set and get methods for each attribute in your class.NOTE: If your class is offensive your lab will be rejected and you will receive a score of zero. I'm sorry I have to say this but there is a history of this happening and it is not appropriate.3. Write a driver program that exercises the Stack class from the downloaded starter code. Create multiple instances of your own class and demonstrate the stack operations: push, pop, and peek. ( you write your own class that you will put on the stack and you will write a driver that pushes, peeks, and pops your class items…
Complete ArrayStack.java, an array-based implementation o the Stack.java interface. Modify only the bodies of the following methods in the ArrayStack class: push pop top isEmpty isFull Nothing else should be modified in ArrayStack. Write the class ArrayStackTest to test your implementation. Print only the names of the tests and error messages. Give the test method meaningful names (e.g., emptyStackTest). Test push, pop, top, and isEmpty immediately after the stack has been instantiated. Push an element on an empty stack. Test pop, top, and isEmpty. Instantiate a stack with initialCapacity of 1. Push two elements. Check capacity. Other tests you deem necessary.
It's a very nice application of stacks. Consider that a freight train has n railroad cars. Each to be left at different station. They're numbered 1 through n & freight train visits these stations in order n through 1. Obviously, the railroad cars are labeled by their destination. To facilitate removal of the cars from the train, we must rearrange them in ascending order of their number (i.e. 1 through n). When cars are in this order, they can be detached at each station. We rearrange cars at a shunting yard that has input track, output track & k holding tracks between input & output tracks (i.e. holding track). The figure shows a shunting yard with three holding tracks H1, H2 & H3, also n = 9. The n cars of freight train begin in the input track & are to end up in the output track in order 1 through n from right to left. The cars initially are in the order 5,8,1,7,4,2,9,6,3 from back to front. Later cars are rearranged in desired order. To rearrange cars, we…