Operating System MCQ’s With answers-Chapter 06

Posted by

Operating System MCQ’s with answer,  100% free MCQ PDF DOWNLOAD

101. When process is swapped out of main memory and put in a suspended state
(A) All of its resident pages are moved out.
(B) All of the pages that were previously in main memory are returned to main memory.
(C) Pages other than the one demanded by a page fault are bought in main memory.
(D) None of these.

102. Statement A: The placement policy determines where in real memory a process piece is to reside.
Statement B: The fetch policy determines when a page should be bought into main memory.
(A) A and B both true
(B) A and B both false
(C) A is true, B is false
(D) A is false, B is true

103. When a frame in main memory is locked
(A) The page currently stored in that frame can be replaced.
(B) The page currently stored in that frame cannot be replaced.
(C) Pages currently in frame can be removed in round-robin style.
(D) None of these.

104. Statement A : In memory management, the replacement policy deals with the selection of pages in memory to be replaced by arrived new page.
Statement B: In memory management, the policy the fetch policy determines when a page should be bought into main memory.
(A) A and B both false
(B) A and B both true
(C) A is true, B is false
(D) A is false, B is true

105. The Least Recently Used (LRU) policy
(A) Replaces the page in memory that has not been referenced for the least time.
(B) Replaces the page in memory that has not been referenced for the longest time.
(C) Replaces the page in memory in round robin fashion.
(D) None of these.

106. In memory management where replacement is allowed in First-in-First-out (FIFO) fashion
(A) The page frames are allocated to a process as circular buffer and pages are removed in random order.
(B) The page frames are allocated to a process as circular buffer and pages are removed in round-robin order.
(C) Replaces the pages that are least referred.
(D) Replaces the pages that are most referred.

107. By principle of locality, in least recently used policy, in memory management
(A) The page replaced in memory is least likely to be referenced in the near future.
(B) The page replaced in memory is most likely to be referenced in the near future.
(C) The pages replaced in memory in round-robin fashion.
(D) None of these.

108. In First-In-First-out (FIFO) replacement policy used in memory management, the page frames to allocated to a process as circular buffer and
(A) The most recent page is removed at first
(B) The most recent page is removed at the last
(C) The most recent page is removed any time
(D) None of these

109. The memory management, y one clock policy is applied then the page first loaded into a frame in memory its use bit is set to
(A) Zero
(B) One
(C) Two
(D) Three

110. In memory management Free page list is:
A- A list of page frames available for reading in pages.
B- A list where replaced page is assigned without modification.
C-A list where replaced page is assigned with modification.
(A) A, B, C are true
(B) A and B are true
(C) A and C are true
(D) B and C are true.

111. A policy in memory management referred as clock policy because one can visualize the page frames as laid out in
(A) Straight line
(B) Rectangle
(C) Circle
(D) Square

112. In memory management :A-Fixed allocation policy, B-Variable allocation policy:
1-It gives a process a fixed number of frames in main memory within which to execute.
2-It allows the number of page frames allocated to a process to be varied over the life time of the process.
3-In it a number of allocated frames are decided at initial load time.
(A) A – 1, 3, B – 2
(B) A – 1, B – 3
(C) A – 2, B – 1, 3
(D) A – 1, 2, B – 3

113. In uni-processor scheduling :A : Turnaround time, B : Response time,
1: A time interval between the submission of a process and its completion.
2: For interactive process, it is a time from the submission of a request until the response begins to received.
3: It includes actual execution time plus time spent waiting for resources.
(A) A – 2, 2, B – 3
(B) A – 1, 3, B – 2
(C) A – 2, B – 1, 2
(D) A – 2, B – 1, 3

114. In uni-processor management processor through put
(A) Is a measure of how much work is being performed
(B) Is the percentage of time that the processor is busy
(C) Is a time interval between the submission of a process and its completion
(D) None of these

115. In uni-processor scheduling, a priorities enforcement is
(A) When processes are assigned priorities and scheduling policy favor higher priority processes.
(B) The scheduling keeps resources of system busy.
(C) Here currently running process can be interrupted and moved to ready state by the operating system.
(D) None of these.

116. In uni-processor scheduling, if nonpreemptive policy is applied then
(A) Once a process is in running state, it continues to execute until it terminates or block itself.
(B) Currently running process can be interrupted and moved to ready state by the operating system.
(C) The clock interrupt is generated at periodic intervals.
(D) None of these.

117. In aperiodic (real time) tasks
(A) The dead line for start is mandatory, but for finish it is not.
(B) The dead line for finish is mandatory, but for start it is not.
(C) The dead line for finish and start is mandatory.
(D) The dead line for finish and start is not mandatory.

118. The time table of railway, and airline which defines arrival and departure can be considered as
(A) Hard real time scheduling
(B) Soft real time scheduling
(C) None real time scheduling.
(D) None of these.

119. When preemptive policy is applied to uniprocessor scheduling then
(A) Once a process is in running state, it continues to execute until it terminates or block itself.
(B) Currently running process can be interrupted and moved to ready state by the operating system.
(C) The processes are assigned priorities.
(D) None of these.

120. The normalized turnaround time is
(A) Ratio of turnaround time to service time
(B) Ratio of turnaround time to waiting time
(C) Ratio of service time to waiting time
(D) Ratio of waiting time to service time.


101. (A) 102. (A) 103. (B) 104. (B) 105. (B)
106. (B) 107. (A) 108. (B) 109. (B) 110. (B)
111. (C) 112. (A) 113. (B) 114. (A) 115. (A)
116. (A) 117. (C) 118. (A) 119. (B) 120. (A)