A condition that occurs when two transactions wait for each other to unlock data is known as a(n)

Related MCQs

• Each of a pair of transactions has read data that is written by the other, but there is no data written by both transactions, is referred to as
• A concurrency-control policy such as this one leads to              performance since it forces transactions to wait for preceding transactions to finish before they can start.
•                      are used to ensure that transactions access each data item in order of the transactions’          if their accesses conflict.
• When transaction Ti requests a data item currently held by Tj, Ti is allowed to wait only if it has a timestamp smaller than that of Tj (that is, Ti is older than Tj). Otherwise, Ti is rolled back (dies). This is
• When transaction Ti requests a data item currently held by Tj, Ti is allowed to wait only if it has a timestamp larger than that of Tj (that is, Ti is younger than Tj ). Otherwise, Tj is rolled back (Tj is wounded by Ti). This is
• In a                            operations do not wait for requests to produce tuples, but instead generate the tuples eagerly.
• A deadlock exists in the system if and only if the wait-for graph contains a                        
• A deadlock exists in the system if and only if the wait for graph:
• Find the names of these cities with temperature and condition whose condition is neither sunny nor cloudy.
• Find the name of those cities with temperature and condition whose condition is either sunny or cloudy but temperature must be greater than 70.