Consider the following two relations, R(A, B) and S(A, C):
R | |
---|---|
A | B |
10 | 20 |
20 | 30 |
30 | 40 |
30 | 50 |
50 | 95 |
S | |
---|---|
A | C |
10 | 90 |
30 | 45 |
40 | 80 |
The total number of tuples obtained by evaluating the following expression
$$ \sigma_{B < C}(R \bowtie_{R.A = S.A} S) $$
is _________
The symbol → indicates functional dependency in the context of a relational database. Which of the following options is/are TRUE?
Consider the following read-write schedule $S$ over three transactions $T_{1}$, $T_{2}$, and $T_{3}$, where the subscripts in the schedule indicate transaction IDs:
$S: r_{1}(z); w_{1}(z); r_{2}(x); r_{3}(y); w_{3}(y); r_{2}(y); w_{2}(x); w_{2}(y);$
Which of the following transaction schedules is/are conflict equivalent to $S$?
Consider a system that uses 5 bits for representing signed integers in 2’s complement format. In this system, two integers A and B are represented as A=01010 and B=11010. Which one of the following operations will result in either an arithmetic overflow or an arithmetic underflow?