Exam 6: Concurrency: Deadlock and Starvation
Exam 1: Computer Systems Overview45 Questions
Exam 2: Operating System Overview45 Questions
Exam 3: Process Description and Control45 Questions
Exam 4: Threads45 Questions
Exam 5: Concurrency: Mutual Exclusion and Synchronization45 Questions
Exam 6: Concurrency: Deadlock and Starvation45 Questions
Exam 7: Memory Management45 Questions
Exam 8: Virtual Memory45 Questions
Exam 9: Uniprocessor Scheduling45 Questions
Exam 10: Multiprocessor and Real-Time Scheduling45 Questions
Exam 11: Io Management and Disk Scheduling45 Questions
Exam 12: File Management45 Questions
Exam 13: Embedded Operating Systems45 Questions
Exam 14: Computer Security Threats45 Questions
Exam 15: Computer Security Techniques45 Questions
Exam 16: Distributed Processing, Clientserver, and Clusters45 Questions
Exam 17: Network Protocols45 Questions
Exam 18: Distributed Process Management45 Questions
Select questions type
An executable entity within a process is a __________ object.
Free
(Short Answer)
4.8/5
(32)
Correct Answer:
thread
Three general approaches exist for dealing with deadlock: prevent, avoid, and __________ .
Free
(Short Answer)
4.9/5
(40)
Correct Answer:
detect
The _________ condition can be prevented by requiring that a process request all of its required resources at one time and blocking the process until all requests can be granted simultaneously.
Free
(Multiple Choice)
4.9/5
(34)
Correct Answer:
B
Three conditions of policy must be present for a deadlock to be possible: mutual exclusion, no preemption, and _________ .
(Short Answer)
4.9/5
(42)
The strategy of resource allocation denial is referred to as the ___________ .
(Short Answer)
4.8/5
(31)
The most common technique used for protecting a critical section in Linux is the __________ .
(Multiple Choice)
4.9/5
(38)
An atomic operation executes without interruption and without interference.
(True/False)
4.7/5
(28)
A __________ is a software mechanism that informs a process of the occurrence of asynchronous events.
(Multiple Choice)
4.9/5
(38)
The strategy of deadlock _________ is to design a system in such a way that the possibility of deadlock is excluded.
(Multiple Choice)
4.8/5
(36)
_________ can be defined as the permanent blocking of a set of processes that either compete for system resources or communicate with each other.
(Short Answer)
4.7/5
(36)
Deadlock avoidance is more restrictive than deadlock prevention.
(True/False)
4.7/5
(45)
Interrupts, signals, messages, and information in I/O buffers are all examples of reusable resources.
(True/False)
4.9/5
(41)
A signal is similar to a hardware interrupt but does not employ priorities.
(True/False)
5.0/5
(48)
A useful tool in characterizing the allocation of resources to processes is the resource allocation graph.
(True/False)
4.9/5
(37)
A _________ resource is one that can be safely used by only one process at a time and is not depleted by that use.
(Short Answer)
4.7/5
(37)
A program invocation, including the address space and resources required to run the program is a __________ object.
(Short Answer)
4.8/5
(36)
All deadlocks involve conflicting needs for resources by two or more processes.
(True/False)
4.9/5
(34)
Deadlock is permanent because none of the events is ever triggered.
(True/False)
4.9/5
(42)
The OS may preempt the second process and require it to release its resources if a process requests a resource that is currently held by another process.
(True/False)
4.8/5
(31)
Examples of __________ include processors, I/O channels, main and secondary memory, devices, and data structures such as files, databases, and semaphores.
(Multiple Choice)
4.8/5
(37)
Showing 1 - 20 of 45
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)