Database Normalization #7 – HackerRank Solution

In this post, we will solve Database Normalization #7 HackerRank Solution. This problem (Database Normalization #7) is a part of HackerRank Databases series.

Task

Let us take the example of a simple movie library. Each movie has a description, director, and serial number. Customers have a name, address, and membership number. Assume only one copy of each movie exists in the library. We are given the following relations and determinants:

Relations:
movie(DESCRIPTION,serialno)
serial(SERIALNO,director)
customer(name,addr,MEMBERNO)
borrow(memberno,DATE,SERIALNO)

Determinants:
description->director,serialno
serialno->description
serialno->director
name,addr -> memberno
memberno -> name,addr
serialno,date -> memberno

The above relation is in x**NF form where x may take the following values {1,2,3,3.5} corresponding to {1NF, 2NF, 3NF and BCNF} respectively.
What is the maximum possible value of **x such that the above relation satisfies the *x*NF form?
Your answer should only be restricted to one of these numbers:1/2/3/3.5 Do not leave any leading or trailing spaces.

Solution – Database Normalization #7 – HackerRank Solution

3.5

Note: This problem (Database Normalization #7) is generated by HackerRank but the solution is provided by CodingBroz. This tutorial is only for Educational and Learning purpose.