edited by
12,632 views
43 votes
43 votes

Given the following two statements: 

S1: Every table with two single-valued attributes is in $\text{1NF, 2NF, 3NF}$ and $\text{BCNF}.$ 

S2: $AB \to C, D \to E, E \to C$ is a minimal cover for the set of functional dependencies $AB \to C, D \to E, AB \to E, E \to C$.

Which one of the following is CORRECT?

  1. S1 is TRUE and S2 is FALSE.
  2. Both S1 and S2 are TRUE.
  3. S1 is FALSE and S2 is TRUE.
  4. Both S1 and S2 are FALSE.
edited by

4 Answers

Best answer
48 votes
48 votes

(A) S1 is TRUE and S2 is FALSE.

A relation with $2$ attributes is always in BCNF

The two sets of functional dependencies are not the same. We can not derive $AB \to E$ from the $1^{\text{st}}$ set.

edited by
31 votes
31 votes

S1 is true bcoz if there are only 2 attributes then relation is always in bcnf.

let R(A B) possible cases are:

(1) {A->B } here A is cand key so BCNF

(2) {B->A}  here B is cand key so BCNF

(3) { A->B  B->A} here A and B both are cand key so BCNF

​​​​​​​(4) no non-trivial FD's here AB is cand key so BCNF

S2 is false bcoz minimal cover should be { D->E , AB->E , E->C }

so ans is A

18 votes
18 votes
Table with 2 single valued attributes will be in 1NF,

2NF because there can not be a partial key dependencies. Key can be 1 attribute or 2 attributes. If one is key then other can be dependent, if 2 attributes make key then it is trivial.

3NF, there is no question of Transitive dependencies.

BCNF, because if at all a dependency exists, the determinant will be a Key.
Answer:

Related questions

8.6k
views
4 answers
37 votes
go_editor asked Sep 26, 2014
8,606 views
Consider the relation scheme $R = (E, F, G, H, I, J, K, L, M, N)$ and the set of functional dependencies $$\left\{ \{E, F \} \to \{G\}, \{F\} \to \{I, J\}, \{E, H\} \to \...
14.8k
views
4 answers
49 votes
go_editor asked Sep 28, 2014
14,837 views
Given the following schema: employees(emp-id, first-name, last-name, hire-date, dept-id, salary) departments(dept-id, dept-name, manager-id, location-id)You wan...
8.9k
views
3 answers
25 votes
go_editor asked Sep 26, 2014
8,926 views
Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x, denoted by $r(x)$ and $w(x)$ respectiv...
23.9k
views
3 answers
73 votes
go_editor asked Sep 26, 2014
23,911 views
Given the following statements: S1: A foreign key declaration can always be replaced by an equivalent check assertion in SQL. S2: Given the table $R(a,b,c)$ where $a$ an...