Search for question
Question
(a) Consider the relation R2(A, B, C, D, E, F, G, H, I, J) and its functional dependencies \mathcal{F}_{R_{2}}=\{C \rightarrow B H, I \rightarrow D G, J \rightarrow C, A J \rightarrow E, A \rightarrow F I\} i. Determine (all) the candidate key(s) (i.e., minimal keys) of R2. ii. For each candidate key, state its number of superkeys. (b) Consider the relation schema Students (ID, Name, AdvisorId, Advisor Name, FavoriteAdvisorId)and its functional dependencies: ID → {Name, FavoriteAdvisorI d} and AdvisorId → {AdvisorName} i. Does Students violate the BCNF? If yes, why? If no, why not? What is/are the candidate key(s) of Students?
Fig: 1
Fig: 2
Fig: 3
Fig: 4
Fig: 5
Fig: 6
Fig: 7
