edited by
8,041 views
23 votes
23 votes

Let $R (A, B, C, D, E, P, G)$ be a relational schema in which the following functional depen­dencies are known to hold: $AB \to CD, DE \to P, C \to E, P \to C$ and $B \to G.$ The relational schema $R$ is

  1. in $\text{BCNF}$
  2. in $\text{3NF}$, but not in $\text{BCNF}$
  3. in $\text{2NF}$, but not in $\text{3NF}$
  4. not in $\text{2NF}$
edited by

5 Answers

Best answer
46 votes
46 votes
Answer: $D$

Here $AB$ is the candidate key and $B \rightarrow G$ is a partial dependency. So, $R$ is not in $\text{2NF}$.
edited by
12 votes
12 votes

not in 2NF because here candidate key is AB and in FD's proper subset of C.K. determine the non prime attribute i.e. B→G



1 votes
1 votes
AB is key and G is non prime attribute which is partially dependent on B.

(Ans-D)
Answer:

Related questions

47 votes
47 votes
5 answers
2
52 votes
52 votes
5 answers
3
Ishrat Jahan asked Oct 29, 2014
18,071 views
Consider the following relational schema:$\text{Student} (\underline{\text{school-id}, \text{sch-roll-no}}, \text{sname}, \text{saddress})$$\text{School} (\underline{\tex...