
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN: 9780133594140
Author: James Kurose, Keith Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question

Transcribed Image Text:8. A cycle in a resource-allocation graph is:
A) a necessary and sufficient condition for deadlock in the case that each resource has more than
one instance
B) a necessary and sufficient condition for a deadlock in the case that each resource has exactly
one instance
C) a sufficient condition for a deadlock in the case that each resource has more than once
instance
D) is neither necessary nor sufficient for indicating deadlock in the case that each resource has
exactly one instance
9. To handle deadlocks, operating systems most often:
A) pretend that deadlocks never occur
B) use protocols to prevent or avoid deadlocks
C) detect and recover from deadlocks
D) None of the above

Transcribed Image Text:Questions on deadlock:
1. A deadlocked state occurs whenever:
A) a process is waiting for I/O to a device that does not exist
B) the system has no available free resources
C) every process in a set is waiting for an event that can only be caused by another process in
the set
D) a process is unable to release its request for a resource after use
2. One necessary condition for deadlock is
held in a non-sharable mode.
, which states that at least one resource must be
A) hold and wait
B) mutual exclusion
C) circular wait
D) no preemption
3. One necessary condition for deadlock is
one resource and waiting to acquire additional resources.
A) hold and wait
B) mutual exclusion
C) circular wait
D) no preemption
which states that a process must be holding
which states that a resource can be released
4. One necessary condition for deadlock is
only voluntarily by the process holding the resource.
A) hold and wait
B) mutual exclusion
C) circular wait
D) no preemption
5. One necessary condition for deadlock is
processes whereby Po is waiting for a resource held by Pı, Pı is waiting for a resource held by P2.
and Pn is waiting for a resource held by Po.
A) hold and wait
B) mutual exclusion
C) circular wait
D) no preemption
which states that there is a chain of waiting
6. Explain what has to happen for a set of processes to achieve a deadlocked state.
7. In a system resource-allocation graph:
A) a directed edge from a process to a resource is called an assignment edge
B) a directed edge from a resource to a process is called a request edge
C) a directed edge from a process to a resource is called a request edge
D) None of the above
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution
Trending nowThis is a popular solution!
Step by stepSolved in 2 steps

Knowledge Booster
Similar questions
- Consider a computer environment in which there are 4 magnetic drives, 2 printers, 3 scanners, and 1 optical drive. Three processes P1, P2, P3 are using these resources. At any point in time, the allocations and requests for these resources are as follows. Allocations: Magnetic drive Printer Scanner Optical drive P1 1 P2 2 1 P3 1 Requests: Magnetic drive 2 Printer Scanner Optical drive P1 1 P2 1 1 P3 2 1 Is there any way that the processes can complete without deadlock? If yes, explain how. If not, explain why not.arrow_forwardSchedulers: Select all of the following statements that are true. A long-term scheduler selects which process should be executed next and allocates the CPU. The main task of a medium-term scheduler is to swap out and in processes from memory. A long-term scheduler executes much more often than a short-term scheduler. The long-term scheduler controls the degree of multiprogramming. The ready queue contains the set of all processes residing in main memory, ready and waiting to execute. Device queues refer to processes waiting for an I/O device.arrow_forwardWhen a process is in the "Blocked" state, waiting for an I/O operation to complete. When a service is canceled, it enters one of the following states: a) State of Termination, b) State of Suspension, c) State of Running, or d) State of Readiness.arrow_forward
- Quèstion 20 The requirement of extra storage and copy operation is a disadvantage of in-out mode with Pass-by-Reference. True Falsearrow_forwardMulti-tasking can not be achieved with a single processor machine. True False 2. Async/Await is best for network bound operations while multi-threading and parallel programming is best for CPU-bound operations. True False 3. The following is a characteristic of an async method:The name of an async method, by convention, ends with an "Async" suffix. True False 4. Using asynchronous code for network bound operations can speed up the time needed to contact the server and get the data back. True False 5. Asynchronous programming has been there for a long time but has tremendously been improved by the simplified approach of async programming in C# 5 through the introduction of: The Task class True Falsearrow_forwardSelect all statements below that are true O A set of processes is in a safe state S if S is not a deadlock state and any state T reachable from S is not a deadlock state. In order for a deadlock to occur, only one of the four conditions necessary for deadlocks to occur must be satisfied. O A deadlock means that at least two processes cannot continue working because they are waiting for each to make resources available. о One of the the four conditions necessary for deadlocks to occur is non- preemption. Interrupts, messages, and signals are examples of consumable resources. Reusable resources are produced and consumed dynamically. QL - DELL Warrow_forward
- Operating system -pls fill in the blanks for the following questions.arrow_forwardConcurrent Processes / Monitors select which is true options: a CV (condition variable) queues in a monitor store suspended processes waiting on the corresponding condition. b The "Signal and Wait" approach (Hoare semantics) leads to more efficient implementation and reduces the number of context switches. c Two or more processes can be active in the same monitor simultaneously. d When the "Signal and Continue"-approach (Mesa semantics) is applied, the signaling process P continues executing. e The monitor-based solution to the Dining-Philosophers problem discussed in class is restricted to 5 philosophers.arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Computer Networking: A Top-Down Approach (7th Edi...Computer EngineeringISBN:9780133594140Author:James Kurose, Keith RossPublisher:PEARSONComputer Organization and Design MIPS Edition, Fi...Computer EngineeringISBN:9780124077263Author:David A. Patterson, John L. HennessyPublisher:Elsevier ScienceNetwork+ Guide to Networks (MindTap Course List)Computer EngineeringISBN:9781337569330Author:Jill West, Tamara Dean, Jean AndrewsPublisher:Cengage Learning
- Concepts of Database ManagementComputer EngineeringISBN:9781337093422Author:Joy L. Starks, Philip J. Pratt, Mary Z. LastPublisher:Cengage LearningPrelude to ProgrammingComputer EngineeringISBN:9780133750423Author:VENIT, StewartPublisher:Pearson EducationSc Business Data Communications and Networking, T...Computer EngineeringISBN:9781119368830Author:FITZGERALDPublisher:WILEY

Computer Networking: A Top-Down Approach (7th Edi...
Computer Engineering
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:PEARSON

Computer Organization and Design MIPS Edition, Fi...
Computer Engineering
ISBN:9780124077263
Author:David A. Patterson, John L. Hennessy
Publisher:Elsevier Science

Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:9781337569330
Author:Jill West, Tamara Dean, Jean Andrews
Publisher:Cengage Learning

Concepts of Database Management
Computer Engineering
ISBN:9781337093422
Author:Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:Cengage Learning

Prelude to Programming
Computer Engineering
ISBN:9780133750423
Author:VENIT, Stewart
Publisher:Pearson Education

Sc Business Data Communications and Networking, T...
Computer Engineering
ISBN:9781119368830
Author:FITZGERALD
Publisher:WILEY