Q15

MCQ1 mark, −0.25

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:

(A)

$\lceil \log_2n \rceil +1$

(B)

$n$

(C)

$\lceil \log_2n \rceil$

(D)

$\lfloor \log_2n \rfloor +1$

Loading…