300 views
1 votes
1 votes
Mark all the correct statements given below
  1. Number of super keys of any relation cannot be more than twice the number of candidate keys
  2. The candidate key with the smallest number of attributes is chosen as the primary key
  3. A prime attribute must be part of all the candidate keys
  4. A prime attribute must be part of some candidate key

1 Answer

Best answer
1 votes
1 votes
Option A is false. Consider a relation with $3$ attributes where only one is the candidate key. By choosing from any subset of the remaining $2$ attributes including empty set we get $2^2 = 4$ super keys.

Option B is false as any of the candidate key can be chosen as the primary key without any special requirement.

By definition a prime attribute is any attribute part of "some" candidate key. So, option C is false and D is true.

Correct option: D.
selected by
Answer:

Related questions

4 votes
4 votes
1 answer
2
gatecse asked Oct 8, 2020
365 views
From the following instance of a relation schema $R(A,B,C)$, we can conclude that:(Mark all the appropriate options)$$\begin{array}{|l|l|l|}\hline \textbf{A} & \textbf{B}...
1 votes
1 votes
1 answer
3
gatecse asked Oct 8, 2020
161 views
Given the following relation instance.$$\begin{array}{|l|l|l|}\hline \text{X} & \text{Y} & \text{Z} \\\hline \text{1} & \text{0} & \text{5} \\\text{2} & \text{1} & \text{...
2 votes
2 votes
2 answers
4