0 — Test 371
Page 1 of 3
Question 1
Segment replacement algorithms are more complex than page replacement algorithms because ____________
0
System Administrator 2026
Question 2
A swapper manipulates ___________ whereas the pager is concerned with individual _______ of a process.
0
System Administrator 2026
Question 3
Using a pager ____________
0
System Administrator 2026
Question 4
The valid – invalid bit, in this case, when valid indicates?
0
System Administrator 2026
Question 5
A page fault occurs when?
0
System Administrator 2026
Question 6
When a page fault occurs, the state of the interrupted process is ____________
0
System Administrator 2026
Question 7
When a process begins execution with no pages in memory?
0
System Administrator 2026
Question 8
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 ____________
0
System Administrator 2026
Question 9
When the page fault rate is low ____________
0
System Administrator 2026
Question 10
Locality of reference implies that the page reference being made by a process ____________
0
System Administrator 2026