Consider the following recursive C function. Void get (int n) { if (n<1) return; get (n-1) ; get (n-3) ; printf (‘’%d’’, n); } If get (6) function is being called in main() then how many times will the get ( ) function be invoked before returning to the main() ?

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( ); } }

A

10

26

Method of class Sum

B

26

10

Method of class Sum

C

Method of class Sum

26

10

D

Error

Consider the following two functions. void fun1 (int n) { if (n == 0) return; printf(“%d”, n); fun2(n – 2); printf (“%d”, n); } void fun2(int n) { if (n == 0) return; printf (“%d”, n); fun1(++n); printf(“%d”, n); } The output printed when fun1 (5) is called is

A

53423122233445

B

53423120112233

C

53423122132435

D

53423120213243

Which two classes use the Shape class correctly?

A. public class Circle implements Shape { private int radius; }B. public abstract class Circle extends Shape { private int radius; }C. public class Circle extends Shape { private int radius; public void draw(); }D. public abstract class Circle implements Shape { private int radius; public void draw(); }E. public class Circle extends Shape { private int radius; public void draw() { /* code here */ } }F. public abstract class Circle implements Shape { private int radius; public void draw() { /* code here */ } }

A

B,E

B

A,C

C

C,E

D

T,H

What is correct about Panchayat election? i. There is one district election officer. ii. There are one or more returning officers. iii. State election commission appoints returning officer. iv. With the consent of commission District Election Officer can appoint returning officer. v. Naib Tahsildar may be returning officer for Janpad Panchayat. vi. Naib Tahsildar may be returning officer for Gram Panchayat. vii. Naib Tahsildar may be returning officer for Zilla Panchayat. viii. District election officer himself only returning officer.

A

i, ii, iii, iv, v, vi

B

ii, iii, iv, v, vi, vii

C

iii, iv, v, vi, vii, viii

D

i, iii, iv, v, vii, viii

E

None of the above

What will happens if the statement free(a) is removed in the following C code?

#include#includemain(){ int *a; a=(int*)malloc(sizeof(int)); *a=100; printf("*a%d",*a); free(a); a=(int*)malloc(sizeof(int)); *a=200; printf("a%p",a); *a=200; printf("a%d",*a);}

A

Error

B

Memory leak

C

Dangling pointer arises

D

200 is printed as output

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;
}

A

d99

B

d9d9

C

d9

D

compile time error

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}

A

i value is 1 and j value is 1

B

i value is 0 and j value is 0

C

i value is 1 and j value is undefined

D

i and j value are undefined

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());}

A

i value is 1 and j value is 1

B

i value is 0 and j value is 0

C

i value is 1 and j value is undefined

D

i and j value are undefined

What will be the output of the following C program? void count (int n) { static int d=1; printf("%d ", n); printf("%d ", d); d++; if(n>1) count (n-1); printf("%d ", d); } void main() { count(3); }

A

3 1 2 2 1 3 4 4 4

B

3 1 2 1 1 1 2 2 2

C

3 1 2 2 1 3 4

D

3 1 2 1 1 1 2

Simplify the value of $$\frac{{{\text{0}}{\text{.9}} \times {\text{0}}{\text{.9}} \times {\text{0}}{\text{.9 + 0}}{\text{.2}} \times {\text{0}}{\text{.2}} \times {\text{0}}{\text{.2 + 0}}{\text{.3}} \times {\text{0}}{\text{.3}} \times {\text{0}}{\text{.3}} - {\text{3}} \times 0.9 \times {\text{0}}{\text{.2}} \times {\text{0}}{\text{.3}}}}{{{\text{0}}{\text{.9}} \times {\text{0}}{\text{.9 + 0}}{\text{.2}} \times {\text{0}}{\text{.2 + 0}}{\text{.3}} \times {\text{0}}{\text{.3}} - 0.9 \times {\text{0}}{\text{.2}} - {\text{0}}{\text{.2}} \times {\text{0}}{\text{.3}} - 0.3 \times 0.9}} = ?$$

A

1.4

B

0.054

C

0.8

D

1.0

Consider the following recursive C function. Void get (int n) { if (n<1) return; get (n-1) ; get (n-3) ; printf (‘’%d’’, n); } If get (6) function is being called in main() then how many times will the get ( ) function be invoked before returning to the main() ?

Related Questions