Examine the following algorithm and show the output values displayed when find(4) is executed. Show your work to justify the answer, especially the recursive steps. Algorithm find(n) { if (n == 0 orn == 1) { return n else { sum = find(n - 1) + 2*find(n - 2) print sum // output the sum value return sum }

Examine the following algorithm and show the output values displayed when find(4) is executed. Show your work to justify the answer, especially the recursive steps. Algorithm find(n) { if (n == 0 orn == 1) { return n else { sum = find(n - 1) + 2*find(n - 2) print sum // output the sum value return sum }

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

ALGORITHM Y (n) // Input: n is a positive integer if n = 1 return 1 else return Y (n − 1) + n ∗ n 1. What does this algorithm compute? 2. Can the algorithm be optimised to give the same output?
sum = 0 for j in range(1,12): sum = sum + (9*j + 3) print(sum) What is printed as a result of executing this algorithm?
int BinDig (int n){ if (n == 1) return 1;else return (1 + BinDig(n/2)); } Find T(n) = number of arithmetic operations. Calculate the complexity of this algorithm.
4. Consider the following recursive algorithm. ALGORITHM Q(n) //Input: A positive integer n if n = 1 return 1 else return Q(n – 1) + 2 * n – 1 a. Set up a recurrence relation for this function's values and solve it to deter- mine what this algorithm computes. b. Set up a recurrence relation for the number of multiplications made by this algorithm and solve it. c. Set up a recurrence relation for the number of additions/subtractions made by this algorithm and solve it.
In this problem, you will write different programs to x^N, where x ∈ R, n ∈ N. b) Devise a recursive algorithm to compute x^n , using the fact that x^n= x ⋅ x^n−1 .
int fun1(int n) Algorithm 3 Analyze the following Algorithms. Find their running time and asymptotic { if (n <= 1) return n; return 2*fun1(n-1); notations.
The following code is used to derive Fibonacci algorithm with this sequence: (0, 1, 1, 2, 3, 5, 8, 13, 21, …) where each number is “add” of two previous ones. int fib(int n){ if (n==0) return 0; else if (n == 1) return 1; else return fib(n−1) + fib(n−2); } Explain why the following RISC-V assembly code works, you need to explain all the details using the comments as hints? # IMPORTANT! Stack pointer must remain a multiple of 16!!!! addi x10,x10,8 # fib(8), you can change it fib: beq x10, x0, done # If n==0, return 0 addi x5, x0, 1 beq x10, x5, done # If n==1, return 1 addi x2, x2, -16 # Allocate 2 words of stack space sd x1, 0(x2) # Save the return address sd x10, 8(x2) # Save the current n addi x10, x10, -1 # x10 = n-1 jal x1, fib # fib(n-1) ld x5, 8(x2) # Load old n from the stack sd x10, 8(x2) # Push fib(n-1) onto the stack addi x10, x5, -2 # x10 = n-2 jal x1, fib # Call fib(n-2)…
Trace the following code and write the output and mention what the code does int algorithm(int arr[], int I, int r, int x) { if (r >= 1) { int mid = |+ (r - I) / 2 if (arr[mid] == x) return mid if (arr[mid] > x) return algorithm(arr, I, mid - 1, x) return algorithm(arr, mid + 1, r, x) } return -1 } int main(void) { int arr[] = { 2, 3, 4, 10, 40, 7, 9, 11} int n = sizeof(arr) / sizeof(arr[0]) int x = 11 int output = algorithm(arr, 0, n - 2, x) (output == -1) ? printf(" 11 is not found in the list") : printf("11 is found at index %d", output) return 0
Write a recursive algorithm with the following prototype: int add (int x, int y); that returns x if y is 0; and adds x to y otherwise. THE FUNCTION MUST BE RECURSIVE. (hint: the base case should involve a test for y being 0; recursive case should reduce y towards 0)
Examine the following algorithm and show the output values displayed when find(4) is executed. Show your work to justify the answer, especially the recursive steps. 1. Algorithm find (n) { if (n == 0 or n == 1) { return n } else { sum = find (n - 1) + 2*find (n print sum 2) // output the sum value - return sum } }
Course : Algorithm Use the backtracking algorithm for the sum-of-subsets problem( Algorithm 5.4) to find all combinations of the following numbers that sum to W=52: W1=2 W2=10 W3=13 W4=17 W5=22 W6=42 Show the actions step by step Note: Please do your own. Plz do not copy from chegg and post here.
Use the recursion to solve the following problems using Java Programming Language 1. Calculate the sum of an array of n integers. 2. Compute Powers, p(x,n)=xn 3. Revers an array of n integers 4. Calculate the length of string (number of characters) 5. Implement the tail recursion for problems 1 and 2. Please test the program by using 2 different input sets!