In the following (pseudo code) program, for variable ‘d’, what is the complete set of du-pairs?

int gcd(int a, int b) {
int c = a; int d = b;
if(c == 0)
return d;
while(d != 0) {
if(c d)
c = c - d;
else
d = d - c;}
return c; }

Note: The numbers on the left are the line numbers (nodes).

Question

In the following (pseudo code) program, for variable ‘d’, what is the complete set of du-pairs? 
 
   int gcd(int a, int b) {  
   int c = a; int d = b;  
   if(c == 0) 
      return d; 
   while(d != 0) {  
      if(c > d) 
         c = c - d; 
      else 
         d = d - c;}  
  return c; } 
 
 Note: The numbers on the left are the line numbers (nodes).

Answer

The set of all du-pairs for variable ‘d’ equals {[2-4], [2-5], [2-6], [2-7], [2-9], [9-5], [9-6], [9-7]}

Answer

The set of all du-pairs for variable ‘d’ equals {[2-5], [2-6], [2,-7], [2-9], [9-5], [9-6], [9-7]}

Answer

The set of all du-pairs for variable ‘d’ equals {[2-4], [2-5], [2-6], [2,-7], [2-9], [9-5], [9-6], [9-7], [9-9]}

Answer

The set of all du-pairs for variable ‘d’ equals {[2-4], [2-5], [2-6], [2,-7], [2-9]}

Crowdly

In the following (pseudo code) program, for variable ‘d’, what is the complete s...

Want instant access to all verified answers on moodle.ut.ee?