A functional dependency of the form X → Y is trivial if
A function dependency of from X → Y is trivial when
In an entity relationship, y is the dominant entity and x is a subordinate entity. Which of the following is/are incorrect?
1. y is dominant entity.
2. x is subordinate entity..
Since, y is dominant entity. So does not depend on any other and x is subordinate. So x is existence dependent on y and deletion of x does not effect y, So, x is detected, so y is incorrect.
Relations produced from an ER model will always be in
Relations produced from ER model generally in 1NF form.
Let R be a relation. Which of the following com m ents about the relation R are correct?
1. R will necessarily have a composite key if R is in BCNF but not in 4NF.
2. If R is in 3NF and if every key of R is simple , then R is in BCNF.
3. If R is in BCNF and if R has at least one
4. If R is in 3NF and if its every key is simple, then R is in 5NF.
Consider the relation:
Employee (EmpNo, Empname, salary, project no, duedate)
(Assuming an 11 relationship between project and employees)
Projectno is functionally dependent on
The relation EMPLOYEE has one to one relation b/w project and employee i.e. each employee has being assigned a project and each project is associated with only one employee, hence project number is functionally dependent on Empno.
Let R ( a, b, c) and S (d, e, f) be two relations in which d is the foreign key of S that refers to the primary key of R. Consider the following four operations.
1. Insert into R
2. Insert into S
3. Delete from R
4. Delete from S
Which of the following is true about the referential integrity constraint about?
R (a, b, d, c) and S (e,f)
1. Insertion into R does not create any violation,
2. Insertion into S create violation.
3. Deletion in S does not create any violation.
4. Deletion in R can create violation.
Consider the following set of functional dependencies on the scheme (A, B, C).
A —> BC, B —> C, A —> B ,A B —> C
The canonical cover for this set is
For the relation (A, B, C)
A —> BC, B —> C, A —> B, AB —> C
The canonical cover is A —> BC and B —> C which is functionally determining all the FD’s represented in the relation and is minimally satisfying all the nontrivial relationships.
Which of the following statement is false?
BCNF relation may or may not preserve dependency also any relation cannot be necessarily decomposed into BCNF relation,
R(A, B, C, D) with FD’s
F(A →B, A →C, A → D) and R_{1} (A, B, D) with FD’s
F_{1}(A —> B, A → D) and R_{2}(B, C) with FD's
F_{2} = { }
Then find which statements is true:
Clearly we can see that B is the common attribute and B is not candidate key of any of the decomposed relations. Hence, dependency is not preserved.
R = (A, B, C, D, E, F)
R_{1}  (A, B)
R_{2} = (C,D,E)
R_{3} = (A, C, F)
F= {A→B; C → DE ; AC → F;}
Does the above FD’s has lossless join property?
R = {A, B, C, D, E, F}
F = {A → B , C → DE, AC → F)
R_{1} = ( A B )
R_{2} =.{C,D,E}
R_{3} = {A, C, F}
Convert b to a in 3^{rd} row convert b to a in 3^{rd} row. Since 3^{rd} row contains all ‘a’s hence the relation has lossless join property.
Which of the following list represents the MVDs (Mean Value Dependencies), satisfied by a relation R(A, B, C) that has the following tuples: (a1, b1, c1),(a1, b1, c2), (a2, b1, c1), (a2, b1,c3).
From the following instance of a relation schema R(A, B, C), we can conclude that:
From the given instance we can determine that
Consider the following declaration:
F: Set of functional dependencies
R: Relation of functional dependencies . R : (A, B, C, D, E)
F: (A —> BC: CD —> E; B —> D; E —> A)
Then candidate keys for R is ___________
R = (A, B, C, D, E)
F = (A →BC, C D → E, D,B → D, E→A)
A^{+} = ABCDE so A is the candidate key.
A can be replaced by E
So, E also a candidate key.
Scan be replaced by CD.
Hence, (A, E, C, D) are the candidate keys.
A given relation is known to be in third normal form. Select the statement which can be inferred from this
A relation is in 3NF if for X →A
(i) X is a super key or candidate key
(ii) A is a prime attribute.
Hence, for A to be nonkey attribute (nonprime attribute)
X must be satisfying (i)
A relation Empdtl is defined with attribute empcode (unique), name, street, city, state and pincode. For any pincode, there is only one city and state. Also, for any given street, city and state, there is just one pincode. in normalization terms, Empdtl is a relation in
Empdt 1 (empcode, name, street, city, state, pincode) given for any pincode there is only one city and state
i.e. pincode→ city state.
Also for any given street, city and state there is only one pincode.
i.e. city state street pincode. key for the relation is thus {empcode name pincode street} prime attributes = {empcode, name, pincode, street}
Now the FD’s
Use Code STAYHOME200 and get INR 200 additional OFF

Use Coupon Code 







