subject

Suppose threads A and B are attempting to lock at the same time. Assume that there is a single shared variable. Let the value of 0 mean that no object is in the CS. Assume that a value of 1 in this variable indicates that A is entering/is in the CS and a value of 2 in the same register indicates that B is entering/is in the CS. Assume that A and B both read the register, initially 0, and are about to update them. Suppose A updates the register to 1. What would be the result? A. A will enter the CS.
B. The two threads will deadlock.
C. B will wait for A to complete the execution of the CS.
D. B will eventually obliterate the value written by A.
E. The lock object will be in an inconsistent state.
F. Both A and B could be in the CS at the same time.

ansver
Answers: 3

Another question on Computers and Technology

question
Computers and Technology, 23.06.2019 17:00
*! 20 points! *jeff wants to create a website with interactive and dynamic content. which programming language will he use? a. dhtml b. html c. css d. javascript
Answers: 1
question
Computers and Technology, 23.06.2019 17:30
Write pseudocode to represent the logic of a program that allows the user to enter a value. the program multiplies the value by 10 and outputs the result.
Answers: 1
question
Computers and Technology, 24.06.2019 16:00
To fill (copy) a cell across or down, point to the of the cell and drag. top left corner top right corner bottom left corner bottom right corner
Answers: 3
question
Computers and Technology, 24.06.2019 16:50
Ramp charts are generally created in wordlotusexcelpowerpoint
Answers: 1
You know the right answer?
Suppose threads A and B are attempting to lock at the same time. Assume that there is a single share...
Questions
question
Mathematics, 13.07.2021 23:50
question
Mathematics, 13.07.2021 23:50
Questions on the website: 13722360