Consider the following segment of C-code:
int j, n;
j = 1;
while (j <= n)
j = j*2
The number of comparisons made in the execution of the loop for any n > 0 is:
Reveal answer
Fill a bubble to check yourself
Keep practicing — related questions
- Consider the following C code segment: int Is Prime (n) { int i, n; for (i = 2; i <= sqrt (n) ; i ++) if (n...
- Consider the following C code segment: int Is Prime (n) { int i, n; for (i = 2; i <= sqrt (n) ; i ++) if (n...
- What would be the output of the following C code? int i=1, j=1; int n = 1; if(n>0){i++;j--;}printf(i=%d, j=...
- Consider the following C-program fragment in which i, j and n are integer variables. for( i = n, j = 0; i >...
- Consider the following C-program fragment in which i, j and n are integer variables. for( i = n, j = 0; i >...
- How many number of times will the loop mentioned below be executed? int x=5;int y=30;while(x<=y){ x=y/x; y=...
- Consider the following C code segment. for (i - 0, i<n; i++) { for (j=0; j<n; j++) { if (i%2) { x += (4* j ...
- In C programming, what does I equal at the end of the following piece (snippet) of code? i =1; i *=5; i +=3;