recategorized by
296 views
0 votes
0 votes

In relational DBMS, the closure of functional dependencies facilitates 

  1.  To determine the candidate key 
  2. To determine the foreign key 
  3. To determine the dependency of an attribute with other attribute/s 
  4. None of these
recategorized by

1 Answer

0 votes
0 votes
the closure of Functional dependencies determines the Candidate key.If the closure determine all the attributes then this determinat (LHS) of the functional dependency become a Candidate key.

Hence the option A is correct.

Related questions

0 votes
0 votes
1 answer
1
gatecse asked Aug 4, 2019
326 views
The schema for the entire database is designed using Data definitional languageStructured query languageData manipulation language Schema structure language
0 votes
0 votes
0 answers
2
gatecse asked Aug 4, 2019
232 views
The Software Development Life Cycle (SDLC) is used in allProcess modelsDesign modelsProgramming modelsNone of these
0 votes
0 votes
0 answers
3
gatecse asked Aug 4, 2019
247 views
The complexity of algorithms is comparatively more accurate in the use ofAsymptotic analysisAmortized analysisBoth of theseNot dependent on the nature of analysis.
0 votes
0 votes
0 answers
4
gatecse asked Aug 4, 2019
258 views
The picture definition, stored in the $24$ frame buffers of which each $8$ frame buffers are reserved for the primary colours viz., red, blue & green displays the picture...