Design Of Database System Course
1. Given the relation R(A,B,C,D,E) with {A->B, B->C, C->A, E->D}. Select attribute(s) below that are prime attributes.
A |
||
B |
||
C |
||
D |
||
E |
The prime attribute is A. Because prime attribute are always unique and relation in data is unique. For example given attribute is (name, Id, Price). Here,name and price can be common. But, Id is unique. So, the prime attribute is id.
Design Of Database System Course 1. Given the relation R(A,B,C,D,E) with {A->B, B->C, C->A, E->D}. Select...
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...
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 the relation R with attributes: A, B, C, D, E, and F Let S be a set of functional dependencies in R such that S = { A-> B, CD-> E, C-> D]. Which of these attributes are in the closure of [C, F)?
Consider the following relation: R(A,B,C,D,E) The following set of functional dependencies are ture on the relation R: FD: AB -> E, E -> D, AD -> C Which of the following sets of attributes does not functionally determine C? AC ABE BD AE AB
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...
Given relation R(A, B, C, D, E, F), give (i) the key(s) of R and (ii) the normal form of R if the FDs are: (d) AB -> C, CD -> EF (e) AB -> CD, D -> EF, C -> AB. (f) ABC -> D, ABC -> E, ABC -> F.
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...
Question 3. Given the relation Ron A = {a,b,c,d,e) by the pairs R = {(a,b), (cb), (b, d), (e,d)} (a) (2 MARKS) Display the transitive closure R+ of R as a set of pairs. (b) (1 MARK) Explain why R+ is an order. Caution: An order has two defining properties. (c) (2 MARKS) Display the Hasse diagram of the order R+ (d) (1 MARK) Display the set of minimal members of R+.
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-C, CD-E, E–B} (2 Points) Select one: O Ris in 3NF but not in BCNF. O Ris not in 3NF but in BCNF. O Ris in 3NF and in BCNF. R is not in 3NF and not in BCNF.