search
Log In

Answers by Kartavya Kothari

0 votes
1
A table has fields $Fl, F2, F3, F4, F5$ with the following functional dependencies $F1 → F3$ $F2→ F4$ $(F1 . F2) → F5$ In terms of Normalization, this table is in $1NF$ $2NF$ $3NF$ None of these
answered Apr 24, 2018 in Databases 2.4k views
2 votes
2
Which one of the following statements about normal forms is $\text{FALSE}?$ $\text{BCNF}$ is stricter than $3NF$ Lossless, dependency-preserving decomposition into $3NF$ is always possible Lossless, dependency-preserving decomposition into $\text{BCNF}$ is always possible Any relation with two attributes is in $\text{BCNF}$
answered Apr 24, 2018 in Databases 4.7k views
...