Top 550+ Solved Operating System (OS) MCQ Questions Answer
Q. Virtual memory allows
a. execution of a process that may not be completely in memory
b. a program to be smaller than the physical memory
c. a program to be larger than the secondary storage
d. execution of a process without being in physical memory
Q. A process is thrashing if
a. it is spending more time paging than executing
b. it is spending less time paging than executing
c. page fault occurs
d. swapping can not take place
Q. The ability to execute a program that is only partially in memory has benefits like
a. the amount of physical memory cannot put a constraint on the program
b. programs for an extremely large virtual space can be created
c. throughput increases
d. all of the mentioned
Q. Virtual memory is normally implemented by
a. demand paging
b. buses
c. virtualization
d. all of the mentioned
Q. Segment replacement algorithms are more complex than page replacement algorithms because
a. segments are better than pages
b. pages are better than segments
c. segments have variable sizes
d. segments have fixed sizes
Q. A swapper manipulates whereas the pager is concerned with individual of a process.
a. the entire process, parts
b. all the pages of a process, segments
c. the entire process, pages
d. none of the mentioned
Q. Using a pager
a. increases the swap time
b. decreases the swap time
c. decreases the swap time & amount of physical memory needed
d. increases the amount of physical memory needed
Q. The valid – invalid bit, in this case, when valid indicates?
a. the page is not legal
b. the page is illegal
c. the page is in memory
d. the page is not in memory
Q. A page fault occurs when?
a. a page gives inconsistent data
b. a page cannot be accessed due to its absence from memory
c. a page is invisible
d. all of the mentioned
Q. When a page fault occurs, the state of the interrupted process is
a. disrupted
b. invalid
c. saved
d. none of the mentioned
Q. When a process begins execution with no pages in memory?
a. process execution becomes impossible
b. a page fault occurs for every page brought into memory
c. process causes system crash
d. none of the mentioned
Q. 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
a. p x ma + (1-p) x page fault time
b. ma + page fault time
c. (1-p) x ma + p x page fault time
d. none of the mentioned
Q. When the page fault rate is low
a. the turnaround time increases
b. the effective access time increases
c. the effective access time decreases
d. turnaround time & effective access time increases
Q. Locality of reference implies that the page reference being made by a process
a. will always be to the page used in the previous page reference
b. is likely to be one of the pages used in the last few page references
c. will always be one of the pages existing in memory
d. will always lead to page faults
Q. Which of the following page replacement algorithms suffers from Belady’s Anomaly?
a. optimal replacement
b. lru
c. fifo
d. both optimal replacement and fifo