Data Structures and Algorithms in Java
6th Edition
ISBN: 9781118771334
Author: Michael T. Goodrich
Publisher: WILEY
expand_more
expand_more
format_list_bulleted
Concept explainers
Expert Solution & Answer
Chapter 2, Problem 7R
Explanation of Solution
Number of calls to nextValue() method:
It is given that the increment value is 128 on an assumption in ArithmeticProgression class.
- Since, it is known fact that the long-value does not exceed
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
You are in the process of choosing between two 3rd party libraries that implement some algorithm and have found two solutions, A and B, that are advertised as O(n) and ~n, respectively. Which of these solutions would you prefer in terms of performance? Explain. (Hint: think about which one gives a more "stable" result.)
Make a recursive method for factoring an integer n. First, find a factor f, then recursively factor n / f. This assignment needs a resource class and a driver class; these two classes will need to be in two separate files. The resource class will contain all of the methods and the driver class only needs to call the methods. The driver class needs to have only 5 lines of code. The code needs to be written in Java.
Question)
Your program throws StackOverflowError. What does that indicate?
Your program most likely contains an endless recursion.
You need to change Java startup options to increase the stack size.
You need to upgrade the Java version to allow for more nested method calls.
You need to use an iterative algorithm, if there is one, instead of the recursive one.
Chapter 2 Solutions
Data Structures and Algorithms in Java
Ch. 2 - Give three examples of life-critical software...Ch. 2 - Give an example of a software application in which...Ch. 2 - Prob. 3RCh. 2 - Prob. 4RCh. 2 - Prob. 5RCh. 2 - Give a short fragment of Java code that uses the...Ch. 2 - Prob. 7RCh. 2 - Prob. 8RCh. 2 - Prob. 9RCh. 2 - Prob. 10R
Ch. 2 - Prob. 11RCh. 2 - Draw a class inheritance diagram for the following...Ch. 2 - Prob. 13RCh. 2 - Prob. 14RCh. 2 - If the parameter to the makePayment method of the...Ch. 2 - Prob. 16CCh. 2 - Most modern Java compilers have optimizers that...Ch. 2 - The PredatoryCreditCard class provides a...Ch. 2 - Modify the PredatoryCreditCard class so that a...Ch. 2 - Prob. 20CCh. 2 - Write a program that consists of three classes, A,...Ch. 2 - Prob. 22CCh. 2 - Prob. 23CCh. 2 - Write a Java class that extends the Progression...Ch. 2 - Redesign the Progression class to be abstract and...Ch. 2 - Use a solution to Exercise C-2.25 to create a new...Ch. 2 - Use a solution to Exercise C-2.25 to reimplement...Ch. 2 - Write a set of Java classes that can simulate an...Ch. 2 - Write a Java program that inputs a polynomial in...Ch. 2 - Write a Java program that inputs a document and...Ch. 2 - Prob. 31PCh. 2 - Write a Java program that simulates a system that...Ch. 2 - Define a Polygon interface that has methods area()...Ch. 2 - Prob. 35PCh. 2 - Write a Java program that can make change. Your...
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- I have to write a recursion method that finds the square root of a number by creating more accurate guesses each time. For some reason, my code is not returning any value and is not terminating at my base case. Can you help me see the issue I am having? import java.util.Scanner; /** * Greek's method to approximate the square root of a given number. */ public class SquareRootComputer { publicstaticvoidmain(String[] args) { // this is your tester // read a value from the user and print the results // along with expected value Scannerin=newScanner(System.in); System.out.println("Please input a value whose square root you would like determined: "); doublex=in.nextDouble(); //makes user input the value for x to determine it's square root. USE 91. System.out.println("The square root of "+x+"is: "+squareRoot(x)); System.out.println("Expected square root value of 91 is: 9.539392014."); in.close(); //closes the scanner to prevent any unintended errors. }…arrow_forwardusing Java languagearrow_forwardCreate a Java class RecursiveMethods.java and create the following methods inside: ALL THE METHODS NEED TO BE COMPLETED RECURSIVLY. NO LOOPS ALLOWED. - oddEvenMatchRec: the method takes an integer array as a parameter and returns a boolean. The method returns true if every odd index contains an odd integer AND every even index contains an even integer(0 is even). Otherwise it returns false. - sumNRec: The method takes an integer array A and returns the sum of all integers in the parameter array. - nDownToOne: Takes an integer n and prints out the numbers from n down to 1, each number on its own line. - inputAndPrintReverse: Inputs integers from the user until the user enters 0, then prints the integers in reverse order. For this method, you may NOT use an array or any type of array structure, in other words, you may not use any structure to store the user input.arrow_forward
- Use java and correctly indent code.arrow_forwardNeed help Testh bench code in Verilogmodule Examen1#(parameter P = 4)( input [P:0] e_a, input [P:0] e_b, output reg [P+1:0] vs_a); always @* begin if (e_a[P] == e_b[P]) begin vs_a[P:0] = e_a[P-1:0] + e_b[P-1:0]; vs_a[P+1] = e_a[P]; end else begin if (e_a[P-1:0] > e_b[P-1:0]) begin vs_a[P:0] = e_a[P-1:0] - e_b[P-1:0]; vs_a[P+1] = e_a[P]; end else begin vs_a[P:0] = e_b[P-1:0] - vs_a[P-1:0]; vs_a[P+1] = e_b[P]; end end end endmodule THIS IS THE TEST BENCH module Examen1_TB; #(parameter P=4); reg [P:0] in_a;reg [P:0] in_b;wire [P+1:0] in_s; Examen1_Ins…arrow_forwardI'm having trouble fixing this error in my Mathematica 12.0 code, I'm trying to make a dynamic clock but whatever I do to implement the hour minute and second hands it keeps giving me this error, any help is greatly appriciated.arrow_forward
- Modify the program below to implement exclusive-or (XOR) in Python. AsPython does not natively implement XOR, you will need to implement this by creating an expression using a combination of and, or, and not. Determine what this expression is, and put it in the code below (where “fill in your code here” is written).The starter code below includes the True/True and True/False cases. You should also include the False/True and False/False cases. As a reminder, XOR is only True if exactly one of the inputs is True. Other ways ofthinking about this is that it is True only if one input or the other input is True, but not both. Yet another way of thinking about this is that the result is only True when the inputs are different from each other. SAMPLE STARTER CODE:a = Trueb = Trueresult = # fill in your code hereprint("True XOR True is " + str(result))a = Trueb = Falseresult = # fill in your code hereprint("True XOR False is " + str(result))# Continue for the False/True and False/False…arrow_forwardI already asked this question once, but I receivied it in C++ form and not Java. I do my Java programming in Apache NetBeans IDE 12.2. The question is below, but please let it be Java coding: Create a two-dimensional array of type double to contain the three different SD Marks (JD521, PRG521, and IP521) for six different students. A single array of type String must be used to store the student names (Maxwell, Carl, Gerhard, Paul, James, and Cena). Allow a user to enter in a number, ranging from 1 to 6, which will represent the student position in the table MCSD max and present the marks for each respecting module. The program can only stop when the user enter a number greater than 6. Printout the student name including the JD521, PRG521, and IP521 max, the total of marks and the average of all marks. Use a condition statement to decide that the student has passed or not (Pass rate is 70). Thank you.arrow_forwardThis is JAVA Programmingarrow_forward
- Implement the Plates class buildMap function so that it populates the HashMap with the state abbreviations as keys and the counts of how many each appear in the file as values. Sometimes, the parking attendant will add special notation to help her remember something about a specific entry. There are just non alphabetic characters that she adds to the state - your program should ignore these characters so that an entry like NY* still counts toward the NY plate count. She is also very inconsistent with how she enters the plates. Sometimes she uses upper case, sometimes lowercase, and sometimes she even uses a mix. Be sure to account for this in your program. Only add information for plates in New England (Maine, New Hampshire, Vermont, Massachusetts, Rhode Island, and Connecticut). Plates.java import java.util.Arrays; import java.util.HashMap; import java.util.HashSet; import java.util.Map; import java.util.Set; public class Plates { private Map<String, Integer> plateMap;…arrow_forwardFor JAVA.arrow_forwardUse the recursive method binarySearch given below and an array a given as an image below, to complete the following question: Suppose I make a method call: binarySearch(a, 51, 0, a.length - 1);. How many recursive binarySearch calls are made before returning? Note: Don't include the first method call: binarySearch(a, 51, 0, a.length - 1); as part of your count. Method: public int binarySearch(int[] n, int key, int lo, int hi) { if (lohi) { return -1; } int mid= lo + (hi - lo) / 2; if (keya[mid]) { } else if (key > a[mid]) { } } else { } a (array): return binarySearch(a, key, lo, mid - 1); 6 0 return binarySearch(a, key, mid + 1, hi); return mid; 13 1 Type your answer... 14 2 5 3 3 25 33 4 43 5 51 6 53 64 72 7 8 9 84 34 10 9 93 11 95 96 97 12 13 14arrow_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