// The language is java Part I: Use of recursive method (4 points for students who need recursion/extracredit) Description: Code a class called RecursiveMultiply in which it will accept two integer arguments entered from user; pass these integers to a recursive method that returns the multiplication result of these two integers. The multiplication can be performed as repeated addition, for example, if two integers are 7 and 4: 8 * 4 = 4 + 4 + 4 + 4 + 4 + 4 + 4 + 4 You will write the application with GUI and recursion to display the result in a noneditable text field, based on the user’s entry from two text fields, while an OK button is pressed. You will utilize the exception handling code as you did in your Lab 4 and Lab 5 to verify if data entered in the text fields are valid (numerical and positive data only). You will make your own decision if there is any explanation that is not described in this specification. Finally, code a driver program that will test your class RecursiveMultiply. Part II: GUI and animation

// The language is java Part I: Use of recursive method (4 points for students who need recursion/extracredit) Description: Code a class called RecursiveMultiply in which it will accept two integer arguments entered from user; pass these integers to a recursive method that returns the multiplication result of these two integers. The multiplication can be performed as repeated addition, for example, if two integers are 7 and 4: 8 * 4 = 4 + 4 + 4 + 4 + 4 + 4 + 4 + 4 You will write the application with GUI and recursion to display the result in a noneditable text field, based on the user’s entry from two text fields, while an OK button is pressed. You will utilize the exception handling code as you did in your Lab 4 and Lab 5 to verify if data entered in the text fields are valid (numerical and positive data only). You will make your own decision if there is any explanation that is not described in this specification. Finally, code a driver program that will test your class RecursiveMultiply. Part II: GUI and animation

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter2: Using Data

Section: Chapter Questions

Problem 14RQ

See similar textbooks

Similar questions

Create a class named RecusiveMethod having a recursive method. The recursive method accepts an integer argument and displays all even numbers from 1 up to the number passed as an argument. For example, if 25 is passed as an argument, the method will display 2, 4, 6, 8, 10, 12, 14, ……24. Demonstrate the method.
JAVA PROGRAM ASAP ************* THE PROGRAM MUST WORK IN HYPERGRADE AND PASS ALL THE TEST CASES.**************** Chapter 16. PC #8. Sum of Numbers (page 1073) Write a method that accepts an integer argument and returns the sum of all the integers from 1 up to the number passed as an argument. For example, if 50 is passed as an argument, the method will return the sum of 1, 2, 3, 4, . . . 50. Use recursion to calculate the sum. Demonstrate the method in a program. The program should ask the user to enter a number, which is then used to display the sum. if the user enters -1, then exit the program. Test Case 1 Please enter a number to calculate the sum or -1 to exit:\n5ENTERThe sum of first 5 natural numbers is 15.\nPlease enter a number to calculate the sum or -1 to exit:\n10ENTERThe sum of first 10 natural numbers is 55.\nPlease enter a number to calculate the sum or -1 to exit:\n-1ENTER Test Case 2 Please enter a number to calculate the sum or -1 to…
PLZ help with the folllowig IN JAVA TRUE OR FALSE When a recursive call is encountered, computation is temporarily suspended; all of the information needed to continue the computation is saved and the recursive call is evaluated. 2.Can you have a static method in a nonstatic inner class?
I already have the code for the assignment below, but the code has an error in the driver class. Please help me fix it. The assignment: 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. The resource class and the driver class 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 of the resource class: import java.util.ArrayList;import java.util.List; public class U10E03R{ // Recursive function to // print factors of a number public static void factors(int n, int i) { // Checking if the number is less than N if (i <= n) { if (n % i == 0) { System.out.print(i + " "); } // Calling the function recursively // for the next number factors(n, i +…
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.
Problem No. 2 Write a Java class called ContainsInRange. This class defines a method called contains(), which takes as parameters an integer array a, an integer x, an int called start, as well as an int called end, and returns a boolean which is true if and only if x occurs in a at a position which is greater than or equal to start, and less than end. You must validate that start is less than or equal to end, and that both start and end are greater than or equal to 0, and less than or equal to a.length. Repeat the operation often. (please put also the code that the user can enter a value. Thank you)
write code in java write a static method that will take in a lone integer parameter. this function will return 1 if the number provided is odd, 0 if it is even. write a line of code that will call the function you just wrote above, passing it the contents of a variable called value and have it assigned the value returned by the function another variable called answer(both variables are already declared.)
Write a recursive method that displaysa string reversely on the console using the following header: public static void reverseDisplay(String value) For example, reverseDisplay("abcd") displays dcba. Write a test programthat prompts the user to enter a string and displays its reversal.
C# Write a recursive method called Power(base, exponent) that, when called, returns base exponent . For example, Power ( 3, 4 ) = 3 * 3 * 3 * 3. Assume that exponent is an integer greater than or equal to 1. The recursion step should use the relationship: base exponent = base * base exponent – 1 The terminating condition occurs when exponent is equal to 1 because base 1 = base Incorporate this method into an application that enables the user to enter the base and exponent. Requirements: In the Main() method, declare three arrays of long data types: baseNumbers, exponents, and results. Each array should be created to hold exactly 5 members. Using a FOR loop, populate the baseNumbers array with random integers between 1 and 50 and populate the exponents array with random integers between 1 and 10. Use a random number generator to create these random numbers. Using another FOR loop, call the Power method, passing it a member of the baseNumbers array and a member of the exponents…
The intName method in the "Problem Solving: Stepwise Refinement" section accepted arguments < 1,000. Using a recursive call, extend its range to 999,999. For example an input of 12,345 should return " twelve thousand three hundred forty five". Note that some number names may have extra spaces at the beginning or end. import java.util.Scanner; public class IntegerName { /** Turns a number into its English name. @param number a positive integer < 999,999 @return the name of the number (e.g. "two hundred seventy four") */ public static String intName(int number) { int part = number; // The part that still needs to be converted String name = ""; // The name of the number if (part >= 1000) { // Recursively call intName } if (part >= 100) { name = digitName(part / 100) + " hundred"; part = part % 100; } if (part >= 20) { name = name + " " + tensName(part); part = part % 10; } else if (part >= 10) { name = name + " " + teenName(part); part = 0; } if (part > 0) { name =…
Using JAVA Recursive Power Method Write a method called powCalthat uses recursion to raise a number to a power. The method should accept two arguments: The first argument is the exponentand the second argument is the number to be raised(example”powCal(10,2)means2^10). Assume that the exponent is anonnegative integer. Demonstrate the method in a program called Recursive (This means that you need to write a program that has at least two methods: mainand powCal. The powCal method is where you implement the requirements above and the main method is where you make a method call to demonstrate how your powCalmethod work).
Coding – Upload all java files to the LMS. The Fibonacci Sequence, Part 1. One of the most famous number sequences in mathematics, the Fibonacci sequence, has a recursive definition. Write a recursive method to calculate the nth Fibonacci number. In your main method, ask for n, and call your method to calculate it. Your method signature must be public static int fib(int n). The formula for the Fibonacci sequence is: fib(n) = fib(n – 1) + fib(n – 2). The Fibonacci Sequence, Part 2. In a new class, modify your main method code from part 1 to create an array of the first n Fibonacci numbers. You will need a loop for this, but do not change the recursive method! Your main method should ask for the value of n, and calculate all values from fib(1) to fib(n). Note: fib(1) = 1 and fib(2) = 1, but you’re using array indexes! Recursive Printing. Create a recursive method, printUp(int n) to print the following pattern for any n>0 rows: (this shows n=5) * ** ** * *** * **** * Also create a…