| 91. | Given the following input (4322, 1334, 1471, 9679, 1989, 6171, 6173, 4199) and the hash function x mod 10, which of the following statements are true? 1. 9679, 1989, 4199 hash to the same value 2. 1471, 6171 hash to the same value 3. All elements hash to the same value 4. Each element hashes to a different value |
| Discuss |
|
Answer: (c).1 and 2 only
|
| 92. | Let R1 (A, B, C) and R2 (D, E) be two relation schema, where the primary keys are shown underlined, and let C be a foreign key in R1 referring to R2. Suppose there is no violation of the above referential integrity constraint in the corresponding relation instances r1 and r2. Which one of the following relational algebra expressions would necessarily produce an empty relation ?
 |
| Discuss |
|
Answer: (b).2
|
| 93. | Consider the relation Student (name, sex, marks), where the primary key is name, pertaining to students in a class that has at least one boy and one girl. What does the following relational algebra expression produce? (Note: r is the rename operator). The condition in join is "(sex = female ^ x = male ^ marks ≤ m)"  |
| Discuss |
|
Answer: (d).names of girl students with more marks than all the boy students
|
| 95. | Which of the following is wrong?
The goal of concurrent execution is |
| Discuss |
|
Answer: (b).Reduced Probability of Deadlock
|
| 96. | Consider the following ordering of transactions:
T1 : R(X); T2 : R(X); T1 : w(x); T1 : r(y); T2 : w(x); T2 : Commit; T1: w(y) ; T1: Commit Which of the following is true? |
| Discuss |
|
Answer: (b).Cascade less schedule
|
| 97. | In strict two-phase locking protocol |
| Discuss |
|
Answer: (a).All exclusive mode lock taken by transaction be held until transaction commits
|
| 98. | Is the corresponding schedule is conflict serializable schedule?
 |
| Discuss |
|
Answer: (a).Yes
|
| 99. | Suppose three are 3 transactions T22, T23, T24 with timestamps 10, 20, 30. Now T23 occupies a data item that is required by T22 and T24. Among the four possibilities what will be true in wait–die schema? |
| Discuss |
|
Answer: (a).If T22 request the data item, T22 will wait
|
| 100. | Two transactions T₁ and T₂ are given as follows:
T₁: r₁ (A); w₁(A); r₁ (B); w₁(B) Find the no. of conflict serializable schedules that can be formed over T₁ and T₂. |
| Discuss |
|
Answer: (d).15
|
