I believe the answer to your question is going to be C. 20
Hope this helps:)
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.
An internal node is a node which carries at least one child or in other words, an internal node is not a leaf node.
All of the above
---------------------------------
Answer:
Low memory?
So to fix the problem you could add more memory to the machine.
Explanation:
