Bissoy.com
Doctors Medicines MCQs Q&A

Consider the following code segment: if (Y<0) {X=-X;Y=-Y;} Z = 0;  While (Y>0) {Z=Z+X;Y=-1;} Assume that X,Y and Z are integer variables, and that X and Y have been initialized. which of the following best describes what this code segment does ?  

Consider the following code segment: if (Y<0) {X=-X;Y=-Y;} Z = 0;  While (Y>0) {Z=Z+X;Y=-1;} Assume that X,Y and Z are integer variables, and that X and Y have been initialized. which of the following best describes what this code segment does ?   Correct Answer  Sets Z to be the product X*Y  

Consider, x = 2 and y = 3

CASE 1:

if (Y<0)              // 3<0  (False)        

{X=-X;Y=-Y;}

Z = 0;                      // z becomes 0

While (Y>0)            // 3> 0 (true)

{Z=Z+X;Y=-1;}          // z = 0 + 2 = 2 , y = 3 - 1 = 2

CASE 2:

(when z = 2, y =2, x = 2)

if (Y<0)                 

{X=-X;Y=-Y;}

Z = 0;       

While (Y>0)                 //2 > 0 (True)

{Z=Z+X;Y=-1;}          // z = 2 + 2 = 4, y = 2 -1 = 1

CASE 3: 

if (Y<0)

{X=-X;Y=-Y;}

Z = 0; 

While (Y>0)               // 1 >0 (True)

{Z=Z+X;Y=-1;}          // z = 4 + 2 = 6, y = 1- 1 = 0

CASE 4:

if (Y<0)

{X=-X;Y=-Y;}

Z = 0; 

While (Y>0)              // 0 > 0(False)

{Z=Z+X;Y=-1;}

Finally, z becomes 6. which is the product of x and y (i.e. 2 * 3= 6)

Related Questions

Consider the following two C code segment. Y and X are one- and two-dimensional arrays of size n and n × n respectively, where 2 ≤ n ≤ 10. Assume that in both code segments, elements of y are initialized to 0 and each element X[i] [j] of array X is initialized to i + j. Further assume that when stored in main memory all elements of x are in same main memory page frame. Code segment 1:                 //initialize elements of y to 0                 //initialize elements X[i] [j] of X to i+j                       for (i = 0; i < n; i++)                                 Y[i] += X[0] [i]; Code Segment 2:                 //initialize elements of Y to 0                 //initialize elements X[i] [j] of X to i+j                        for (i = 0; i < n; i++)                                 Y[i] += X[i] [0]; Which of the following statements is/are correct? S1: Final contents of array Y will be same in both code segments S2: Elements of array X accessed inside the for loop shown in code segment 1 are contiguous in main memory S3: Elements of array X accessed inside the for loop shown in code segment 2 are contiguous in main memory
In a genetic cross between the genotypes WWXX and wwxx, the following phenotypic distributions were observed among the F2 progeny: WX, 562; wx, 158; Wx, 38; and wX, 42. Likewise, a cross between XXYY and xxyy yielded the following results: XY, 675; xy, 175; Xy, 72; and xY, 78. Similarly, a cross between WWYY and wwyy yielded: WY, 292; wy, 88; Wy, 12; and wY, 8. In all the genotypes, capital letters denote the dominant allele. Assume that the F1 progeny were self-fertilized in all three crosses. Also, double cross-over does not occur in this species. Which of the following is correct?
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 ?
Two processes X and Y need to access a critical section. Consider the following synchronization construct used by both the processes Process ? /* other code for process ? */ while(true) { varP = true; while(varQ == true) { /* Critical Section */ varP = false; } } /* other code for process ?? */   Process ? /* other code for process ? */ while(true) { varQ = true; while(varP == true) { /* Critical Section */ varQ = false; } } /* other code for process ? */   Here, varP and varQ are shared variables and both are initialized to false. Which one of the following statements is true?
Each of a set of n processes executes the following code using two semaphores a and b initialized to 1 and 0, respectively. Assume that count is a shared variable initialized to 0 and not used in CODE SECTION P. CODE SECTION P wait (a); count=count+1 ; if (count==n) signal (b) ; signal (a) ; wait (b) ; signal (b) ; CODE SECTION Q What does the code achieve?
Segment CD is shorter than Segment MN, Segment MN is shorter than Segment TR, Segment AB is shorter than Segment CD and Segment MN is shorter than Segment PQ. Which segment is the shortest?
Suppliers(Sid: integer, sname:string, city:string, street:string) Parts(pid:integer, pname:string, color:string) Catalog(sid:integer, pid:integer, cost:real) Consider the following relational query on the above database: SELECT S.sname FROM Suppliers S  WHERE S.sid NOT IN (SELECT C.sid FROM Catalog C WHERE C.pid NOT IN (SELECT P.pid FROM Parts P WHERE P.color < > ‘blue’)) Assume that relations corresponding to the above schema are not empty. Which of the following is the correct interpretation of the above query?
Consider the following proposed solution for the critical section problem. There are n processes: P0…Pn – 1. In the code, function pmax returns an integer not smaller than any of its arguments. For all i, t[i] is initialized to zero. Code for Pi: do {                 c [i]=1; t[i] = pmax (t [0],…, t[n-1]) +1; c[i]=0;                 for every j ≠ I in {0,…,n-1} {                                 while (c[j]);                                 while (t[j] != 0 && t[j]<=t[i]) ;                 ]                 Critical section;                 t[i] =0;                 Remainder Section; } While (true); Which one of the following is TRUE about the above solution?
A particular BNF definition for a “word” is given by the following rules. ∷ = | | ∷ = |  ∷ = |  ∷ = a | b | c | ….. |y| z  ∷ = 0 |1|2| …… | 9 Which of the following lexical entries can be derived from < word > ? l. pick II. picks lll. c44
The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands and one destination operand. Assume that all variables are dead after this code segment. c = a + b; d = c * a; e = c + a; x = c * c; if (x > a) {     y = a * a; } else {      d = d * d;      e = e * e; } Suppose the instruction set architecture of the processor has only two registers. The only allowed compiler optimization is code motion, which moves statements from one place to another while preserving correctness. What is the minimum number of spills to memory in the compiled code?