Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
11th Edition
ISBN: 9780134670942
Author: Y. Daniel Liang
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 18.7, Problem 18.7.1CP
Program Plan Intro
Towers of Hanoi:
This is a type of program which is difficult to solve. It gets easier to solve using recursion. The problem includes moving a particular number of disks of different sizes from one tower to another. It has certain rules in moving the disks they are:
- The towers are labeled “A”, “B”, and “C”. The disks are labeled as 1, 2, 3, and so on.
- The bigger disk should not be on the top of smaller disk.
- Initially all the disks are placed on tower A.
- Only one disk can be moved at a time.
The aim of this problem is to move all the disks from tower A to tower B without violating the above rules.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
The code given below represents a saveTransaction() method which is used to save data to a database from the Java program. Given the classes in the image as well as an image of the screen which will call the function, modify the given code so that it loops through the items again, this time as it loops through you are to insert the data into the salesdetails table, note that the SalesNumber from the AUTO-INCREMENT field from above is to be inserted here with each record being placed into the salesdetails table. Finally, as you loop through the items the product table must be update because as products are sold the onhand field in the products table must be updated. When multiple tables are to be updated with related data, you should wrap it into a DMBS transaction.
The schema for the database is also depicted.
public class PosDAO { private Connection connection; public PosDAO(Connection connection) { this.connection = connection; } public void…
Match all the folowing?
TASK 7. Generic solution (Methods with Variable-Length Arguments). Review varargs, Implement the following code, test it with different input, make sure it runs without errors.
Chapter 18 Solutions
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
Ch. 18.2 - What is a recursive method? What is an infinite...Ch. 18.2 - Prob. 18.2.2CPCh. 18.2 - Show the output of the following programs and...Ch. 18.2 - Prob. 18.2.4CPCh. 18.2 - Prob. 18.2.5CPCh. 18.2 - Write a recursive mathematical definition for...Ch. 18.3 - Prob. 18.3.1CPCh. 18.3 - What is wrong in the following methods?Ch. 18.3 - Prob. 18.3.3CPCh. 18.4 - Describe the characteristics of recursive methods.
Ch. 18.4 - Prob. 18.4.2CPCh. 18.4 - Prob. 18.4.3CPCh. 18.5 - Prob. 18.5.1CPCh. 18.5 - Prob. 18.5.2CPCh. 18.5 - What is a recursive helper method?Ch. 18.6 - Prob. 18.6.1CPCh. 18.6 - How does the program get all files and directories...Ch. 18.6 - How many times will the getSize method be invoked...Ch. 18.6 - Will the program work if the directory is empty...Ch. 18.6 - Will the program work if line 20 is replaced by...Ch. 18.6 - Will the program work if lines 20 and 21 are...Ch. 18.7 - Prob. 18.7.1CPCh. 18.8 - Prob. 18.8.1CPCh. 18.8 - Prob. 18.8.2CPCh. 18.8 - How many times is the displayTriangles method...Ch. 18.8 - Prob. 18.8.4CPCh. 18.8 - Prob. 18.8.5CPCh. 18.9 - Which of the following statements are true? a. Any...Ch. 18.9 - Prob. 18.9.2CPCh. 18.10 - Identify tail-recursive methods in this chapter.Ch. 18.10 - Rewrite the fib method in Listing 18.2 using tail...Ch. 18 - Prob. 18.1PECh. 18 - Prob. 18.2PECh. 18 - (Compute greatest common divisor using recursion)...Ch. 18 - (Sum series) Write a recursive method to compute...Ch. 18 - (Sum series) Write a recursive method to compute...Ch. 18 - (Sum series) Write a recursive method to compute...Ch. 18 - (Fibonacci series) Modify Listing 18.2,...Ch. 18 - Prob. 18.8PECh. 18 - (Print the characters in a string reversely) Write...Ch. 18 - (Occurrences of a specified character in a string)...Ch. 18 - Prob. 18.11PECh. 18 - (Print the characters in a string reversely)...Ch. 18 - (Find the largest number in an array) Write a...Ch. 18 - (Find the number of uppercase letters in a string)...Ch. 18 - Prob. 18.15PECh. 18 - (Find the number of uppercase letters in an array)...Ch. 18 - (Occurrences of a specified character in an array)...Ch. 18 - (Tower of Hanoi) Modify Listing 18.8,...Ch. 18 - Prob. 18.19PECh. 18 - (Display circles) Write a Java program that...Ch. 18 - (Decimal to binary) Write a recursive method that...Ch. 18 - (Decimal to hex) Write a recursive method that...Ch. 18 - (Binary to decimal) Write a recursive method that...Ch. 18 - (Hex to decimal) Write a recursive method that...Ch. 18 - Prob. 18.25PECh. 18 - (Create a maze) Write a program that will find a...Ch. 18 - (Koch snowflake fractal) The text presented the...Ch. 18 - (Nonrecursive directory size) Rewrite Listing...Ch. 18 - (Number of files in a directory) Write a program...Ch. 18 - (Game: Knights Tour) The Knights Tour is an...Ch. 18 - (Game: Knights Tour animation) Write a program for...Ch. 18 - (Game: Eight Queens) The Eight Queens problem is...Ch. 18 - Prob. 18.35PECh. 18 - (Sierpinski triangle) Write a program that lets...Ch. 18 - (Hilbert curve) The Hilbert curve, first described...Ch. 18 - (Recursive tree) Write a program to display a...Ch. 18 - Prob. 18.39PE
Knowledge Booster
Similar questions
- You are to implement removeHead, and removeTail and you also have to create the following functions (for visual purposes of the detail explanation, header and trailer sentinels are described as h and t respectively): IMPORTANT NOTE: For all the methods that has the pos parameter i.e. addAt, removeAt, move, make sure to access that specified position from whichever is nearer - the head or the tail - similar to what we have done in the get method. Example DoublyLinkedList: h <-> 10 <-> 30 <-> 40 <-> 50 <-> t int add(int num) This will add the element num into the last element of the linked list and return the position of the newly-added element. In the above example, having add(60) will return 5 as it is the fifth position in the list. int remove(int num) This will remove the first instance of the element and return the position of the removed element. In the above example, having remove(40) will return 3 as 40 was the third element in the linked list…arrow_forwardGiven: Ggplot2 and K-means Method in R install.packages("ggplot2")library(ggplot2)# load the datesetdata(mtcars) after drawing the elbow curve, you can guess, 2 or 3 different numbers of clusters, depending on how the elbow bends ( the sharper the elbow bends, meaning the error drops very sharpy, then pick 1 k, if the error drops NOT so sharply, then pick 2, 3, or 4 different k value. Sharpy e.g 90 degree bend not so sharply e.g 45 - 60 degree you MUST summarize your results, e.g. your choice(s) of number of clusters, relationship between wt and mpg etc. any relationship between mpg and wt?arrow_forwardI have a django project that I am working on an I am trying to add a UserList to my Allgroups class. However, I'm getting these errors: ERRORS:allgroups.Allgroups.UserList: (fields.E304) Reverse accessor for 'Allgroups.UserList' clashes with reverse accessor for 'Allgroups.author'.HINT: Add or change a related_name argument to the definition for 'Allgroups.UserList' or 'Allgroups.author'.allgroups.Allgroups.author: (fields.E304) Reverse accessor for 'Allgroups.author' clashes with reverse accessor for 'Allgroups.UserList'.HINT: Add or change a related_name argument to the definition for 'Allgroups.author' or 'Allgroups.UserList'. I need both an author and a UserList for the Allgroups class, so I'm not sure what I need to do.arrow_forward
- . Download the program from the instructor’s GitHub account (Ch3HW) then update it tocreate a class Student that includes four properties: an id (type Integer), a name (type String), a Major (type String) and a Grade (type Double). Use class Student to create objects (using buttonAdd) that will be read from the TextFields then save it intoan ArrayList. Perform the following queries on the ArrayList of Student objects and show the results on the listViewStudents (Hint: add buttons as needed):a) Use lambdas and streams to sort the Student objects by name, then show the results.b) Use lambdas and streams to map each Student to its name and grade, sort the results by grade (descending), then display the results.c) Use lambdas and streams to map each Student to its name and grade, to select the Students who have grade values in the range 80 to 90. Sort the results by grade value(descending), then show the results.d) Use lambdas and streams to calculate the total average of all Students…arrow_forwardStudy the Table class and write a JUnit test class TableTest.java to test the Table class asfollows. Submit the test class and screen captures showing pass of all the tests. Either JUnit4or JUnit 5 in any IDE may be used. a. Create a table and put 10 entries of your choice (e.g., testTable.put(1, “testA”)). Below is the code for pbulic class Table : public class Table{private int manyItems;private Object[] keys;private Object[] data;private boolean[] hasBeenUsed;public Table(int capacity){if (capacity <= 0)throw new IllegalArgumentException("Capacity is negative");keys=new Object[capacity];data=new Object[capacity];hasBeenUsed=new boolean[capacity];}public boolean containsKey(Object key){return findIndex(key)!=-1;}public int findIndex(Object key){int count=0;int i=hash(key);while (count <= data.length && hasBeenUsed[i]){if (key.equals(keys[i]))return i;count++;i=nextIndex(i);}return -1;}public Object get(Object key){int index=findIndex(key);if (index==-1)return…arrow_forwardStudy the Table class and write a JUnit test class TableTest.java to test the Table class as follows. Submit the test class and screen captures showing pass of all the tests. Either JUnit4 or JUnit 5 in any IDE may be used. >>Table class code is in previous question a. Test findIndex() for an non-existing entry.b. Test findIndex() for an existing entry.c. Test put() for an non-existing entry.d. Test put() for an existing entrye. Test put() for a new entry putting into the full table.arrow_forward
- Complete the method insertInMiddle.arrow_forward- a computer store management application with different jframes for customers and orders etc., using Swing library of Java programming language. Choose one of the applications above. Project logic is completely up to you. However, your application is supposed to include at least 3 different windows, in other words, 3 JFrames and you should create connections between those frames according to the logic of your application. Those JFrames can be accompanied by normal (model) java classes as well. In your application, file writing and file reading methods should be utilized. When submitting your project, you are required to have following parts in your paper; • A general description of the application. • Brief explanation of the logic of using different components in the application. • Screenshots of all possible windows. • Source codes (Showing each class separately).arrow_forwardRules: Corner cases. By convention, the row and column indices are integers between 0 and n − 1, where (0, 0) is the upper-left site. Throw an IllegalArgumentException if any argument to open(), isOpen(), or isFull() is outside its prescribed range. Throw an IllegalArgumentException in the constructor if n ≤ 0. Unit testing. Your main() method must call each public constructor and method directly and help verify that they work as prescribed (e.g., by printing results to standard output). Performance requirements. The constructor must take Θ(n^2) time; all instance methods must take Θ(1)Θ(1) time plus Θ(1)Θ(1) calls to union() and find().arrow_forward
- One use of a hash table is to implement a set data type. You will implement the method resize, and the MySetIterator inner class in the class MySet. MySet uses a separate chaining hash table to implement a set of integers. To get started, import the starter file, MySet.java into the hashset package you create in a new Java Project. Please do not change any of the method signatures in either class. Implement the methods described below. You are free to test your code however you prefer. private void resize()This method "doubles" the table size and reinserts the values stored in the current table. The table size should remain prime. And below is method signature class: public class MySet { // implements a set using a separate chaining hash table private class Node { private Integer element; private Node next; private Node(Integer e, Node n) { element = e; next = n; } } private Node table[]; //an array of linked list…arrow_forwardConsider the program below. Replace the tags _??1_ and _??2_ respectively, by filling in the text fields below, such that testAdd() is a valid JUnit test which tests the correctness of built-in addition and passes:arrow_forwardQUESTION 12 Write a method called CompareAndChangeList to be included in an application class called ListApplication that accepts two parameters list1 and list2 of type SingleLinkedList of integer values, and a third parameter Item of type int. If list1 and list2 are of different sizes, the method returns false, otherwise, the method replaces any element in list2 with a value equal to the last element in list1, if the summation of the element in list 1 and the corresponding element in list2 is equal to item. Assume list1 and list2 are not empty. If at least one replacement happened, the method returns true, otherwise, it returns false. Note: Write this method by calling methods of the class SingleLinkedList. Method head public static boolean CompareAndChangeList (SingleLinkedList list1, SingleLinkedList list2, int item) Example: Before Method call: item = 35 list1: 23 26 30 20 17 list2: 10 9. 25 15 4. After Method call: list1: 23 26 30 20 17 list2: 10 17 25 17 4 In this case, the…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education