The Gateway to Computer Science Excellence

+28 votes

Given the following two statements:

**S1:** Every table with two single-valued attributes is in 1NF, 2NF, 3NF and 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**?

- S1 is TRUE and S2 is FALSE.
- Both S1 and S2 are TRUE.
- S1 is FALSE and S2 is TRUE.
- Both S1 and S2 are FALSE.

0

Here in question they have mentioned that the table contains two single valued attributes. But the table to be in 1NF, the attributes should be atomic and single valued. So, can we conclude that S1 is TRUE ???

0

it is in BCNF form because both A and B are candidate keys ,uniquely defines table.Also there is no partial dependency and transitive dependencey

0

A | B |

1 | 2 |

1 | 3 |

2 | 2 |

So in above schema neither

A$\rightarrow$ B hold nor

B $\rightarrow$ A holds

Then how we can say this is in 1NF ?

0

@shivam kasat .....From above PDF

If a relation has only two attributes then it is in BCNF.

Proof: Let a, b be the two attributes in a relation R.

The possible functional dependencies are:

case 1: LHS contains both attributes

a b -> ---

clearly this is a trivial functional dependency because RHS attributes form subset of LHS attributes .

Case 2 : LHS contains only one attribute.

a->---

b->---

**clearly in this case, the LHS attribute will be candidate key **

how can you decide it is candidate key.......plz explain

+32 votes

Best answer

+16 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**

+15 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.

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.

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,737 questions

57,300 answers

198,296 comments

104,998 users