Answer:
The output is 24
Explanation:
Given
The above code segment
Required
The output
We have (on the first line):
On the second line:
Substitute the value of each variable
Solve the inner brackets
8%3 implies that, the remainder when 8 is divided by 3.
The remainder is 2
So:
<em>Hence, the output is 24</em>
Answer:
Check the explanation
Explanation:
An integer (int) is of two different bytes and each page has 200 bytes in length. What this means is that each row of array A (100 int) will fits perfectly in a page.
(a) For the initial or first array-initialization loop, one column is processed at a time, so a page fault will be generated at every inner loop iteration, with a total of 100*100=10,000 page faults.
(b) And when it comes to the second array-initialization loop, one row is processed at a time, and a page fault is generated at every outer loop iteration, with a total of 100 page faults.
Hence second array-initialization loop, has better spatial locality.
Answer:
The recursion function is as follows:
def raise_to_power(num, power):
if power == 0:
return 1
elif power == 1:
return num
else:
return (num*raise_to_power(num, power-1))
Explanation:
This defines the function
def raise_to_power(num, power):
If power is 0, this returns 1
if power == 0:
return 1
If power is 1, this returns num
elif power == 1:
return num
If otherwise, it calculates the power recursively
else:
return (num*raise_to_power(num, power-1))
