MCQ Questions On Memory Management In OS Part-3

1. With .................... a page is brought into main memory only when a reference is made to a location on that page.
A) prepaging
B) demand paging
C) page buffering
D) precleaning

2. ................ exploits  the characteristics of most secondary memory devices, such as disks, which have seek times and rotational latency.
A) prepaging
B) demand paging
C) page buffering
D) precleaning

3. In most operating system texts, the treatment of memory management includes a section entitled "...................", which deals with the selection of a page in memory to be replaced when a new page must be brought in.
A) fetch policy
B) placement policy
C) replacement policy
D) cleaning policy

4. In .......................... some of the frames in main memory may be locked, which is called frame locking.
A) fetch policy
B) placement policy
C) replacement policy
D) cleaning policy

5. Which of the following is/are the basic algorithms that are used for selection of a page to replace in replacement policy.
i) Optional  ii) Least recently  used (LRU) iii) First in first out (FIFO)  iv) Last in first out (LIFO)
A) i, ii and iii only
B) ii, iii and iv only
C) i, iii and iv only
D) All i, ii, iii and iv

6. The ................ selectors for replacement that page for which the time to the next reference is longest.
A) Clock Policy
B) Optimal Policy
C) Least Recently Used (LRU) Policy
D) First in first out (FIFO) Policy

7. The ................. policy replaces the page in memory that has not been referenced for the longest time.
A) Clock
B) Optimal
C) Least Recently Used (LRU)
D) First in first out (FIFO)

8. ................... policy treats the page frames allocated to a process as a circular buffer, as pages are removed in round robin style.
A) Clock
B) Optimal
C) Least Recently Used (LRU)
D) First in first out (FIFO)

9. ................... policy does nearly as well as an optimal policy, it is difficult to implement and imposes significant overhead.
A) Clock
B) Optimal
C) Least Recently Used (LRU)
D) First in first out (FIFO)
10. The ................... policy is very simple to implement but performs relatively poorly.
A) Clock
B) Optimal
C) Least Recently Used (LRU)
D) First in first out (FIFO)


11. The simplest form of .................... requires the association of an additional bit with each frame, referred to as the use bit.
A) Clock Policy
B) Optimal Policy
C) Least Recently Used (LRU) Policy
D) First in first out (FIFO) Policy

12. State whether the following statements about clock policy are True or False
i) The clock policy is similar to optimal policy
ii) In the clock policy, any frame with a use bit of 1 is passed over by algorithm
iii) The policy is referred to as a clock policy because we can visualize the page frames as laid out in circle.
A) i and ii only
B) ii and iii only
C) i and iiii only
D) All i, ii and iii

13. With a ..................... policy in resident set management, whenever a page fault occurs in the execution of a process, one of the pages of that process must be replaced by the needed page.
A) global replacement
B) local replacement
C) fixed-allocation
D) variable-allocation

14. .................... policy is suffering persistently high levels of page faults, indicating that  the principle of locality only holds in a weak form for that process.
A) Global replacement
B) Local replacement
C) Fixed-allocation
D) Variable-allocation

15. A .............. chooses only among  the resident pages of the process that generated the page fault in selecting a page to replace.
A) global replacement policy
B) local replacement policy
C) fixed-allocation
D) variable-allocation

16. A .............. considers all unblocked pages in main memory as candidates for replacement regardless of which process owns a particular page.
A) global replacement policy
B) local replacement policy
C) fixed-allocation
D) variable-allocation

17. ................... are attractive because of their simplicity of implementation and minimal overhead.
A) global replacement policies
B) local replacement policies
C) fixed-allocation
D) variable-allocation

18. For .............. page to be replaced is chosen from all available frames in main memory.
A) Fixed allocation in Local Scope
B) Fixed allocation in Global Scope
C) Variable allocation in Local Scope
D) Variable allocation in Global Scope

19. In which of the following relation, page to replace is chosen from among the frames allocated to that process.
i) Fixed allocation, Local Scope  ii) Fixed allocation, Global Scope iii) Variable allocation, Local Scope
iv) Variable allocation, Global Scope
A) i and ii
B) i and iii
C) iii and iv
D) ii  and iii

20. For ................... the number of frames allocated to a process may be change from time to time.
A) Fixed allocation in Local Scope
B) Fixed allocation in Global Scope
C) Variable allocation in Local Scope
D) Variable allocation in Global Scope

  
Answers

1. B) demand paging
2. A) prepaging
3. C) replacement policy
4. C) replacement policy
5. A) i, ii and iii only
6. B) Optimal Policy
7. C) Least Recently Used (LRU)
8. D) First in first out (FIFO)
9. C) Least Recently Used (LRU)
10. D) First in first out (FIFO)
11. A) Clock Policy
12. B) ii and iii only
13. C) fixed-allocation
14. D) Variable-allocation
15. B) local replacement policy
16. A) global replacement policy
17. A) global replacement policies
18. D) Variable allocation in Global Scope
19. B) i and iii
20. C) Variable allocation in Local Scope

Read Next:Top 30 MCQ Questions On Uniprocessor Scheduling In OS

MCQ Questions On Memory Management In OS Part-3
2017-01-24T00:55:00-08:00
Shuseel Baral
Multiple Choice Question (MCQ)|Operating System|