β˜‘ MCQ PRACTICE

Operating Systems Unit 3

Practice objective questions for quick revision and examination preparation. Try answering each question before revealing the answer.

πŸ“š Operating Systems
πŸ“– Unit 3
🎯 MCQs

Operating Systems - Unit-3

1
Which of the following condition is required for deadlock to be possible?
Amutual exclusion
Ba process may hold allocated resources while awaiting assignment of other resources
Cno resource can be forcibly removed from a process holding it
Dall of the mentioned
Correct AnswerD
2
A system is in the safe state if
Athe system can allocate resources to each process in some order and still avoid a deadlock
Bthere exist a safe sequence
Cboth A and B
Dnone of the mentioned
Correct AnswerC
3
The circular wait condition can be prevented by
Adefining a linear ordering of resource types
Busing thread
Cusing pipes
Dall of the mentioned
Correct AnswerA
4
Which one of the following is the deadlock avoidance algorithm?
Abanker’s algorithm
Bround-robin algorithm
Celevator algorithm
Dkarn’s algorithm
Correct AnswerA
5
What is the drawback of banker’s algorithm?
Ain advance processes rarely know that how much resource they will need
Bthe number of processes changes as time progresses
Cresource once available can disappear
Dall of the mentioned
Correct AnswerD
6
For a deadlock to arise, which of the following conditions must hold simultaneously ? ( choose all that apply )
AMutual exclusion
BHold and wait
CNo preemption
DAll the Above
Correct AnswerD
7
For Mutual exclusion to prevail in the system :
Aat least one resource must be held in a non sharable mode
Bthe processor must be a uniprocessor rather than a multiprocessor
Cthere must be at least one resource in a sharable mode
DAll of these
Correct AnswerA
8
For a Hold and wait condition to prevail :
AA process must be not be holding a resource, but waiting for one to be freed, and then request to acquire it
BA process must be holding at least one resource and waiting to acquire additional resources that are being held by other processes
CA process must hold at least one resource and not be waiting to acquire additional resources
DNone of these
Correct AnswerB
9
For non sharable resources like a printer, mutual exclusion :
Amust exist
Bmust not exist
Cmay exist
DNone of these
Correct AnswerA
10
A deadlock avoidance algorithm dynamically examines the __________, to ensure that a circular wait condition can never exist.
Aresource allocation state
Bsystem storage state
Coperating system
Dresources
Correct AnswerA
11
A state is safe, if :
Athe system does not crash due to deadlock occurrence
Bthe system can allocate resources to each process in some order and still avoid a deadlock
Cthe state keeps the system protected and safe
DAll of these
Correct AnswerB
12
If no cycle exists in the resource allocation graph :
Athen the system will not be in a safe state
Bthen the system will be in a safe state
Ceither A or B
DNone of these
Correct AnswerB
13
The content of the matrix Need is :
AAllocation – Available
BMax – Available
CMax – Allocation
DAllocation – Max
Correct AnswerC
14
If deadlocks occur frequently, the detection algorithm must be invoked ________.
Ararely
Bfrequently
CNone of these
Dboth A and B
Correct AnswerB
15
A deadlock can be broken by : (choose all that apply)
Aabort one or more processes to break the circular wait
Babort all the process in the system
Cpreempt all resources from all processes
Dto preempt some resources from one or more of the deadlocked processes
Correct AnswerA and D
16
If we preempt a resource from a process, the process cannot continue with its normal execution and it must be :
Aaborted
Brolled back
Cterminated
Dqueued
Correct AnswerB
17
If the resources are always preempted from the same process, __________ can occur.
Adeadlock
Bsystem crash
Caging
Dstarvation
Correct AnswerD
18
A binary semaphore
Ahas the values one or zero
Bis essential to binary computers
Cis used only for synchronisation
Dis used only for mutual exclusion
Correct AnswerA
19
Mutual exclusion can be provided by the
Amutex locks
Bbinary semaphores
Cboth A and B
DD.none of the mentioned
Correct AnswerC
20
When two or more processes attempt to access the same resource a _________ occurs.
ACritical section
BFight
CCommunication problem
DRace condition
Correct AnswerD
21
Which is true regarding pipes?
Ahalf duplex
Bfull duplex
Cmessage boundaries are preserved
Dunordered data
Correct AnswerA
22
Advantage of FIFO over pipe is
Arelated processes can communicate
Bunrelated processes can communicate
Call of the mentioned
Dnone of the mentioned
Correct AnswerB
23
What mkfifo( ) creats?
Apipe
Bunnamed pipe
Cnamed pipe
Dmsg queue
Correct AnswerC
24
Which is Fastest IPC?
AMessage Queue
Bshared memory
CSocket
DAll of the mentioned
Correct AnswerB
← Back to All MCQs