Operating System MCQ's Set -2
21] Which of the following memory unit that processor can access more rapidly?
(A) Main Memory
(B) Virtual Memory
(C) Cache memory
(D) Read Only Memory
ANSWER : C
22] A process said to be in ___________ state if it was waiting for an event that will never occur.
(A) Safe
(B) Unsafe
(C) Starvation
(D) Deadlock
ANSWER : D
23] PCB is__________________
(A) Program Control Block
(B) Process Control Block
(C) Process Communication Block
(D) None of the above
ANSWER : B
24] The ______system call loads a binary file into process’s address space and starts its execution.
(A) exec
(B) fork
(C) wait
(D) getpid
ANSWER : A
25] A process can be terminated due to _________.
(A) normal exit
(B) fatal error
(C) killed by another process
(D) All of the above
ANSWER : D
26] Which of the following components of program state are shared across threads in a multithreaded process?
(A) Register values
(B) Heap memory and Global variables
(C) Stack memory
(D) None of the above
ANSWER : B
27] User threads
(A) are supported above the kernel and are managed without kernel support
(B) are supported below the kernel and are managed without kernel support
(C) are supported above the kernel and are managed with kernel support
(D) are supported below the kernel and are managed with kernel support
ANSWER : A
28] The hardware mechanism that allows a device to notify the CPU is called _______.
(A) polling
(B) interrupt
(C) driver
(D) controlling
ANSWER : B
29] In Priority Scheduling, a solution to the problem of infinite blockage (Starvation) of low-priority processes is resolved by __________.
(A) Terminating the process
(B) Aging
(C) Mutual Exclusion
(D) Semaphore
ANSWER : B
30] The____________ scheduler controls the degree of multiprogramming
(A) short term
(B) long term
(C) medium term
(D) None of the above
ANSWER : B
31] Which of the following method is always preemptive?
(A) priority based scheduling
(B) time sharing round robin
(C) first come first served
(D) shortest job first
ANSWER : B
32] A scheduler considers only those processes, which are in _______ state, while selecting a next process for execution.
(A) ready
(B) running
(C) waiting
(D) terminated
ANSWER : A
33] In Shortest-Job-First Scheduling, if the next CPU bursts of two processes are the same, ____ scheduling is used to break the tie.
(A) Shortest-Job-First
(B) First-Come, First Served
(C) Priority
(D) Round-Robin
ANSWER : B
34] Which of the following scheduling algorithm is provably optimal, in that it gives the minimum average waiting time for a given set of processes.
(A) Round-Robin Scheduling
(B) First-Come, First Served Scheduling
(C) Priority Scheduling
(D) Shortest-Job First Scheduling
ANSWER : D
35] The ____ is a special case of the general priority scheduling algorithm
(A) FCFS scheduling
(B) RR scheduling
(C) FCLS scheduling
(D) SJF algorithm
ANSWER : D
36] Which of the following Scheduling Algorithm is designed especially for timesharing systems?
(A) Shortest-Job-First Scheduling
(B) Round-Robin Scheduling
(C) First-Come, First Served Scheduling
(D) Priority Scheduling
ANSWER : B
37] If the semaphore value is negative :
(A) its magnitude is the number of processes waiting on that semaphore
(B) it is invalid
(C) no operation can be further performed on it until the signal operation is performed on it
(D) None of these
ANSWER : A
38] A solution to the critical-section problem must satisfy which of the following three requirements:
1. Mutual exclusion 2. Progress 3. Un-Bounded waiting 4. Bounded waiting
(A) 1,2 ,3
(B) 2,3,4
(C) 1,3,4
(D) 1,2,4
ANSWER : D
39] A semaphore :
(A) is a binary mutex
(B) must be accessed from only one process
(C) can be accessed from multiple processes
(D) None of these
ANSWER : C
40] When several processes access the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place, is called?
(A) dynamic condition
(B) race condition
(C) essential condition
(D) critical condition
ANSWER : B
