Consider the universal relation R= {A,B,C,D,E,F,G,H,I,J} and a set of functional dependencies F= { {AB→ C}, { A → DE}, { B→ F}, {F→ GH}, {D→ IJ}}. What is the key for R? Decompose R into 2NF, then 3NF relations.
SIKSHAPATH Latest Questions
DS Assignment – 2
Rate of convergence of Newton Raphson method is! (A) 3 B) 1.5 C 2 (D) None
Gauss Elimination Method
R(ABCDE) FDs are : AB-> C, C-> D, D-> E, E-> A, D-> B