QUESTION 11 Fill in the code to complete the following method for computing factorial. (Choose all that apply /** Return the factorial for a specified index */ public static long factorial(int n) { if (n == 0) // Base case return 1; else return L; // Recursive call } DA. n* (n - 1 ) B. n * factorial(n - 1) OC. n OD. factorial(n - 1) * n

QUESTION 11 Fill in the code to complete the following method for computing factorial. (Choose all that apply /** Return the factorial for a specified index / public static long factorial(int n) { if (n == 0) // Base case return 1; else return L; // Recursive call } DA. n (n - 1 ) B. n * factorial(n - 1) OC. n OD. factorial(n - 1) * n

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

Which of the following statement(s) is/are correct about recursion? Group of answer choices A.indication of good use of recursion: difficulty to trace down the sequence of recursive calls B.gives cleaner code but has high cost C.never be used as substitute for a simple ‘for’ loop D.bad idea to use it to evaluate simple mathematical functions. E.All of the above
Identify the base case in this recursive function. Assume i> 0 when the function is invoked. (Line numbers are not part of the code.) 1. def add(i, j): 2. if i == 0: 3. return j 4. else: 5. return add(i - 1, j + 1) This function has no base case O line 5 line 1 line 4 O line 2 Question 6 The following recursive function is supposed to return a list that is the reverse of the list it was given. But it has a bug. What is the bug? (Line numbers are not part of the code.) MooP eok Dr
At the same time as it sends a block from the write buffer back to main memory, the processor makes a request to the cache.
8. Know how to do these, to trace functions like these and to debug functions like these: // recursive power , compute xn int exp(int x, int n){ if(n== return return *exp( ); } void main(){ int a,b; cin >>a>>b; cout>a; rev_print(a); }
Exercise 1: (Design of algorithm to find greatest common divisor) In mathematics, the greatest common divisor (gcd) of two or more integers is the largest positive integer that divides each of the integers. For example, the gcd of 8 and 12 is 4. Why? Divisors of 8 are 1, 2, 4, 8. Divisors of 12 are 1, 2, 4, 6, 12 Thus, the common divisors of 8 and 12 are 1, 2, 4. Out of these common divisors, the greatest one is 4. Therefore, the greatest common divisor (gcd) of 8 and 12 is 4. Write a programming code for a function FindGCD(m,n) that find the greatest common divisor. You can use any language of Java/C++/Python/Octave. Find GCD Algorithm: Step 1 Make an array to store common divisors of two integers m, n. Step 2 Check all the integers from 1 to minimun(m,n) whether they divide both m, n. If yes, add it to the array. Step 3 Return the maximum number in the array.
q6
2. Consider the following function: def func1(n): output = 1 for i in range (1, n) : output = i return output Rewrite the function as a recursive function.
Chapter 8 Irvine book, When I compiled this code I get the following errors ;Greatest Common Divisor Comment !Write a recursive implementation of Euclid’s algorithm for finding the greatest common divisor (GCD) of two integers. Descriptions of this algorithm are available in algebra books and on the Web. Write a test program that calls your GCD procedure five times, using the following pairs of integers: (5,20), (24,18), (11,7), (432,226), (26,13). After each procedure call, display the GCD.! INCLUDE Irvine32.incCalcGcd PROTO,int1:DWORD, int2:DWORD .dataarray SDWORD 5,20,24,18,11,7,438,226,26,13str1 BYTE "Greatest common divisor is: ",0 .codemain PROC mov ecx,LENGTHOF array / 2 mov esi,OFFSET array L1: INVOKE CalcGcd,[esi],[esi+4] mov edx,OFFSET str1 call WriteString call WriteDec call Crlf add esi,TYPE array * 2 loop L1 exitmain ENDP ;---------------------------------------------CalcGcd PROC, int1:DWORD, int2:DWORD;; Calculate the greatest common…
Write a recursive function to sort an array of integers into ascending order using the following idea: the function must place the smallest element in the first position, then sort the rest of the array by a recursive call. This is a recursive version of the selection sort. (Note: You will probably want to call an auxiliary function that finds the index of the smallest item in the array. Make sure that the sorting function itself is recursive. Any auxiliary function that you use may be either recursive or iterative.) Embed your sort function in a driver program to test it. Turn in the entire program and the output.
Write code to complete raise_to_power(). Note: This example is for practicing recursion; a non-recursive function, or using the built-in function math.pow(), would be more common.Sample output with inputs: 4 24^2 = 16 def raise_to_power(base_val, exponent_val): if exponent_val == 0: result_val = 1 else: result_val = base_val * ''' Your solution goes here ''' return result_val user_base = int(input())user_exponent = int(input()) print('{}^{} = {}'.format(user_base, user_exponent, raise_to_power(user_base, user_exponent)))
T/F 9. As loop variables and recursive solutions are also not used for iterative solutions, the recursive solution generally makes memorization more effective (use fewer stored) than the corresponding iterative solution.
•rewrite calculateSum function as a recursive function. m(i) = m(i-1) + i/(i+1), where i >=1