Top 550+ Solved Operating System (OS) MCQ Questions Answer
Q. In question 2, if the number of page frames is increased to 4, then the number of page transfers
a. decreases
b. increases
c. remains the same
d. none of the mentioned
Q. A memory page containing a heavily used variable that was initialized very early and is in constant use is removed, then the page replacement algorithm used is
a. lru
b. lfu
c. fifo
d. none of the mentioned
Q. Users that their processes are running on a paged system.
a. are aware
b. are unaware
c. may unaware
d. none of the mentioned
Q. A FIFO replacement algorithm associates with each page the
a. time it was brought into memory
b. size of the page in memory
c. page after and before it
d. all of the mentioned
Q. What is the Optimal page – replacement algorithm?
a. replace the page that has not been used for a long time
b. replace the page that has been used for a long time
c. replace the page that will not be used for a long time
d. none of the mentioned
Q. LRU page – replacement algorithm associates with each page the
a. time it was brought into memory
b. the time of that page’s last use
c. page after and before it
d. all of the mentioned
Q. What are the two methods of the LRU page replacement policy that can be implemented in hardware?
a. counters
b. ram & registers
c. stack & counters
d. registers
Q. When using counters to implement LRU, we replace the page with the
a. smallest time value
b. largest time value
c. greatest size
d. none of the mentioned
Q. There is a set of page replacement algorithms that can never exhibit Belady’s Anomaly, called
a. queue algorithms
b. stack algorithms
c. string algorithms
d. none of the mentioned
Q. The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by
a. the instruction set architecture
b. page size
c. physical memory size
d. number of processes in memory
Q. What is the reason for using the LFU page replacement algorithm?
a. an actively used page should have a large reference count
b. a less used page has more chances to be used again
c. it is extremely efficient and optimal
d. all of the mentioned
Q. In segmentation, each address is specified by
a. a segment number & offset
b. an offset & value
c. a value & segment number
d. a key & value
Q. Each entry in a segment table has a
a. segment base
b. segment peak
c. segment value
d. none of the mentioned
Q. The segment limit contains the
a. starting logical address of the process
b. starting physical address of the segment in memory
c. segment length
d. none of the mentioned