A program is executing in a pure demand paging system with 100 records per page with 1 free main memory frame. The address sequence that is generated by tracing this program is recorded as follows,0100, 0200, 0430, 0499, 0510, 0530, 0560, 0120, 0220, 0240, 0260, 0320, 0370What are the number of page faults?

A program is executing in a pure demand paging system with 100 records

1.	A program is executing in a pure demand paging system with 100 records per page with 1 free main memory frame. The address sequence that is generated by tracing this program is recorded as follows,0100, 0200, 0430, 0499, 0510, 0530, 0560, 0120, 0220, 0240, 0260, 0320, 0370What are the number of page faults?
A.	8
B.	11
C.	7
D.	12
Answer» D. 12

Discussion

No Comment Found

Related MCQs

We have a process that has been allocated 3 page frames and initially none of the pages of the process are available in the memory. The following sequence of page references (reference string) is made by the process : 1, 2, 1, 3, 7, 4, 5, 6, 3, 1If Optimal Page Replacement policy is used,_______ page faults will occur for the above reference string.
We have a process that has been allocated 3 page frames and initially none of the pages of the process are available in the memory. The following sequence of page references (reference string) is made by the process : 1, 2, 1, 3, 7, 4, 5, 6, 3, 1How many page faults will occur for the above reference string with the Least Recently Used(LRU) Page Replacement Policy in comparison to an Optimal Page Replacement policy?
Consider a virtual memory system that uses First In First Out (FIFO) page replacement policy and it allocates a fixed number of frames to a process. Consider the following two statements,1: Sometimes the page fault rate is increased if the number of page frames allocated is increased.2: Some programs do not exhibit Locality of reference.Which of the following is true?
Where can the Belady s anomaly occur?
Why do we translate a virtual address to physical address where a multilevel page table is preferred in comparison to a single level page table?
Match the following lists:a. Gang scheduling ------------------------------- i. Guaranteed schedulingb. Rate monotonic scheduling ------------------ ii. Real-time schedulingc. Fair share scheduling ------------------------- iii. Thread scheduling
Which page is selected by the Optimal Page Replacement Algorithm?
Let P1 and P2 be the two processes and S1 and S2 be the two shared Boolean variables. The initial values of S1 and S2 are randomly assigned. For accessing the critical sections of P1 and P2 the methods used by them are given below:Method used by P1While ( S1 == S2 );Critical sectionS1 = S2;Method used by P2While ( S1! = S2 )Critical sectionS2= not (S1);Which statement / s describes that the properties are achieved?
Consider the following statements:a. With the use of kernel supported threads context switch is faster.b. The entire process can be blocked by the system for user - level threads.c. Kernel supported threads can be scheduled independently.d. User level threads are transparent to the kernel.Which of the above statements are true?
Operating System: Which of the following scheduling algorithm is non-pre-emptive?

Discussion

No Comment Found

Related MCQs

Reply to Comment