Register

Testbook Test Series: Databases - Database Normalization

• edited by
1,874 views
2 2 votes

The number of tables required to convert the relational schema $R(A, B, C, D, E, F, G, H)$ into $3NF$ with following functional dependency is ________

  • $A\rightarrow DG$
  • $AB\rightarrow E$
  • $D\rightarrow C$
  •  $E\rightarrow F$
  • $G\rightarrow H$

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · ME Test SeriesNext → · Doubt in TOC Questio...
← Previous in category · ME Test SeriesNext in category → · ME T1
Position:
Show:

Related questions

2 2 votes
0 0 answers
2.3k
2.3k views
Mk Utkarsh asked Aug 21, 2018
2,289 views
Testbook Test Series: Databases - Functional Dependencies
Consider a relation R(A,B,C,D,E,F,G) with set of functional dependenciesF={AD->BF, CD->EGC, BD->F, E->D, F->C, D->F}The relation R is decomposed into the following two re...
4 4 votes
1 1 answer
1.2k
1.2k views
Akash Kanase asked Jan 15, 2016
1,161 views
TestBook Test Series: Databases - Super Keys
I think here even with Ph is removed from table we still get 12 Super keys. Because Salary & One of CK must be there.
1 1 vote
1 1 answer
842
842 views
Jyoti Kumari97 asked Jan 25, 2019
842 views
MadeEasy Workbook: Databases - Database Normalization
Find the highest normal form.AB - - CEE - - >ABC >DDoubtAB, E are the candidate key.The answer given is 2NFIn 2NF, there should be no partial dependency which isPRIME AT...
1 1 vote
1 1 answer
1.3k
1.3k views
Jyoti Kumari97 asked Jan 23, 2019
1,334 views
MadeEasy Workbook: Databases - Database Normalization
2.4 Find the highest normal form of the relation $R(A, B, C, D)$ that holds following FDs.\[\begin{array}{l}A \rightarrow B \\B \rightarrow D \\A \rightarrow C \\B C \rig...