Operating System Test 2 Computer Subject
Operating System Test 2 Computer Subject
Question 11
Which of the following types of resources can create a deadlock?
Reusable resources, when not released properly, can lead to deadlocks in concurrent systems.
Not clear enough?
Question 12
In a system, necessary conditions to arise a deadlock situation if _____?
Deadlocks require all four conditions: mutual exclusion, hold-and-wait, no preemption, and circular wait.
Not clear enough?
Question 13
One necessary condition for deadlock is _____ that states that at least one resource must be held in a non-sharable mode.
Mutual exclusion means at least one resource must be held exclusively, forming a basis for deadlock.
Not clear enough?
Question 14
Which of the following is most often used by operating systems to handle deadlocks?
Most OSes take the approach of ignoring deadlocks, often called the ostrich algorithm.
Not clear enough?
Question 15
Which of the following "semaphore" can take the non-negative integer values?
Counting semaphores allow integer values greater than zero, unlike binary semaphores limited to 0 and 1.
Not clear enough?
Question 16
Which of the following statement is true?
An unsafe state does not guarantee deadlock, but it has the potential to lead to one.
Not clear enough?
Question 17
A deadlocked state occurs when two or more processes are waiting indefinitely for an event that can be _____?
Deadlock happens when processes indefinitely wait for events that only other waiting processes can cause.
Not clear enough?
Question 18
A process must be holding at least one resource and waiting to acquire additional resources that are currently being held by other processes is called _____?
This situation is known as Hold and Wait, one of the four necessary conditions for deadlock.
Not clear enough?
Question 19
Which of the following statement is true for Banker's algorithm?
The Banker's algorithm can allocate multiple instances of resources but is not more efficient than the graph scheme.
Not clear enough?
Question 20
Which of the following scheduling algorithm is non-preemptive scheduling?
SJF (Shortest Job First) is non-preemptive unless used in its preemptive form (SRTF).
Not clear enough?
You might like
One of the options below have the same features as the profit and loss account in non-profit organisation
In the following sentence, the word that resolves the emphatic stress is written in capital letters. From the options, choose the one to which the given sentence is the appropriate answer.
Daddy plays TENNIS on Saturday afternoons
The gravitational force between two objects is 10N, what is the new value of the force if the distance between them is halved?
In the Sieve Technique, it is true that we do not necessarily know which specific item is the 'item of interest' at the start of the process.
The science of optimising the use of farm resources at an individual farm level to achieve specific goals is known as __________.