1. Determine what the following function calls return for recursive function func below. (4 pts.)...
1. Determine what the following function calls return for
recursive function func below.
(4 pts.)
public static int func(int n)
{
if(n == 1)
return 2;
else
return 2 + func(n-1);
(a) func(1) = ________
(b) func(4) = ________
2. Does func above perform top down or bottom up computation? ____________ (2 pts.)
Homework Answers
bottom-up
computation.
func(1)=2
Add Answer to:
1. Determine what the following function calls return for
recursive function func below.
(4 pts.)...
3. Determine the general result (in terms of n) of the following recursive function (4 pts.)...
3. Determine the general result (in terms of n) of the following recursive function (4 pts.) public static void func2(int n) { if(n == 1) System.out.println(“*”); else { for (int i = 1; i <= n; i++) System.out.print(“*”); System.out.println(); func2(n-1); } } 4. Does func2 above perform down or bottom up computation? ___________________ (2 pts.)
3) Consider the following recursive method, what will be the output for the following method calls?...
3) Consider the following recursive method, what will be the output for the following method calls? Explain. (25 pts.) public static void sample (int number) if (number < 0) { System.out.println( superwriteVertical (-number); System.out.println(number); superwriteVertical (number/ 10); else if (number 10) else ( System.out.print1n(number % 18); sample(-100); sample(50); sample(1024);
3. Recursive Program (6 points) Consider the following recursive function for n 1: Algorithm 1 int...
3. Recursive Program (6 points) Consider the following recursive function for n 1: Algorithm 1 int recurseFunc(int n) If n 0, return 1. If n 1, return 1 while i< n do while j <n do print("hi") j 1 end while i i 1 end while int a recurse Func(n/9); int b recurse Func (n/9) int c recurse Func (n/9) return a b c (1) Set up a runtime recurrence for the runtime T n) of this algorithm. (2) Solve...
Write a Java application that implements the recursive Binary Search alogrithm below: Write a Java application...
Write a Java application that implements the recursive Binary
Search alogrithm below:
Write a Java application that implements the recursive Binary Search alogrithm below:/** * Performs the standard binary search using two comparisons * per level. This is a driver that calls the recursive method * @return index where item is found or NOT FOUND if not found */public static <AnyType extends Comparable<? super AnyType>> int binarySearch(AnyType [] a, AnyType x) {return binarySearch(a, x, 0, a.length -1);}/** * Hidden recursive...
(20 pts) Fill in the missing code: This recursive method returns “even” if the length of...
(20 pts) Fill in the missing code: This recursive method returns “even” if the length of a give String is even, and “odd” if the length of the String is odd. public static String foo(String s) { if (s.length() ==0) return “even”; else if (s.length() = = 1) return “odd”; else //your code goes here } (40 pts) You coded the following in the file Test.java : System.out.println( foo(5)); //more code here public static int foo(int n)...
algorithms & data structures-1 answer and explain briefly . 4. For the following recursive function, findf...
algorithms & data structures-1
answer and explain briefly .
4. For the following recursive function, findf (5): int f(int n) if (n 0) return 0; else return n f(n - 1);
Below you will find a recursive function that computes a Fibonacci sequence (Links to an external...
Below you will find a recursive function that computes a Fibonacci sequence (Links to an external site.). # Python program to display the Fibonacci sequence up to n-th term using recursive functions def recur_fibo(n): """Recursive function to print Fibonacci sequence""" if n <= 1: return n else: return(recur_fibo(n-1) + recur_fibo(n-2)) # Change this value for a different result nterms = 10 # uncomment to take input from the user #nterms = int(input("How many terms? ")) # check if the number...
Let’s work together to develop a call tree for the execution of the following recursive method....
Let’s work together to develop a call tree for the execution of the following recursive method. (The method allows us to recursively generate the nth integer in the Fibonacci sequence, although you don’t need to be familiar with that sequence to understand this problem.) public static int fib(int n) { if (n == 0 || n == 1) { return 1; } else { int prev1 = fib(n - 2); int prev2 = fib(n - 1); return prev1 + prev2;...
The following recursive method factRecursive computes the factorial of positive integer n. Demonstrate that this method...
The following recursive method factRecursive computes the factorial of positive integer n. Demonstrate that this method is recursive. public static int factRecursive(int n) { int result = 0; if (n == 0) { result = 1; } else { result = n * factRecursive(n - 1); } return result; }
1. Write a recursive function that computes the sum of all numbers from 1 to n,...
1. Write a recursive function that computes the sum of all numbers from 1 to n, where n is given as parameter. Here is the method header: public static int sum (int n){...} 2. Write a recursive function that finds and returns the minimum value in an array, where the array and its size are given as parameters. Here is the method header: public static int minValue (int [] data, int size){...} 3. Write a recursive function that reverses the...
3) Consider the following recursive method, what will be the output for the following method calls? Explain. (25 pts.) public static void sample (int number) if (number < 0) { System.out.println( superwriteVertical (-number); System.out.println(number); superwriteVertical (number/ 10); else if (number 10) else ( System.out.print1n(number % 18); sample(-100); sample(50); sample(1024);
3. Recursive Program (6 points) Consider the following recursive function for n 1: Algorithm 1 int recurseFunc(int n) If n 0, return 1. If n 1, return 1 while i< n do while j <n do print("hi") j 1 end while i i 1 end while int a recurse Func(n/9); int b recurse Func (n/9) int c recurse Func (n/9) return a b c (1) Set up a runtime recurrence for the runtime T n) of this algorithm. (2) Solve...
Write a Java application that implements the recursive Binary
Search alogrithm below:
Write a Java application that implements the recursive Binary Search alogrithm below:/** * Performs the standard binary search using two comparisons * per level. This is a driver that calls the recursive method * @return index where item is found or NOT FOUND if not found */public static <AnyType extends Comparable<? super AnyType>> int binarySearch(AnyType [] a, AnyType x) {return binarySearch(a, x, 0, a.length -1);}/** * Hidden recursive...
algorithms & data structures-1
answer and explain briefly .
4. For the following recursive function, findf (5): int f(int n) if (n 0) return 0; else return n f(n - 1);
Most questions answered within 3 hours.
-
Consider the competitive environment of Starbuck's, Progressive
Insurance, a manufacturing firm with low turnover, or a...
asked 12 minutes ago -
3. Gains from trade
Consider two neighbouring island countries called Euphoria and
Contente. They each have...
asked 2 hours ago -
A business executive has the option to invest money in two
plans: Plan A guarantees that...
asked 4 hours ago -
Hello, can someone please help me answer this question?
How much heat is absorbed by a...
asked 4 hours ago -
. A marketing researcher conducted a survey of 25 shoppers
randomly selected at the local mall...
asked 4 hours ago -
Create an comprehensive response to the
following:
Antimicrobial agents work on a multitude of microbes (bacteria,...
asked 4 hours ago -
6.13 LAB: Step counter. Section 6.3.
A pedometer treats walking 2,000 steps as walking 1 mile....
asked 4 hours ago -
(14.2) A block of mass m = 10 kg riding on a frictionless
horizontal plane is...
asked 4 hours ago -
Use any search engine to search for articles about Starbucks
partnership with Tata Companies in India...
asked 4 hours ago -
Let’s say that for some reason Bank Excess Reserves suddenly
increase sharply. What effect would this...
asked 4 hours ago -
Given:
Curent Assets: $600,000
Total Assets: $2,600,000
Current Liabilities: $500,000
Total Liabilities: $1,700,000
What is the...
asked 4 hours ago -
1. What is a “Bankster”? What is insider trading? Why is it
illegal?
2. What is...
asked 4 hours ago