Bissoy.com
Doctors Medicines MCQs Q&A

Consider the C program fragment below which is meant to divide x by y using repeated subtraction. The variables x, y, q and r are all unsigned int. While (r >= y) { r = r – y; q = q + 1; } Which of the following conditions on the variables x, y, q and r before the execution of the fragment will ensure that the loop terminates in a state satisfying the condition x == (y*q + r)?

Consider the C program fragment below which is meant to divide x by y using repeated subtraction. The variables x, y, q and r are all unsigned int. While (r >= y) { r = r – y; q = q + 1; } Which of the following conditions on the variables x, y, q and r before the execution of the fragment will ensure that the loop terminates in a state satisfying the condition x == (y*q + r)? Correct Answer (q == 0) && (r == x) && (y > 0)

Given condition is x == (y*q + r)

Here, x= result, y= multiplicand, q= quotient, r= remainder

As, the number is divided using repeated subtraction, So quotient must be 0 in that case.

When in above condition q= 0

Then, x = r.

It matches with option 3.

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( ); } }
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 three software items: Program-X, Control Flow Diagram of Program-Y and Control Flow Diagram of Program-Z as shown below Program-X: Control Flow Diagram of Program-Y sumcal (int maxint, int value) {       int result=0, i=0;       if (value <0)       {           Value = -value;       }       while ( (i
Consider the following pseudo-code fragment, where a and b are integer variables that have been initialized: /* Pre-conditions : (a > 1 ∧ a < b) */ /* Assume that overflow never occurs */ int x = 0; int p = 1; while (p < b) { p = p * a; x = x + 1; } When the while loop terminates, what will be the value of x in terms of a and b ?
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 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
Comment on the following 2 C programs.
#include  //Program 1int main(){ int a; int b; int c;}#include  //Program 2int main(){ int a; { int b; } { int c; }}
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;
}
Which of the following is an external variable in the following C code?
#include int func (int a){ int b; return b;}int main(){ int c; func (c);}int d;
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}