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
R(ABCDE) FDs are : AB-> C, C-> D, D-> E, E-> A, D-> B
Q.Write a block in PL/SQL to print the specific number of rows from a table.
Write a program in PL/SQL to show the uses of SQL%FOUND to determine if a DELETE statement affected any rows.
Write a query to create a view to getting a count of how many customers we have at each level of a grade.
DBMS question of 2.3 worksheet if anyone knows please help and explain it.