GATE & PSUs - Computer Science & Information Technology (CS & IT)

Functional Dependencies & Normalization (1NF, 2NF, 3NF, BCNF) question bank (Database Management Systems (DBMS))

Practice 6 free GATE & PSUs - Computer Science & Information Technology (CS & IT) Database Management Systems (DBMS) - Functional Dependencies & Normalization (1NF, 2NF, 3NF, BCNF) questions with answers and step-by-step solutions.

Start free Book a demo

All Hard Medium

Q1.

[Functional Dependencies & Normalization (1NF, 2NF, 3NF, BCNF) Concept 3] A relation $R(A, B, C, D, E)$ has functional dependencies $F = \{ A \to B,\; BC \to D,\; D \to E,\; E \to A \}$. What is the candidate key and highest normal form of $R$?

(A)

Candidate keys are $\{AC, BC, DC, EC\}$; Highest normal form is 3NF

(B)

Candidate key is $\{A\}$; Highest normal form is BCNF

(C)

Candidate keys are $\{A, B, C\}$; Highest normal form is 2NF

(D)

Candidate key is $\{AC\}$; Highest normal form is 1NF

Show answer & solution

Verified Answer & Solution Locked

Q2.

[Functional Dependencies & Normalization (1NF, 2NF, 3NF, BCNF) Concept 9] A relation $R(A, B, C, D, E)$ has functional dependencies $F = \{ A \to B,\; BC \to D,\; D \to E,\; E \to A \}$. What is the candidate key and highest normal form of $R$?

(A)

Candidate keys are $\{AC, BC, DC, EC\}$; Highest normal form is 3NF

(B)

Candidate key is $\{A\}$; Highest normal form is BCNF

(C)

Candidate keys are $\{A, B, C\}$; Highest normal form is 2NF

(D)

Candidate key is $\{AC\}$; Highest normal form is 1NF

Show answer & solution

Verified Answer & Solution Locked

Protected Questions

Unlock All 6 Questions in Functional Dependencies & Normalization (1NF, 2NF, 3NF, BCNF)

Log in or sign up free to access every question with complete solutions, create chapter practice tests, and track your performance.

Sign up free to access all 6 questions

Unlock every Functional Dependencies & Normalization (1NF, 2NF, 3NF, BCNF) question, generate papers, and practice at your own pace.

Start free