Q2) Given the following function int f (int x, int y, int z){ int p = z, a =0; while (xl=0){ if (x >y){ a+=x--; if (x==y){ p*=a+x; x=0;} else{ p*=y; if (x>0) х-; else х++; } return p; A) What does the function calculate ? B) Assume looping is not supported. Rewrite the function using recursion.

Q2) Given the following function int f (int x, int y, int z){ int p = z, a =0; while (xl=0){ if (x >y){ a+=x--; if (x==y){ p=a+x; x=0;} else{ p=y; if (x>0) х-; else х++; } return p; A) What does the function calculate ? B) Assume looping is not supported. Rewrite the function using recursion.

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

3. (a) A PHP function is defined as follows: function planets ($arr) { if ($arr [1]) { print "Mercury"; } else { for ($i=0; $i <= $arr [2]; $i++) {print $arr [3] [$i]; } } print count ($arr); } Recall that array $arr can be defined using a statement of the form: $arr = array (...); (i) Give an array $arr such that planets ($arr) prints Mercury For this case, what is the output of the instruction print count ($arr); Give an array $arr such that planets ($arr) prints Venus (ii)
Given the following functions:void sum(int a, int b, int total) { total = a+b;}int main() { int x=1, y=2, s=0; sum(x,y,s); cout << s << "\n"; return 0;}1. Explain the problem with the sum function.2. Explain how to fix the problem without changing the main function.
Part (a) Write a python function that computes the binomial coefficient ("). The function should return the correct answer for any positive integer n and k where k=m pass Part (c) Suppose that the number of people in the trial is 100. Then: • Plot a curve that shows how the probability of type 1 error changes with the choice of m, for m = 1,...n assuming that the null hypothesis holds (in red), • On the same picture, plot the probability of type 2 error vs the value of m in the case in which the new drug is effective with proability 0.68 (in blue). You can plot the two curves using matplotlib.pyplot. You can select the color by passing color='r' or color='b' to the plt.plot() function. [4]: n - 100 # your code here def plot_curve (): pass [5]: plot_curve() Part (d) Based on the picture above, what value of m do you think would be suitable to keep both type 1 and type 2 error small at the same time? (You may assume that the company claims the new drug has 68% accuracy) [6]: # your…
Python program (recursive function) A recursive function is a function defined in terms of itself via self-referential expressions. This means that the function will continue to call itself and repeat its behavior until some condition is met to return a result. Write a python recursive functionprod that takes x as an argument, and returns the result where, result=1*1/2*1/3*….*1/n Include a screenshot that shows a python program that uses the above function and prints the rounded result to three decimal placesafter prompting the user to enter a number, x. Use x=3. N.B: The code should be included please.
Consider the function definition below. Assume x = 5, y = 3 and j = 8 as the function starts. Which variables will change after the function finishes? void findout (int &x, int y, int &j) { for (int i = 1; i 5) { x = 2*x - 3*y; y = 4 + 3 x; } else { Oi y = 2*x - 3; x = 4 + 3% y; } } // end of for loop x and y y All three since the first and last are references. x and j
Midterm Practice Problems 1. Use recursion to write a function count_ones that returns how many Is there are in a number n when represented in decimal (base 10). For example, 1231 has two 1s. You can assume that n is nonnegative and at most 9 digits long. Do not use global (or static) variables. In main perform at least three tests of count_ones and use assert to check that the returned value is correct. Your function should have the following prototype: // count_ones (n) returns the number of is in the decimal representation of n // requires: 0 <= n < 10^9 int count_ones (int n);
4. You are given the following functions: int functionA(int a) { printf ("a-sd\n", a); if (a==1) return 1; else return functionB (a-1) *2; int functionB (int b) { printf ("b=3d\n",b); if (b--1) return 1; else return functionA (b-1) *3; Write the main function. Your main function should prompt the user for input and then call the mutual recursion by passing in the user's input. The guidelines are described below. int main () { //declare int a to receive user input and int result to receive result of mutual recursion //using a while loop, prompt user for input. The number entered //must be bigger than 1, otherwise repeat user input with an error //message. //call functionA () with int a as input argument. Receive the result in int result. //print result return 0;
3. You are expected to write a recursive function called powy(base, exponent) that, when called, returns baseponent As an example, powy( 6, 5 ) =6*6*6*6*6. Assume that exponent is an integer greater than or equal to 1. Hint: The recursion step would use the relationship baseponent - base baseponent - 1 and the terminating condition occurs when exponent is equal to 1, because base' = base
2. Modular arithmetic Write a function that returns the result of any integer modulo of n (i.e., reduce theinteger modulo n). Note that the C++ operator % can be used, but it returns a negativevalue, for example, -1 % 3 yields -1, so we need to do something adjustment (recallthat -1 mod 3 = 2 because -1= (-1)×3+2). Therefore, we will use the mod() functionfrom this step to implement the later encode() and decode() functions. /* precondition: n is greater than 1,a can be negativepostcondition: return a mod n (as defined in class)a mod n = r if and only if a = nk+r, 0 =< r < n (note thatr needs to be non-negative).*/int mod (int a, int n); -Please write in c++
38. The geometric mean g of n numbers x; is defined as the nth root of the product of x;: g=Vx1x2X3•…Xn (This is useful, for example, in finding the average rate of return for an investment which is something you'd do in engineering economics). If an investment returns 15% the first year, 50% the second, and 30% the third year, the average rate of return would be (1.15*1.50*1.30)") Compute this.
Write a recursive function that takes as a parameter a nonnegative integer and generates the following pattern of stars. If the nonnegative integer is 4, the pattern generated is as follows: **** *** ** * * ** *** **** Also, write a program that prompts the user to enter the number of lines in the pattern and uses the recursive function to generate the pattern. For example, specifying 4 as the number of lines generates the preceding pattern.