recategorized by
5,301 views
7 votes
7 votes

Consider the following table: $\text{Faculty(facName, dept, office, rank, dateHired)}$
 

facName dept office rank dateHired
Ravi Art A101 Professor 1975
Murali Math M201 Assistant 2000
Narayanan Art A101 Associate 1992
Lakshmi Math M201 Professor 1982
Mohan CSC C101 Professor 1980
Sreeni Math M203 Associate 1990
Tanuja CSC C101 Instructor 2001
Ganesh CSC C105 Associate 1995

(Assume that no faculty member within a single department has same name. Each faculty mimber has only one office identified in $office$).$3NF$ refers to third normal form and $BCNF$ refers to Boyee-Codd Normal Form

Then $Faculty$ is

  1. Not in 3NF,in BCNF
  2. In 3NF,not in BCNF
  3. In 3NF, in BCNF
  4. Not in 3NF, not in BCNF
recategorized by

4 Answers

Best answer
3 votes
3 votes
Answer is b.

facName->dept,office,rank,datehired.

office->dept.

Here in facName is primary key, so 3NF. But office is not a super key, so not in BCNF.
selected by
2 votes
2 votes

C

Regardless of what is given in official key,

 The only FD here is facName , dept-> office, rank, dateHired

facName, office → dept, rank, dateHired  is not an FD. Where in question does it say that FacName and office can together identify other attributes? It just says "Each faculty mimber has only one office identified in", two different faculty from two different departments with same facName can work in the same office. Just because in this instance of the relation we see office -> department FD does not mean such an FD exists for all instances.

Since there is only 1 FD which is the primary key, the relation is in 3NF and BCNF

1 votes
1 votes

Usually, we're given FDs and we have to find the Normalization level.

Here, we have to derive the FDs and then find the Normalization Level based on it.

For simplicity, I'm renaming the attributes as $A$, $B$, $C$, $D$, $E$

  • FDs are derived by schema, not by an instance of the table.

Let's derive FDs by Schema (Requirement Analysis)

Assume that no faculty member within a single department has same name.

$A,B\rightarrow A,B,C,D,E$ (A,B is Candidate Key)

Each faculty member has only one office identified in office

$A \rightarrow C$

So, Not even 2NF.

Option D


Now, let's derive FDs by Relation instance (which is wrong)

$A \rightarrow A,B,C,D,E$

$E \rightarrow A,B,C,D,E$

$C,D\rightarrow A,B,C,D,E$

$C\rightarrow B$ (violates BCNF)

$B,D\rightarrow A,B,C,D,E$

So, 3NF but not BCNF.

Option B


Option B is the official answer, though.

0 votes
0 votes
Ohkay, so as far as I've understood, some previous discussions above also helped me in deducing the solution, but I don't to what extent it is correct.

" Assume that no faculty member within a single department has same name"

So I guess, it says facName and dept. will give us unqiue tuples.

"Each faculty member has only one office identified in office"

So, this must also be similar to above condition i.e. facName and dept. together will give us unique tuples.

So now we have following functional dependencies:

Facname,dept--> office, rank, hireddate

Facname,office--> dept., rank, hireddate

So as per that CANDIDATE KEY: FacName, dept, office

So both the functional dependecies have prime attributes on LHS nad non prime attributes on RHS.

Hence, this should not even satisfy 2NF.

Pl. Correct ke if I'm wrong.
Answer:

Related questions

5 votes
5 votes
2 answers
2
gatecse asked Dec 17, 2017
2,779 views
Consider the following schema:$\text{Sailors(sid,sname,rating,age)}$$\text{Boats(bid,bname,colour)}$$\text{Reserves(sid,bid,day)}$Two boats can have the same name but the...
5 votes
5 votes
1 answer
4
gatecse asked Dec 17, 2017
4,356 views
Consider the schema$\text{Sailors(sid,sname,rating,age) with the following data}$$\begin{array}{|l|l|l|l|} \hline \textbf{sid} & \textbf{sname} & \textbf{rating} & \textb...