In demand paging,
A) a page loaded in memory may never be accessed.
B) all pages that a program will access during execution are loaded in memory in the beginning.
C) a page is loaded in memory only when it is needed during execution.
D) a page is loaded in memory just before it is needed.
Correct Answer:
Verified
Q2: The most preferred method of swapping a
Q3: _ is the algorithm implemented on most
Q4: The Second-Chance algorithm
A) is same as FIFO
Q5: The dirty (modify) bit identifies
A) a page
Q6: Given the reference string of page accesses:
Q8: If an instruction modifies several different locations,
Q9: A drawback of equal or proportional allocation
Q10: Counting based page replacement algorithms are not
Q11: Optimal page replacement _.
A) is the page-replacement
Q12: Suppose we have the following page accesses:
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents