Let R(A,B,C,D,E) be a relation with FDs F = {AB-C, CD-E, E–B} (2 Points) Select one:...

Question

Question

Answer 1

Answer #1

Answer: The correct answer is R is in 3NF but not in BCNF

First find candidate key of the relation:

ADB + = ADBCE

ADC+ = ADCEB

ADE+ = ADEBC

ADB , ADCand ADE are candidate key.

Condition for 3NF: Let say a functional dependency X -> Y

A relation is said to be in 3NF if X is a super key or Y is a prime attribute.

AB -> C # C is prime attribute

CD -> E # E is prime attribute

E -> B # B is a prime attribute

So above relation is in 3NF

Condition for BCNF: Let say a function dependency X -> Y

A relation is said to be in BCNF iff X is super key.

AB -> C # AB is not a superkey so this relation is not in BCNF

So this relation is not in BCNF

Answer 2

Similar Homework Help Questions

Let R(A, B, C, D, E) be a relation wit FDs F = {AB->C, CD->E, E->B,...

Let R(A, B, C, D, E) be a relation wit FDs F = {AB->C, CD->E, E->B, CE->A}.... Question 4 Not yet answered Marked out of 2.00 P Flag question Let R(A,B,C,D,E) be a relation with FDs F = {AB-C, CD-E, E-B, CE-A} Consider an instance of this relation that only contains the tuple (1, 1, 2, 2, 3). Which of the following tuples can be inserted into this relation without violating the FD's? (2 points) Select one: 0 (0, 1,...
Let R(A,B,C,D,E) be a relation with FDs F = {AB-CD, A-E, C-D, DE} The decomposition of...

Let R(A,B,C,D,E) be a relation with FDs F = {AB-CD, A-E, C-D, DE} The decomposition of R into R1(A, B, C), R2(B, C, D) and R3(C, D, E) is (2 Points) Select one: Lossy and Dependency Preserving. Lossless and Not Dependency Preserving. Lossy and Not Dependency Preserving. Lossless and Dependency Preserving.
Let R(A,B,C,D,E) be a relation with FDs F = {AB-CD, A-E, C-D, D-E} The decomposition of...

Let R(A,B,C,D,E) be a relation with FDs F = {AB-CD, A-E, C-D, D-E} The decomposition of Rinto R1(A, B, C), R2(B, C, D) and R3(C, D, E) is 2 Points) Select one: Lossless and Dependency Preserving. Lossy and Not Dependency Preserving. Lossless and Not Dependency Preserving. Lossy and Dependency Preserving.

Let R(A,B,C,D,E) be a relation with FDs F = {AB-CD, A-E, C-D, D-E} The decomposition of...

Let R(A,B,C,D,E) be a relation with FDs F = {AB-CD, A-E, C-D, D-E} The decomposition of Rinto R1(A, B, C), R2(B, C, D) and R3(C, D, E) is 2 Points) Select one: Lossless and Dependency Preserving. Lossy and Not Dependency Preserving. Lossless and Not Dependency Preserving. Lossy and Dependency Preserving.
Let R(A,B,C,D,E) be a relation with FDs F = {AB-C, CD-E, E-B, CE-A} Consider an instance...

Let R(A,B,C,D,E) be a relation with FDs F = {AB-C, CD-E, E-B, CE-A} Consider an instance of this relation that only contains the tuple (1, 1, 2, 2, 3). Which of the following tuples can be inserted into this relation without violating the FD's? (2 points) Select one: O (0, 1, 2, 4,3) (1,1,2,2,4) (1.2.2, 2, 3) o (1,1,3,2,3) All of the above can be inserted. None of the above can be inserted.
This question is from the subject: Database Systems QUESTION 8 Consider the relation R(A,B,C,D,E,F) with FDs...

This question is from the subject: Database Systems QUESTION 8 Consider the relation R(A,B,C,D,E,F) with FDs A -> C,B->D, C-> E, D -> F. Consider the BCNF status of R. Which of the following could be correct given the information above? 1. Ris in BCNF already. 2. Ris not in BCNF. It must be divided into R1(A,C,E) with FDs A->C, C-> E, and R2(B,D,F) with FDs B -> D, D -> F. 3. R is not in BCNF. It must...

my choices for these are wrong. 10 points QUESTION 3 Given R=(A, B, C) is a...

my choices for these are wrong. 10 points QUESTION 3 Given R=(A, B, C) is a schema and F = {2C-A AB) is a set of FDs that hold on R. Which of the following statements is not true? d=(AB. AC) is a decomposition of that is in BCNF. O Ris in 3NF O BC is a candidate key for R Ris in BCN 10 points QUESTION 4 Given R= (A. 3. CD. E) is a schema and F= (A...
For the following relations and set of FDs: 1. give a key for the relation; 2....

For the following relations and set of FDs: 1. give a key for the relation; 2. state whether the relation is in BCNF, and if it is not state why: 3. give a set of relations in 3NF equivalent to the original relation 1. (33 points) What is the closure of (A,B) with respect to R(A,B,C,D,E,F,G)if R has the following functional dependencies? (a) GCDE AF BF - ABC FC G (b) D-AC-D A+B ABC 2 33 points for each of...
4. (4 points) Consider the relation RCA, B, C, D, E) with the set of FDs:...

4. (4 points) Consider the relation RCA, B, C, D, E) with the set of FDs: F ABE, CD-E 4-+ C, C-+?). Decompose R into BCNF. Write and explain all steps in your decomposition.

Let R(A, B, C, D) be a relation with FDs F= {A->B, A->C, C->A, B->C, ABC->D}...

Let R(A, B, C, D) be a relation with FDs F= {A->B, A->C, C->A, B->C, ABC->D} which of the statement is correct? Question 2 Not yet answered Marked out of 2.00 P Flag question Let R(A,B,C,D) be a relation with FDs F = {AL-B, AC, CA, B-C, ABC-D} Which of the following statements is correct ? (2 Points) Select one: O G = {A--B, BC, C-A, AC-D} is a canonical cover of F OH = {A-C, C+A, B-C, B-D} is...