Question

Consider a relation R with 5 attributes M, O, N, E, Y. You are given the...

Consider a relation R with 5 attributes M, O, N, E, Y. You are given the following dependencies: M-> N O -> M Y -> E NM ->Y Its candidate keys are {( O)}.

1. Which of the following is a prime attribute for the relation R? _________________

i.M

ii.E

ii.O

iv. All attributes of the relation R are prime attributes

2. Which of the following is true about the given functional dependencies in the relation R? ______________

i.M -> N is a Not So Bad FD

ii. Y -> E is a Very Good FD

iii.NM -> Y is a Not So Bad FD

iv. O -> M is a Very Good FD

3. Which of the following is the normal form of the relation R? _____________

i.First normal form

ii.Second normal form

iii.Boyce-Codd normal form

iv. Third normal form

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Consider a relation R with 5 attributes M, O, N, E, Y. You are given the following dependencies: M-> N O -> M Y -> E NM ->Y Its candidate keys are {( O)}.

1. Which of the following is a prime attribute for the relation R? _________________
Answer:-----------
iii). O,
because M, N, E, Y are non-prime attributes ( Because ,These are not part of candidate key).

2. Which of the following is true about the given functional dependencies in the relation R? ______________
Answer:-----------
iv. O
->M is a very good FD.

3. Which of the following is the normal form of the relation R? _____________
Answer:-----------
​​​​​​​ii). Second normal form, Because
M->N, Y →E and NM →Y dependencies are violating 3NF properties, These are transitivity dependencies(Transitivity dependencies means, non-prime attribute ---> non-prime attribute).

Add a comment
Know the answer?
Add Answer to:
Consider a relation R with 5 attributes M, O, N, E, Y. You are given the...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Consider the following FD set on a relation E with six attributes: F, R, I, D,...

    Consider the following FD set on a relation E with six attributes: F, R, I, D, A, and Y. YI FI D A F D R DR A Its candidate keys are [(YF), (YD), (YA)} Tasks: 1. List prime attributes and non-prime attributes for the relation E. Justify your answer. 2. Classify each functional dependence for the relation E. Justify your answer. 3. Determine the normal form of the relation E. Justify your answer. Consider the following FD set on...

  • Dependency Very Good dependency (key dependency) : XA where Table Very good If all dependencies i...

    Dependency Very Good dependency (key dependency) : XA where Table Very good If all dependencies in a table are '"very good", the table is in BCNF X is a candidate key Good Good dependency: X-> A where If all dependencies in a table are "very good" or "good", the table is in 3NF X is not a candidate key X is a part of a candidate key A is prime attribute Bad Bad dependency (Transitive Dependency): X A where If...

  • Consider a relation R(A,B,C,D,E) with the following functional dependencies: 8. AB C BCD CDE DEA (a) Specify all candidate keys for R. (b) Which of the given functional dependencies are Boyce-Codd No...

    Consider a relation R(A,B,C,D,E) with the following functional dependencies: 8. AB C BCD CDE DEA (a) Specify all candidate keys for R. (b) Which of the given functional dependencies are Boyce-Codd Normal Form (BCNF) violations'? (c) Give a decomposition of R into BCNF based on the given functional dependencies. (d) Give a different decomposition of R into BCNF based on the given functional dependencies. (e) Give a decomposition of R into 3NF based on the given functional dependencies. Consider a...

  • Consider a relation R(A,B,C,D,E) with the following functional dependencies: 8. AB C BCD CDE DEA (a)...

    Consider a relation R(A,B,C,D,E) with the following functional dependencies: 8. AB C BCD CDE DEA (a) Specify all candidate keys for R. (b) Which of the given functional dependencies are Boyce-Codd Normal Form (BCNF) violations'? (c) Give a decomposition of R into BCNF based on the given functional dependencies. (d) Give a different decomposition of R into BCNF based on the given functional dependencies. (e) Give a decomposition of R into 3NF based on the given functional dependencies.

  • Here's a relation (R), its attributes and its functional dependencies (F): R(A, B, C, D, E)...

    Here's a relation (R), its attributes and its functional dependencies (F): R(A, B, C, D, E) C D → B A → D D → C E → C What is the closure of AB ({AB}+)? What is the closure of F (F+)? [ set of closures for all LHS][each LHS on one line] What is the minimal set (cover) for F? Provide a key for relation R (a minimal set of attributes that can determine all attr.) Decompose the...

  • Consider a relation R with ve attributes A, B, C, D, and E. You are given...

    Consider a relation R with ve attributes A, B, C, D, and E. You are given the following functional dependencies: A->B, BC->E, and ED->A. (a) List all keys for R. (10 points) (b) Is R in BCNF? If it is, explain why. If is not, decompose it into a collection of BCNF relations. (20 points) (c) Is R in 3NF? If it is, explain why. If it is not, convert it into a collection of 3NF relations. (20 points)

  • Consider a relation R with five attributes A, B, C, D, and E. You are given...

    Consider a relation R with five attributes A, B, C, D, and E. You are given the following functional dependencies: A → B, BC→E, and ED→A. (a) Is R in BCNF? If it is not, decompose it into a collection of BCNF relations. 2: BCNF and 3NF (3 points) Consider the relation schema R with attributes A, B, C, and D and the following functional dependencies: AB→C, AC→B, B→D, BC→A. (a) Is R in BCNF? If it is not, decompose...

  • Language: SQL - Normalization and Functional Dependencies Part 4 Normalization and Functional Dependencies Consider the following relation R(A, B, C, D)and functional dependencies F that hold o...

    Language: SQL - Normalization and Functional Dependencies Part 4 Normalization and Functional Dependencies Consider the following relation R(A, B, C, D)and functional dependencies F that hold over this relation. F=D → C, A B,A-C Question 4.1 (3 Points) Determine all candidate keys of R Question 4.2 (4 Points) Compute the attribute cover of X-(C, B) according to F Question 43 (5 Points) Compute the canonical cover of F.Show each step of the generation according to the algorithm shown in class....

  • We have the attributes: {A, B, C, D, E, F, G}. Consider the following functional dependencies...

    We have the attributes: {A, B, C, D, E, F, G}. Consider the following functional dependencies F → C, D E → B B, D, G → C G → B, D B, G → D, E F → E B, E → A, F F, G → C, D The minimal keys are: {G} Determine whether these functional dependencies are in the following normal form(s): Third Normal form or Boyce Codd normal form

  • Answer the following questions: Consider the relation schema R = (N. Y, P. M. and assume...

    Answer the following questions: Consider the relation schema R = (N. Y, P. M. and assume that the following set of functional dependencies holds on R: The letters can be interpreted as follows: R=(Model_Number. Year, Price, Manufacturing Plant Color). 1. [25 points] Give a lossless.join decomposition of Rinto Boyce-Codd normal form. Make sure to use the algorithm studied in class (Figure 7.11, page 331 of the book) and to show all details. 2. [25 points] Does your decomposition preserve functional dependencies? Justify your...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT