Tutorials
PPTs
Lecture Notes
Objective Questions
Lab ProgramsObjective Type Questions & Answers
Operating Systems -Unit-3 Objective Type Questions
1. Which of the following condition is required for deadlock to be possible?
A . mutual exclusion
B . a process may hold allocated resources while awaiting assignment of other resources
C . no resource can be forcibly removed from a process holding it
D . all of the mentioned
2. A system is in the safe state if
A . the system can allocate resources to each process in some order and still avoid a deadlock
B . there exist a safe sequence
C . both A and B
D . none of the mentioned
3. The circular wait condition can be prevented by
A . defining a linear ordering of resource types
B . using thread
C . using pipes
D . all of the mentioned
4. Which one of the following is the deadlock avoidance algorithm?
A . banker’s algorithm
B . round-robin algorithm
C . elevator algorithm
D . karn’s algorithm
5. What is the drawback of banker’s algorithm?
A . in advance processes rarely know that how much resource they will need
B . the number of processes changes as time progresses
C . resource once available can disappear
D . all of the mentioned
6. For a deadlock to arise, which of the following conditions must hold simultaneously ? ( choose all that apply )
A . Mutual exclusion
B . Hold and wait
C . No preemption
D . All the Above
7. For Mutual exclusion to prevail in the system :
A . at least one resource must be held in a non sharable mode
B . the processor must be a uniprocessor rather than a multiprocessor
C . there must be at least one resource in a sharable mode
D . All of these
8. For a Hold and wait condition to prevail :
A . A process must be not be holding a resource, but waiting for one to be freed, and then request to acquire it
B . A process must be holding at least one resource and waiting to acquire additional resources that are being held by other processes
C . A process must hold at least one resource and not be waiting to acquire additional resources
D . None of these
9. For non sharable resources like a printer, mutual exclusion :
A . must exist
B . must not exist
C . may exist
D . None of these
10. A deadlock avoidance algorithm dynamically examines the __________, to ensure that a circular wait condition can never exist.
A . resource allocation state
B . system storage state
C . operating system
D . resources
11. A state is safe, if :
A . the system does not crash due to deadlock occurrence
B . the system can allocate resources to each process in some order and still avoid a deadlock
C . the state keeps the system protected and safe
D . All of these
12. If no cycle exists in the resource allocation graph :
A . then the system will not be in a safe state
B . then the system will be in a safe state
C . either A or B
D . None of these
13. The content of the matrix Need is :
A . Allocation – Available
B . Max – Available
C . Max – Allocation
D . Allocation – Max
14. If deadlocks occur frequently, the detection algorithm must be invoked ________.
A . rarely
B . frequently
C . None of these
D . both A and B
15. A deadlock can be broken by : (choose all that apply)
A . abort one or more processes to break the circular wait
B . abort all the process in the system
C . preempt all resources from all processes
D . to preempt some resources from one or more of the deadlocked processes
16. If we preempt a resource from a process, the process cannot continue with its normal execution and it must be :
A . aborted
B . rolled back
C . terminated
D . queued
17. If the resources are always preempted from the same process, __________ can occur.
A . deadlock
B . system crash
C . aging
D . starvation
18. A binary semaphore
A . has the values one or zero
B . is essential to binary computers
C . is used only for synchronisation
D . is used only for mutual exclusion
19. Mutual exclusion can be provided by the
A . mutex locks
B . binary semaphores
C . both A and B
D . D.none of the mentioned
20. When two or more processes attempt to access the same resource a _________ occurs.
A . Critical section
B . Fight
C . Communication problem
D . Race condition
21. Which is true regarding pipes?
A . half duplex
B . full duplex
C . message boundaries are preserved
D . unordered data
22. Advantage of FIFO over pipe is
A . related processes can communicate
B . unrelated processes can communicate
C . all of the mentioned
D . none of the mentioned
23. What mkfifo( ) creats?
A . pipe
B . unnamed pipe
C . named pipe
D . msg queue
24. Which is Fastest IPC?
A . Message Queue
B . shared memory
C . Socket
D . All of the mentioned
Relevant Materials :
☞ Operating Systems -Unit-1 Objective Type Questions - [ Operating Systems ]
☞ Operating Systems -Unit-2 Objective Type Questions - [ Operating Systems ]
☞ Operating Systems -Unit-3 Objective Type Questions - [ Operating Systems ]
☞ Operating Systems -Unit-4 Objective Type Questions - [ Operating Systems ]
☞ Operating Systems -Unit-5 Objective Type Questions - [ Operating Systems ]
Similar Materials :
☞ R - Programming MCQs - Unit-1 - [ R-Programming ]
☞ R - Programming MCQs - Unit-2 - [ R-Programming ]
☞ R - Programming MCQs - Unit-3 - [ R-Programming ]
☞ R - Programming MCQs - Unit-4 - [ R-Programming ]
☞ R - Programming MCQs - Unit-5 - [ R-Programming ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-1 - [ FLAT ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-2 - [ FLAT ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-3 - [ FLAT ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-4 - [ FLAT ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-5 - [ FLAT ]
☞ PPS MCQs - Unit-1 - [ PPS ]
☞ PPS MCQs - Unit-2 - [ PPS ]
☞ PPS MCQs - Unit-3 - [ PPS ]
☞ PPS MCQs - Unit-4 - [ PPS ]
☞ PPS MCQs - Unit-5 - [ PPS ]
☞ Object Oriented Programming through Java MCQs - Unit-1 - [ OOP_JAVA ]
☞ Object Oriented Programming through Java MCQs - Unit-2 - [ OOP_JAVA ]
☞ Object Oriented Programming through Java MCQs - Unit-3 - [ OOP_JAVA ]
☞ Object Oriented Programming through Java MCQs - Unit-4 - [ OOP_JAVA ]
☞ Object Oriented Programming through Java MCQs - Unit-5 - [ OOP_JAVA ]
☞ Design and Analysis of Algorithms MCQs - Unit-1 - [ DAA ]
☞ Design and Analysis of Algorithms MCQs - Unit-2 - [ DAA ]
☞ Design and Analysis of Algorithms MCQs - Unit-3 - [ DAA ]
☞ Design and Analysis of Algorithms MCQs - Unit-4 - [ DAA ]
☞ Design and Analysis of Algorithms MCQs - Unit-5 - [ DAA ]
☞ Software Engineering MCQs - Unit-1 - [ SE ]
☞ Software Engineering MCQs - Unit-2 - [ SE ]
☞ Software Engineering MCQs - Unit-3 - [ SE ]
☞ Software Engineering MCQs - Unit-4 - [ SE ]
☞ Software Engineering MCQs - Unit-5 - [ SE ]
☞ Data Mining MCQs - Unit-1 - [ DM ]
☞ Data Mining MCQs - Unit-2 - [ DM ]
☞ Data Mining MCQs - Unit-3 - [ DM ]
☞ Data Mining MCQs - Unit-4 - [ DM ]
☞ Data Mining MCQs - Unit-5 - [ DM ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-1 - [ COA ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-2 - [ COA ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-3 - [ COA ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-4 - [ COA ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-5 - [ COA ]
☞ Data Structures Objective Type Question Bank-Unit-1 - [ DS ]
☞ Data Structures Objective Type Question Bank-Unit-2 - [ DS ]
☞ Data Structures Objective Type Question Bank-Unit-3 - [ DS ]
☞ Data Structures Objective Type Question Bank-Unit-4 - [ DS ]
☞ Data Structures Objective Type Question Bank-Unit-5 - [ DS ]
☞ Database Management System Objective Type Question Bank-Unit-1 - [ DBMS ]
☞ Database Management System Objective Type Question Bank-Unit-2 - [ DBMS ]
☞ Database Management System Objective Type Question Bank-Unit-3 - [ DBMS ]
☞ Database Management System Objective Type Question Bank-Unit-4 - [ DBMS ]
☞ Database Management System Objective Type Question Bank-Unit-5 - [ DBMS ]