Let E – McqOptions

MCQOPTIONS

1.	Let E
A.	2
B.	3
C.	4
D.	5
Answer» C. 4

Discussion

No Comment Found

Related MCQs

Which of the following statements are true about an SQL query? <br>P. An SQL query can contain HAVING clause even if it does not have a GROUP BY clause <br>Q. An SQL query can contain HAVING clause only if it does not have a GROUP BY clause <br>R. All attributes used in the GROUP BY clause must appear in the SELECT clause <br>S. Not all attributes used in the GROUP BY clause need to appear in the SELECT clause
Consider the following log sequence of two transactions on a bank account, with initial balance 12000, that transfer 2000 to a mortagage payment and then apply a 5% interest. <br>1. T<sub>1</sub> start <br>2. T<sub>1</sub> B old = 1200 new = 10000 <br>3. T<sub>1</sub> M old = 0 new = 2000 <br>4. T<sub>1</sub> commit <br>5. T<sub>1</sub> start<br>6. T<sub>2</sub> B old = 10000 new = 10500 <br>7. T<sub>2</sub> commit <br>Suppose the database system crashes just before log record is written. When the system is started, which one statement is true of the recovery procedure?
Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock ? <br>1. 2-phase locking <br>2. Time-stamp ordering
Consider the following transactions with data items P and Q initialized to zero : <br>T1 : read (P); <br> read (Q); <br> if P = 0 then Q = Q + 1; <br> write (Q); <br>T2 : read (Q); <br> read (P); <br> if Q = 0 then P = P + 1; <br> write (P); <br>Any non-serial interleaving of T<sub>1</sub> and T<sub>2</sub> for concurrent execution leads to
Consider the transactions T1, T2, and T3 and the schedules S1 and S2 given below. <br>T1: r1(X); r1(Z); w1(X); w1(Z) <br>T2: r2(Y); r2(Z); w2(Z) <br>T3: r3(Y); r3(X); w3(Y) <br>S1: r1(X); r3(Y); r3(X); r2(Y); r2(Z); w3(Y); w2(Z); r1(Z); w1(X); w1(Z)<br>S2: r1(X); r3(Y); r2(Y); r3(X); r1(Z); r2(Z); w3(Y); w1(X); w2(Z); w1(Z) <br>Which one of the following statements about the schedules is <b>TRUE</b> ?
Consider a simple checkpointing protocol and the following set of operations in the log. <br>(start, T4); (write, T4, y, 2, 3); (start, T1); <br>(commit, T4); (write, T1, z, 5, 7); <br>(checkpoint); <br>(start, T2); (write, T2, x, 1, 9); <br>(commit, T2); (start, T3), <br>(write, T3, z, 7, 2); <br>If a crash happens now the system tries to recover using both undo and redo operations, what are the contents of the undo list and the redo list?
Consider the following transaction involving two bank accounts x and y. <br>read(x); x: = x 50; write(x); read (y); y = y + 50; write(y) <br>The constraint that the sum of the accounts x and y should remain constant is that of
Consider the following database schedule with two transactions, T<sub>1</sub> and T<sub>2</sub>. <br>S = r<sub>2</sub> (X); r<sub>1</sub>(X); r<sub>2</sub> (Y); w<sub>1</sub> (X); r<sub>1</sub> (Y); w<sub>2</sub> (X); a<sub>1</sub>; a<sub>2</sub> <br>where r<sub>i</sub> (Z) denotes a read operation by transaction T<sub>i</sub> on a variable Z, w<sub>i</sub> (Z) denotes a write operation by T<sub>i</sub> on a variable Z and a<sub>i</sub> denotes an abort by transaction T<sub>i</sub>. <br>Which one of the following statements about the above schedule is <b>TRUE</b> ?
Suppose a database schedule S involves transactions T<sub>1</sub>, ...., T<sub>n</sub>. Construct the precedence graph of S with vertices representing the transactions and edges representing the conflicts. If S is serializable, which one of the following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule?
Consider the following database table named top_scorer.<br><table class="wp-block-table"><tbody><tr><td><strong>Player</strong> </td><td> <strong>Country</strong> </td><td> <strong>Goals </strong> </td></tr><tr><td>Klose </td><td>Germany </td><td>16 </td></tr><tr><td>Ronaldo </td><td>Brazil </td><td>15 </td></tr><tr><td>G Muller </td><td>Gemany </td><td>14 </td></tr><tr><td>Fontaine </td><td>France </td><td>13 </td></tr><tr><td>Pele </td><td> Brazil </td><td>12 </td></tr><tr><td>Klinsmann </td><td> Germany </td><td>11 </td></tr><tr><td>Kocsis </td><td>Hungary </td><td>11 </td></tr><tr><td>Batistuta </td><td>Argentina </td><td>10 </td></tr><tr><td>Cubillas </td><td> Peru </td><td>10 </td></tr><tr><td>Lato </td><td>Poland </td><td>10 </td></tr><tr><td>Lineker </td><td>England </td><td>10 </td></tr><tr><td>T Miller </td><td>Germany </td><td>10 </td></tr><tr><td>Rahn </td><td>Germany </td><td>10 </td></tr></tbody></table><br>Consider the following SQL query: <br>SELECT ta.player FROM top_scorer AS ta <br>WHERE ta.goals >ALL (SELECT tb.goals <br>FROM top_scorer AS tb <br>WHERE tb.country = Spain ) <br>AND ta.goals >ANY (SELECT tc.goals <br>FROM top_scorer AS tc <br>WHERE tc.country = Germany ) <br>The number of tuples returned by the above SQL query is ________.