Multiple Choice
If the memory access time is denoted by 'ma' and 'p' is the probability of a page fault (0 <= p <= 1) . Then the effective access time for a demand paged memory is
A) p x ma + (1-p) x page fault time
B) ma + page fault time
C) (1-p) x ma + p x page fault time
D) none of the mentioned
Correct Answer:
Verified
Correct Answer:
Verified
Q4: LRU page - replacement algorithm associates with
Q5: When a process begins execution with no
Q6: What is the Optimal page - replacement
Q7: When a page fault occurs, the state
Q8: Virtual memory is normally implemented by_ <br>A)demand paging<br>B)buses<br>C)virtualization<br>D)all
Q10: The ability to execute a program that
Q11: When the page fault rate is low<br>A)the
Q12: Virtual memory allows_<br>A)execution of a process that
Q13: Locality of reference implies that the page
Q14: Users_that their processes are running on a