adplus-dvertising
frame-decoration

Question

State true or false: If a relation consists of a foreign key, then it is called a referenced relation of the foreign key dependency.

a.

True

b.

False

c.

May be

d.

Can't say

Posted under RDBMS DBMS

Answer: (b).False

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. State true or false: If a relation consists of a foreign key, then it is called a referenced relation of the foreign key dependency.

Similar Questions

Discover Related MCQs

Q. Which of the following is not a feature of a good relational design?

Q. The dependency rules specified by the database designer are known as _______

Q. If the decomposition is unable to represent certain important facts about the relation, then such a decomposition is called as?

Q. If the decomposition is able to represent all the facts about the relation then such a decomposition is called as?

Q. A domain whose elements are indivisible is called as ______

Q. If all the domains are atomic then the relational schema is in ________ normal form

Q. State true or false: Composite attributes have non-atomic domains.

Q. State true or false: Redundancy is desired in a relational schema

Q. An instance of a relation that satisfies all real world constraints is known as?

Q. If K → R then K is said to be the _______ of R

Q. X → Y holds on a schema k(K) if?

Q. X→ Y is trivial if?

Q. Which of the following is not a condition for X→ Y in Boyce codd normal form?

Q. Which of the following is used to express database consistency?

Q. Which of the following is not a condition for the third normal form in the case of X→Y?

Q. F+ is called as the ________ of F

Q. State true or false: A functional dependency must first satisfy the second normal form to satisfy the third normal form.

Q. State true or false: The fourth normal form does not exist and it is instead called as the BCNF.

Q. A functional dependency f on R is _______ by a set of functional dependencies F on r if every instance of r(R) that satisfies f also satisfies F.

Q. If F is a set of functional dependencies, then the closure of F is denoted by?