Write a recursive function next_pow2(n) that returns the smallest integer value p such that for a non-negative value n. For exam
1 answer:
Answer:
Explanation:
The following code is written in Python and is a recursive function as requested that uses the current value of p (which is count in this instance) and raises 2 to the power of p. If the result is greater than or equal to the value of n then it returns the value of p (count) otherwise it raises it by 1 and calls the function again.
def next_pow2(n, count = 0):
if (2**count) < n:
count += 1
return next_pow2(n, count)
else:
return count
You might be interested in
Answer:
Option d) B is 1.33 times faster than A
Given:
Clock time,
No. of cycles per instructions,
Solution:
Let I be the no. of instructions for the program.
CPU clock cycle, = 2.0 I
CPU clock cycle, = 1.0 I
Now,
CPU time for each can be calculated as:
CPU time, T =
Thus B is faster than A
Now,
Performance of B is 1.33 times that of A