Answer: None of The above
A | B | C | D | E | |
5 | 5 | 5 | 5 | 5 | |
5 | 5 | 5 | 5 | 4 | |
5 | 2 | 4 | 5 | 2 | |
4 | 1 | 4 | 5 | 5 | |
5 | 4 | 2 | 5 | 4 | |
4 | 1 | 2 | 4 | 2 | |
Option(1)
AE is NOT Key
Reason: AE --> BCD Not Exist
A | E | B | C | D |
5 | 5 | 5 | 5 | 5 |
5 | 4 | 5 | 5 | 5 |
5 | 2 | 2 | 4 | 5 |
4 | 5 | 1 | 4 | 5 |
5 | 4 | 4 | 2 | 5 |
4 | 2 | 1 | 2 | 4 |
Option(2)
BC
BC is NOT Key
Reason: BC --> DEA Not Exist
B | C | D | E | A | |
5 | 5 | 5 | 5 | 5 | |
5 | 5 | 5 | 4 | 5 | |
2 | 4 | 5 | 2 | 5 | |
1 | 4 | 5 | 5 | 4 | |
4 | 2 | 5 | 4 | 5 | |
1 | 2 | 4 | 2 | 4 | |
Option(3)
BD
BD is NOT Key
Reason: BD --> AEC Not Exist
A | B | D | E | C |
5 | 5 | 5 | 5 | 5 |
5 | 5 | 5 | 4 | 5 |
5 | 2 | 5 | 2 | 4 |
4 | 1 | 5 | 5 | 4 |
5 | 4 | 5 | 4 | 2 |
4 | 1 | 4 | 2 | 2 |
Option(4)
CD
CD is NOT Key
Reason: CD --> ABE Not Exist
A | B | C | D | E | |
5 | 5 | 5 | 5 | 5 | |
5 | 5 | 5 | 5 | 4 | |
5 | 2 | 4 | 5 | 2 | |
4 | 1 | 4 | 5 | 5 | |
5 | 4 | 2 | 5 | 4 | |
4 | 1 | 2 | 4 | 2 | |
Consider an instance of relation R below 20 A B С D E 5 5 5 5 5 5 5 5 5 4 5 2 4 2 4 1 4 ي ي اي 5 5 5 4 2 4 4 1 4 2 N What would possibly be a candidate key of relation R? (2 Points) Select one: O AE BC BD CD All of the above. None of the above. O
R Consider an instance of relation R below A B C D E 5 5 5 5 5 5 5 LO bs 5 4 5 2 4 5 2 5 5 4 1 4 5 4 2 5 4 4 1 2 4 2 What would possibly be a candidate key of relation R? (2 Points) Select one: O AE BC BD CD All of the above. None of the above.
R Consider an instance of relation R below A B C D E 5 5 5 5 5 5 5 5 5 4 5 2 4 5 2 4 1 4 5 5 5 4 2. 5 4 4 1 2 4 2 What would possibly be a candidate key of relation R? (2 points) Select one: AE BC BD CD All of the above. None of the above.
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,...
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
15)Find the value of x, given DE¯¯¯¯¯¯¯¯∥BC¯¯¯¯¯¯¯¯, AD=x+33, BD=x+13, AE=18, and CE=10. Question 15 Find the value of , given DE || BC, AD = 7+33, BD = 1 + 13, AE = 18, and CE = 10. B D P с E a) O 12 b) 09 c) O 10 d) O 15 N e) None of the above
Given the following relation schemas and the sets of FD's: a- R(A,B,C,D) F={ABẠC,C7D, D´A, BC+C} b- R(A,B,C,D) F={BẠC, BD, AD>B} C- R(A,B,C,D) F={AB-C, DC+D, CD+A, AD+B} d- R(A,B,C,D) F={AB=C, C+D, D™B, DE} e- R(A, B, C, D, E) F= {AB+C, DB+E, AE>B, CD+A, ECD} In each case, (i) Give all candidate keys (ii) Indicate the BCNF violation Give the minimal cover and decompose R into a collection of relations that are BCNF. Is it lossless? Does it preserve the dependencies?...
5. For the following set of Fischer projections answer each of the questions below by circling the appropriate letter(s) or letter combination(s). Hint: Redraw the Fischer projections with the longest carbon chain in the vertical direction and having similar atoms in the top and bottom portion. Classify all chiral centers in the first structure as R or S absolute configuration. (X pts) a. Which are optically active? b. Which are meso? c. Which is not an isomer with the others?...
Let R(A,B,C,D) be a relation with FDs F = {A—B, AC, C-A, B,C, ABC-D} Which of the following statements is correct ? (2 points) Select one: G = {A-B, B-C, C-A, AC=D } is a canonical cover of F H = { AC, CA, BC,BD} is a canonical cover of F. o F is a canonical cover of itself. O G and H are canonical covers of F. None of the above.