Answer d) (1,2,0)
Explanation: In case of to avoid violation of FD A->B, then the new tuple must be of the form (0,0,w) or (x,y,z) where x !=0. Similarly, to avoid violating B->C, inserted new tuple must be of the form (w,0,0) or (x,y,z) where y!=0. Thus, we can say that new tuple must be either of the form (w,0,0) or of the form (x,y,z) where x!=0 and y!=0. So answer must be (1,2,0).
1. Relation R(A,B,C) currently has only the tuple (0,0,0), and it must always satisfy the functional...
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.
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,...
6. Let R(ABCDEFGH) satisfy the following functional dependencies А В.CH A, B E, BD C. EG H. DE F. Which of the following FD's is also guaranteed to be satisfied by R? a) BFG AE ich or the rollowing FD'S is also guaranteed to be satisned by b) CGH BF c) ACG DH d) ADG CH
5. [5 points] Let relation R (A, B, C, D, E) satisfy the following functional dependencies: AB → C BC → D CD → E DE → A AE → B Which one of the following FDs is also guaranteed to be satisfied by R? A. B. BCD → A A-B D. CE → B
[1] [30 points] Consider the relation R City, Street, Zip Code), where a tuple (c, s, z) is in R only if city c has a building with street s, and z is the zipcode for that address in that city. It is assumed that the nontrivial functional dependencies are: Street → Zip Code ZipCode → City City, [a] [b] [C] [d] [e] Determine all possible keys for R. Indicate all possible BCNF and 3NF violations. Decompose R as necessary...
Question 1: Functional Dependencies [7 marks Consider a relation R on attributes (A, B, C, D, E, F,G, H) and the following functional dependen- cies. B →G C →D DE →GC → EF DEF → H (a) What is the closure of [F, G, Hy? (b) List all of the candidate keys of R under the dependencies above. (c) List all of the FDs above that are 3NF violations (d) List all of the FDs above that are BCNF violations....
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) with the functional dependencies {AB → C, C → D, D → A}. Does BC → A hold on R? Explain. show steps.
5c. Consider the relation R(ABCDE) with the set of functional dependencies F={BE→D, DE→A, AD→C, B→E}. Using decomposition, find a lossless, dependency preserving, BCNF set of relations for R, if such exists. Be sure to identify the projections of the functional dependencies onto the resulting relations at each stage of the decomposition.
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.