In_ systems, deadlocks. can cause critical situations. batch interactive real-time general purpose _ is when, in modern printing systems, a disk accepts out put from several users and acts as a temporary storage area for all out put until the printer is ready to accept it. Phishing Lagging Spooling Spoofing _ is the policy of allowing only one process to have access to a dedicated resource. No preemption Circular wait Resource holding Mutual exclusion _is when each process involved in an impasse is waiting for another to voluntarily release its resources so that at least one process will be able to continue. Mutual exclusion Resource holding Circular wait No preemption _published a visual tool to show how deadlock conditions can be modeled using directed graphs Havender Holt Dijkstra Lanc & Mooney _is necessary\' in any computer system because some resources such as memory. CPU, and dedicated devices must be exclusively allocated to one user at a time. Mutual exclusion Resource holding No preemption Circular wait The scheme of _ removes the possibility of a circular wait and therefore guarantees the removal of deadlocks. hierarchical ordering saving and restoring job state preemption requesting all resources before job run _developed the Banker\'s Algorithm Havender Holt DijkstraLane & Mooney The Banker\'s Algorithm is an example of a(n)_policy. mutual exclusion detection avoidance recovery An algorithm designed to detect starvation by tracking how long each job has been waiting for resources is using the concept of_. deadlock aging preemption round robin When a job is accepted by the system it\'s put on_and placed in a queue. HOLD RUNNING WAITING READY The transition from_is initiated by the Job Scheduler according to some predefined policy. At this point, the availability of enough main memory and any requested devices is checked READY to RUNNING RUNNING to WAITING RUNNING back to READY HOLD to READY The transition from_can be initiated by the Process Scheduler or the Job Scheduler WAITING to READY RUNNING to WAITING RUNNING to FINISHED HOLD to READY An I/O request is called a(n)_wait in multiprogramming environments forced natural scheduled indirect
Please find the answers below:
21) a) batch : in a batch processing system, a deadlock can stop the whole batch to stop in which any of the single job cannot run untill the deadlock is removed, thus causing it severe critical situations
22) b) Spooling : it is mechanism to send the data which needs to be printed to an intermediate stoarge, which later on will print those documents
23) d) Mutual exclusion: it is the process which allows only one process to use any particular one resource.
24) c) Circular wait : it is a kind of waiting for the resource which is held by some other process in the process pool
28) c) Dijkstra invented the Banker\'s algorithm
29) c) Avoidance: Banker\'s algorithm is an example of deadlock avoidance that tests for safety by allocating resources
31) b) Ready : System accepted job will be in ready state, which when starts running will converts to running state
Homework Sourse
