Bissoy.com
Doctors Medicines MCQs Q&A

If transaction Ti gets an explicit lock on the file Fc in exclusive mode, then it has an ­­­­­­__________ on all the records belonging to that file.

If transaction Ti gets an explicit lock on the file Fc in exclusive mode, then it has an ­­­­­­__________ on all the records belonging to that file. Correct Answer Implicit lock in exclusive mode

If transaction Ti gets an explicit lock on the file Fc in exclusive mode, then it has an implicit lock in exclusive mode on all the records belonging to that file.

Related Questions

Let transaction T1 has obtained a shared mode lock S on data item Q and transaction T2 has obtained an exclusive mode lock X on data item R  Consider the following statement. I: T1 can read Q but cannot write Q. II. T2 can read R but cannot write R. Which of the above statements is / are valid?
Consider a computer system with multiple shared resource types, with one instance per resource type. Each instance can be owned by only one process at a time. Owning and freeing of resources are done by holding a global lock (L). The following scheme is used to own a resource instance: function OWNRESOURCES(Resource R) Acquire lock L / / a global lock if R is available then Acquire R Release lock L else if R is owned by another process P then Terminate P, after releasing all resources owned by P Acquire R Restart P Release lock L end if end if end function Which of the following choice(s) about the above scheme is/are correct?
In a database system, unique timestamps are assigned to each transaction using Lamport’s logical clock. Let TS(T1) and TS(T2) be the timestamps of transactions T1 and T2 respectively. Besides, T1 holds a lock on the resource R, and T2 has requested a conflicting lock on the same resource R. The following algorithm is used to prevent deadlocks in the database system assuming that a killed transaction is restarted with the same timestamp. If TS(T2) < TS(T1) then T1 is killed else T2 waits. Assume any transaction that is not killed terminates eventually. Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks?
A multithreaded program P executes with x number of threads used y number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks in the program are non-re-entrant. i.e. if a thread holds a lock l, then it cannot re-acquire lock l without releasing it. If a thread is unable to acquire a lock, it blocks until the lock becomes available. The minimum value of x and the minimum value of y together for which execution of p can result in a deadlock are:
In the following question below are given three statements followed by three conclusions. Taking the given statements to be true even if they seem to be at variance from commonly known facts, read all the conclusions and then decide which of the given conclusion logically follows the given statements. Statements: I. All Key are Lock. II. No Lock is Mat. III. All Mat are Glass. Conclusions: I. Some Glass being a Lock is a possibility. II. Some Glass are Key. III. No Key is Mat.
Some pens are divided among P, Q, R, and S. P gets twice the number of pens that Q gets. R gets the same number of pens as S gets. If P gets 25 pens more than S and the ratio of the number of pens that Q and R get 2 : 3, then what is the number of pens that S gets?
Which of the following mode has exclusive range and exclusive resource lock?
Below are given statements followed by some conclusions. You have to take the given statements to be true even if they seem to be at variance with the commonly known facts and then decide which of the given conclusions logically follow(s) from the given statements. Statements: I) All lock is book. II) No book is colored. Conclusions: I) All book is lock. II) No lock is Colored.  
A sum of Rs. 12,500 is distributed among A, B, C and D such that A gets Rs. 800 more than what B gets, C gets twice of what B gets and D gets Rs. 900 more than what A gets. The ratio in which D, C, B and A receive the sums is:
If a node is locked in ____________ then explicit locking is being done at a lower level, with exclusive-mode or shared-mode locks.