Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

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?
The ____ lock allows concurrent transactions to access the same row as long as they require the use of different fields within that row.
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:
Which of the following statements are true/false?
1. Welfare of labour is item number 21 on the concurrent list.
2. Labour is included in the concurrent list in the seventh schedule of the Indian constitution.
3. Social Security and insurance are item number 24 on the concurrent list.4. Trade Union, industrial and labour disputes are item number 22 of the concurrent list.
MongoDB uses a ____________ lock that allows concurrent read access to a database but exclusive write access to a single write operation.
A database has 5 transactions. Of these, 4 transactions include milk and bread. Further, of the given 4 transactions, 2 transactions include cheese. Find the support percentage for the following association rule "if milk and bread are purchased, then cheese is also purchased".
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?
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.  
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.
For two transactions T1 and T2, T1 reads some rows from a table and then T2 inserts new rows into the table.