Register

ISRO-2013-25

6,549 views
8 votes
8 votes

Consider the following dependencies and the BOOK table in a relational database design. Determine the normal form of the given relation.

ISBN $\rightarrow$ Title

ISBN $\rightarrow$ Publisher

Publisher $\rightarrow$ Address

  1. First Normal Form
  2. Second Normal Form
  3. Third Normal Form
  4. BCNF
User Avatar

1 Answer

Best answer
12 votes
12 votes
The relation is in second normal form .

We first need to find Candidate key by taking closure of attributes = ISBN

Now with ER modelling we get relation in 1 NF .

for 2nf , we shouldnt have any partial dependency ( A non key shouldnt be fully functionally dependent on a subset of Ck )

Since our Ck is 1 attribute only we wont have that partial dependency

But now for 3nf , if you see we have Address which is transitively dependent on ISBN . Hence Transitive dependency exists .

So relation is in 2nf and not in 3nf
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

8 votes
8 votes
5 answers
1
makhdoom ghaya asked May 2, 2016
7,385 views
ISRO-2013-61, ISRO2008-35
Embedded pointer provides A secondary access path A physical record key An inverted index A primary key
Embedded pointer providesA secondary access pathA physical record keyAn inverted indexA primary key
User Avatar
8 votes
8 votes
2 answers
2
makhdoom ghaya asked Apr 27, 2016
5,421 views
ISRO-2013-27
The physical location of a record determined by a formula that transforms a file key into a record location is Hashed file $B$-Tree file Indexed file Sequential file
The physical location of a record determined by a formula that transforms a file key into a record location isHashed file$B$-Tree fileIndexed fileSequential file
User Avatar
8 votes
8 votes
2 answers
3
makhdoom ghaya asked Apr 27, 2016
8,355 views
ISRO-2013-26
Calculate the order of leaf ($P_{leaf}$) and non leaf (P) nodes of a $B^{+}$ tree based on the information given below. Search key field = $12$ field Record pointer = $10$ bytes Block pointer = $8$ bytes Block size = $1$KB $P_{leaf}$ = 51 & p = 46 $P_{leaf}$ = 47 & p = 52 $P_{leaf}$ = 46 & p = 51 $P_{leaf}$ = 52 & p = 47
Calculate the order of leaf ($P_{leaf}$) and non leaf (P) nodes of a $B^{+}$ tree based on the information given below.Search key field = $12$ fieldRecord pointer = $10$ ...
User Avatar
Link Copied!