0 votes
1 answer
1
2 votes
3 answers
3
Insert the given values in the order in initially empty $\text{AVL}$ tree.$\text{34,21,10,27,24,43,15,6}$What is the value at the root of the tree$?$
0 votes
1 answer
5
Given relation and the FDs applicable on it. How to check whether a given decomposition is lossless and dependency preserving?I know that for lossless we can easily chec...
5 votes
4 answers
8
Given R(ABCD) andAB → C ;ABD → C ;ABC → D ;AC → Dwhich the highest possible normal form for the above relation ?
3 votes
3 answers
9
Given a relation R (ABCD), and the following FDs- A->BCDBC->ADD->B.which is the highest normal form the table is in.a) 1NFb) 2NFc)3NFd) BCNF
0 votes
2 answers
15
In DBMS, why is there a need for the use of tree based indexing algorithms, when we have multilevel indexes available for use ?
0 votes
1 answer
16
Here, the value of p should be 24, not 23 as taken...also no reason is given for this assumption by the author (Navathe ). Can anyone explain this ?
1 votes
3 answers
18
Suppose we have a schedule containing two transactions  as shown-$\begin{bmatrix} T1 & T2 \\ R(A) & \\ W(A) & \\ & R(A) \\  & W(A) \\ R(B)& \\ W(B)& \\ & R(B) \\  & W(...