Answer: C
Since each page contains 100 records, the page number for any given address A can be determined as ⌊A/100⌋.
Let's map the given address sequence to its corresponding page numbers:
- 0100→⌊100/100⌋=1
- 0200→⌊200/100⌋=2
- 0430→⌊430/100⌋=4
- 0499→⌊499/100⌋=4
- 0510→⌊510/100⌋=5
- 0530→⌊530/100⌋=5
- 0560→⌊560/100⌋=5
- 0120→⌊120/100⌋=1
- 0220→⌊220/100⌋=2
- 0240→⌊240/100⌋=2
- 0260→⌊260/100⌋=2
- 0320→⌊320/100⌋=3
- 0370→⌊370/100⌋=3
The resulting page reference string is:
1,2,4,4,5,5,5,1,2,2,2,3,3
With only 1 free main memory frame, a page fault occurs every time a referenced page is different from the page currently residing in the frame:
- Reference 1 → Fault (Frame: [1])
- Reference 2 → Fault (Frame: [2])
- Reference 4 → Fault (Frame: [4])
- Reference 4 → Hit (Frame: [4])
- Reference 5 → Fault (Frame: [5])
- Reference 5 → Hit (Frame: [5])
- Reference 5 → Hit (Frame: [5])
- Reference 1 → Fault (Frame: [1])
- Reference 2 → Fault (Frame: [2])
- Reference 2 → Hit (Frame: [2])
- Reference 2 → Hit (Frame: [2])
- Reference 3 → Fault (Frame: [3])
- Reference 3 → Hit (Frame: [3])
Counting the page faults, we get a total of 7 page faults.