Operating System MCQ’s With answers-Chapter 07

Posted by

The "Answers" given with the Question is "not verified". To view Verified answers click on the button below.

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

121. In uni-processor scheduling, shortest process next policy is
(i) A: Non-preemptive policy
(ii) B: Preemptive policy
(iii) C: A policy where the process with shortest expected processing time is selected next.
(iv) D: A policy where the process with shortest expected processing time is not selected.
(B) A and D are true (C) B and C are true
(D) A and C are true (e) B and D are true.

122. In uni-processor scheduling, shortest remaining time policy is
(A) A policy where scheduler chooses the process that has the shortest expected remaining processing time.
(B) A policy where scheduler discards the process that has the shortest expected remaining process time.
(C) A policy where process with shortest expected processing time is selected next.
(D) None of these.

123. In round robin (time slicing) policy applied on uni-processor scheduling
(A) When interrupt occurs, the currently running process is placed in ready queue, and next ready job is selected in First come First serve basis.
(B) When interrupt occurs, the currently running process is placed in ready queue and next ready job is selected in random order.
(C) No interruption is entertained.
(D) None of these.

124. If normalized turnaround time of different process are given. Then Highest response ratio next policy in uniprocessor scheduling policy selects.
(A) The ready process with lowest normalized turnaround time.
(B) The ready process with highest normalized turnaround time.
(C) The process with shortest expected processing time.
(D) The process with highest expected processing time.

125. In multi processor scheduling, independent parallelism indicates
(A) There is synchronization among processes at gross level.
(B) There is no explicit synchronization among processes.
(C) A parallel processing or multi tasking is done within a single application.
(D) None of these.

126. In multi processor scheduling : A: Course gained parallelism, B: Medium grained parallelism, C: Fine grained parallelism;
1- Concurrent processes running on a multi programmed uni- processor.
2- Parallel processing or multi tasking is done within a single application.
3- Parallel processing is done within a single instruction stream.
(A) A – 1, B – 2, C – 3
(B) A – 2, B – 3, C – 1
(C) A – 3, B – 2, C – 1
(D) A – 1, B – 3, C – 2

127. In round robin (time slicing) policy applied on uni processor scheduling
(A) When interrupt occurs, the currently running process is placed in ready queue, and next ready job is selected in First come First serve basis.
(B) When interrupt occurs, the currently running process is placed in ready queue and next ready job is selected in random order.
(C) No interruption is entertained.
(D) None of these.

128. If normalized turnaround time of different process are given. Then Highest response ratio next policy in uni processor scheduling policy selects
(A) The ready process with lowest normalized turnaround time.
(B) The ready process with highest normalized turnaround time.
(C) The process with shortest expected processing time.
(D) The process with highest expected processing time.

129. In multi processor scheduling, independent parallelism indicates
(A) There is synchronization among processes at gross level.
(B) There is no explicit synchronization among processes.
(C) A parallel processing or multi tasking is done within a single application.
(D) None of these.

130. In multi processor scheduling; A: Coarse gained parallelism, B: Medium grained parallelism, C: Fine grained parallelism;
1- Concurrent processes running on a multi programmed uni processor,
2- Parallel processing or multi tasking is done within a single application,
3-Parallel processing is done within a single instruction stream.
(A) A – 1, B – 2, C – 3
(B) A – 2, B – 3, C – 1
(C) A – 3, B – 2, C – 1
(D) A – 1, B – 3, C – 2

131. A situation where two or more processes coordinate their activities based on a condition is referred as
(A) Synchronization
(B) Dead lock
(C) Starvation
(D) Par begin

132. Par begin (P1)
(A) Suspends main program, execute procedure P1 and after execution resume main program.
(B) Procedure P1 is delayed infinitely due to other procedure are given preference.
(C) Procedure P1 is not considered for execution.
(D) None of these.

133. The mail box and ports are examples of
(A) Indirect process communication
(B) Direct process communication.
(C) Both A and B true
(D) None is true

134. In Dynamic partition of main memory in memory management, the sized of process and memory partition is
(A) of exactly same size
(B) of different size.
(C) Both A and B true
(D) None is true

135. In the simple paging in memory management where
(A) Process can be loaded into a partition of equal or greater size.
(B) Process is loaded into a partition of exactly same size.
(C) Process is divided into a number of equal size pages of same length as of frames.
(D) None of these.

136. A. Absolute Loading B. Relocatable Loading C. Dynamic Run-Time Loading;
1- It requires that a load module always be loaded into some location in main memory.
2- A load module can be located anywhere in main memory.
(A) A – 2, B – 1, C – 1
(B) A – 1, B – 1, C – 2
(C) A – 1, B – 2, C – 2
(D) A – 1, B – 2, C – 1

137. The disk and tape devices are referred as
(A) Block oriented I/O devices
(B) Stream oriented I/O devices
(C) Logical I/O devices
(D) None of these

138. Which of the following is not human readable I/O device ?
(A) Video display terminals
(B) Key board
(C) Printers
(D) Disk drives

139. Following is not the stream oriented I/O device
(A) Printer
(B) Mouse
(C) Communication modules
(D) Disk/tape

140. The direct memory access (DM(A) module
(A) Controls the data exchange between main memory and I/O module.
(B) The processor issues I/O command, execute subsequent instructions and interrupt I/O module.
(C) The processor issues I/O commands to an I/O module.
(D) None of these.


121. (D) 122. (A) 123. (A) 124. (B) 125. (B)
126. (A) 127. (A) 128. (B) 129. (B) 130. (A)
131. (A) 132. (A) 133. (A) 134. (A) 135. (C)
136. (C) 137. (A) 138. (D) 139. (D) 140. (A)