Question

Write a recursive method that computes the value of x^n

Answer #1

public static double power(double x, int n) { if (n == 0) { return 1; } else { return x * power(x, n-1); } }public static void main(String[] args) { Scanner in = new Scanner(System.in); System.out.print("Enter a value for x: "); double x = in.nextDouble(); System.out.print("Enter a value for n: "); int n = in.nextInt(); System.out.println(x + "^" + n + " = " + power(x, n)); } }

Write a recursive method that computes the value of xn.

Write a method
public double square(double x)
that computes the square of the parameter x.

In JAVA
Write a RECURSIVE method that receives as a parameter an integer
named n. The method will output n # of lines of stars. For example,
the first line will have one star, the second line will have two
stars, and so on.
The line number n will have "n" number of ****** (stars)
so if n is 3 it would print
*
**
***
The method must not have any loops!

Write Java program Lab42.java which takes as input two positive
integers m and n and computes their least common multiple
by calling method lcm(m,n), which in turn calls recursive method
gcd(m,n) computing the greatest common divisor of m and n.
Recall, that lcm(m,n) can be defined as quotient of m * n and
gcd(m,n).

Write a recursive method body for the
method whose contract is given below. Note that n is a
restores-mode parameter. As an example, if n = 314, the
method should return 1. You can only use the NaturalNumber kernel
methods multiplyBy10, divideBy10, and isZero.
/**
* Reports the minimum (i.e., smallest) digit of n when it is
* written in ordinary decimal notation.
* ...
* @ensures
* minDigit = [the minimum digit of n]
*/
private static
int minDigit(NaturalNumber...

Write a recursive method repeatNTimes(String s, int n) that
accepts a String and an integer as two parameters and returns a
string that is concatenated together n times. (For example,
repeatNTimes ("hello", 3) returns "hellohellohello") Write a driver
program that calls this method from the Main program.
Program should ask for input and be stored in the string and
should return n amount of times.

Write recursive method to return true if a given array of
integers, named numbers, with n occupied positions is sorted in
ascending (increasing) order, or returns false otherwise. Array can
be empty or not.
//PRECONDITION: Varible n denotes the number of occupied
positions in the array and must be non-negative.
Employee class has method getSalary() that returns employee's
salary.
// An empty array and an array with single element in it, are
sorted. Method isSortedRec must be recursive and
returns...

Write a recursive method public static int
sumEveryOther(int n) that takes a positive int as an
argument and returns the sum of every other int from n down to
1.
For example, the call sumEveryOther(10) should return 30, since
10 + 8 + 6 + 4 + 2 = 30.
The call sumEveryOther(9) should return 25 since 9 + 7 + 5 + 3 +
1 = 25.
Your method must use recursion.

2. Write a recursive method that returns the number of digits
that are in a positive integer.

Write a recursive method that performs binary search on an
array Arr and searches for a key k.
Apply the recursive method to the
following array: 13 | 20 | 22 | 26 | 30 | 41 | 50 | 60
While the key you are search for is
50.
Show the stack trace.

ADVERTISEMENT

Get Answers For Free

Most questions answered within 1 hours.

ADVERTISEMENT

asked 14 minutes ago

asked 31 minutes ago

asked 41 minutes ago

asked 43 minutes ago

asked 47 minutes ago

asked 48 minutes ago

asked 52 minutes ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago