A system is in a ______ state if there exists a set of transactions in which every transaction is waiting for another transaction in the set. (1 Point) * Starved Isolated Deadlock None of the mentioned Which of the following does not fit in the ACID properties of a transaction. (1 Point) * D - Durability I - Isolation A - Atomicity C - Concurrency
Added by Shawn G.
Close
Step 1
Step 1: A system is in a **deadlock** state if there exists a set of transactions in which every transaction is waiting for another transaction in the set. Show more…
Show all steps
Your feedback will help us improve your experience
Akash M and 54 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
View the below scenario regarding transactions T1, T2, and T3, then follow the subsequent instructions. Transactions T1, T2, and T3 are simultaneously presented to the scheduler for execution. T1 will first modify resource X followed by resource Y. T2 will first modify resource Y followed by resource Z. T3 will first modify resource Z followed by resource X. This scenario can result in __________________________. (Check all situations which can result from scheduling these three transactions.) a. deadlock of transactions T2 and T3 only b. deadlock of transactions T1 and T2 only c. deadlock of all three transactions d. deadlock of transactions T1 and T3 only e. all transactions completing successfully
Akash M.
The system is in a deadlock state. This remark is: (A) True (B) False (C) Impossible to determine (D) Unpredictable
OPERATING SYSTEM
DEADLOCK AND CPU SCHEDULING
Shu N.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD