Deadlock Handling Notes Questions with Answers PDF Download – Test 327

MCQ 1631: The number of action(s) need to be taken in order to recover from a deadlock is/are:

1. 1
2. 2
3. 3
4. 4

MCQ 1632: The basic steps involved in processing a query is of type:

1. 2 types
2. 3 types
3. 4 types
4. 5 types

MCQ 1633: Computation of the recursive query using current contents of view relation, and adding resulting tuples back to the view relation, is the:

1. First step in recursive view
2. Second step in recursive view
3. Third step in recursive view
4. Fourth step in recursive view

MCQ 1634: The notion of a key for a relation schema, applies directly to:

1. Relationships
2. Roles
3. Attributes
4. Entity sets

MCQ 1635: The fanout of the node is basically mean:

1. Number of indices
2. Number of leaf nodes
3. Number of nonleaf nodes
4. Number of pointers