Bissoy.com
Doctors Medicines MCQs Q&A

Consider the following recursive function fun (s , y). what is the value of fun ( 4, 3) int fun ( int x , int y) if ( x =0) return y; return fun ( x,1, x+y); |

Consider the following recursive function fun (s , y). what is the value of fun ( 4, 3) int fun ( int x , int y) if ( x =0) return y; return fun ( x,1, x+y); | Correct Answer 13

The function fun() calculates and returns ((1 + 2 … + x - 1 + x) + y) which is x(x + 1)/2 + y. After Completing X = 4 y = 3 Output 1st Pass 3 7 No 2nd Pass 2 10 No 3rd Pass 1 12 No 4th Pass 0 13 No 5th pass The (x = = 0) evaluates and gives output y = 13 13

Related Questions

What is the output of following program? abstract class Sum { public abstract int sumOfTwo(int n1, int n2); public abstract int sumOfThree(int n1, int n2, int n3); public void disp( ){ System.out.println("Method of class Sum"); } } class DemoAbstract1 extends Sum { public int sumOfTwo(int num1, int num2) { return num1+num2; } public int sumOfThree(int num1, int num2, int num3) { return num1+num2+num3; } public static void main(String args[ ]){ Sum obj = new DemoAbstract1( ); System.out.println(obj.sumOfTwo(3, 7)); System.out.println(obj.sumOfThree(4, 3, 19)); obj.disp( ); } }
Let x̅1 and x̅2 (where x̅2 > x̅1) be the means of two sets comprising n1 and n2 (where n2 < n1) observations respectively. If x̅ is the mean when they are pooled, then which one of the following is correct?
Consider the following recursive C function that takes two arguments unsigned int rer (unsigned int n, unsigned int r) { if (n > 0) return (n%r + rer (n/r, r)); else return 0; } What is the return value of the function rer when it is called as rer (513, 2)?
Consider the following C code. Assume that unsigned long int type length is 64 bits. unsigned long int fun (unsigned long int n) { unsigned long int i, j = 0, sum = 0 ; for (i = n; i > 1 ; i = i/2) j++ ; for ( ; j > 1 ; j = j/2) sum++ ; return (sum) ; } The value returned when we call fun with the input 240 is
Consider the following C function in which size is the number of elements in the array E: int MyX(int *E, unsigned int size) {       int Y = 0;       int Z;       int i, j, k;       for(i = 0; i < size; i++) Y = Y + E[i];       for(i = 0; i < size; i++) for(j = i; j < size; j++) {       Z = 0;       for(k = i; k <= j; k++) Z = Z + E[k];       if (Z > Y) Y = Z; }       return Y; } The value returned by the function MyX is the
What is the output of this program ? #include
using namespace std;
int n(char, int);
int (*p) (char, int) = n;
int main()
{
(*p)('d', 9);
p(10, 9);
return 0;
}
int n(char c, int i)
{
cout << c << i;
return 0;
}
What will be the final values of i and j in the following C code?
#include int x = 0;int f(){ if (x == 0) return x + 1; else return x - 1;}int g(){ return x++;}int main(){ int i = (f() + g()) | g(); //bitwise or int j = g() | (f() + g()); //bitwise or}
What will be the final values of i and j in the following C code?
#include int x = 0;int f(){ if (x == 0) return x + 1; else return x - 1;}int g(){ return x++;}int main(){ int i = (f() + g()) || g(); int j = g() || (f() + g());}
Consider the following C code segment int f (int x) { if (x<1) return 1; else return ( f{x-1) + g(x) ); } int g (int x) {  if (x< 2) return 2; else return ( f(x-1) + g(x/2)); } Of the following, which best describes the growth of f(x) as a function of x ?
Consider the C function given below. Assume that the array listA contains n (> 0) elements, sorted in ascending order int ProcessArray(int *listA, int x, int n) { int i, j, k; i = 0; j = n-1; do {                k = (i+j)/2;                if (x <= listA[k])                 j = k-1;                 if (listA[k] <= x)                 i = k+1;        } while (i <= j); if (listA[k] == x)                 return(k); else                 return -1; } Which one of the following statements about the function ProcessArray is CORRECT?