• edited by
23,782 views
65 65 votes

Consider the following functional dependencies in a database.$$\begin{array}{|l|l|}\hline \text{Date_of_Birth } \to \text{Age} & \text{Age } \to \text{Eligibility} \\\hline  \text{Name } \to \text{Roll_number} & \text{Roll_number }\to \text{Name} \\\hline   \text{Course_number }\to \text{Course_name} & \text{Course_number } \to\text{Instructor} \\\hline  \text{(Roll_number, Course_number) }\to\text{Grade} & \text{}  \\\hline \end{array}$$The relation (Roll_number, Name, Date_of_birth, Age) is

  1. in second normal form but not in third normal form
  2. in third normal form but not in BCNF
  3. in BCNF
  4. in none of the above

9 Answers

Best answer
100 100 votes

There are three FDs that are valid from the above set of FDs for the given relation :

  1. Date_of_Birth $\to$ Age
  2. Name $\to$ Roll_number
  3. Roll_number $\to$ Name


Candidate keys for the above are : (Date_of_Birth, Name) and (Date_of_Birth, Roll_number)

Clearly there is partial dependency here (Date_of_Birth $\to$ Age) and Age is not a prime attribute. So, it is in 1NF only.

Option (D).

• selected by
1 flag:
✌ Edit necessary (Ekalavyaa “DOB->Age is not a partial dependency it is actually full dependency either DOBName -> Age or DOB Roll# -> Age will become a partial dependency”)
7 7 votes

Here, Date of Birth which is a part of the candidate key derives a non-prime attribute, i.e. Part of CK --> Non-Prime attribute.

Therefore PARTIAL DEPENDENCY, not in 2NF.

0 0 votes

BEST ANSWER

FD Given

D ---> A

A ----> E

N ----> R

R ----> N

C -----> c

C ----> I

RC -----> G

Relation Given (RNDA)

Candidate keys for the above are : (D, N) and (D, R)       

And Non prime attributes are: A

In (Date_of_Birth → Age)

D is the proper subset of candidate key 

A is the non prime attribute 

2NF Voilation condition :    Proper subset of CK ----> Non prime          

so 2NF not holding 

if 2NF not holding then 3NF , BCNF ALSO NOT HOLD 

So it is satsfying 1NF 

Conidtion for 1NF ( ALL ATTRIBUTES ARE ATOMIC)

0 0 votes
in this the higher form possible in this 1 nf and in this partial dependency not allowed in the 2 nf  so it is not 2nf if the function not in 2 nf then it is also not a 3 nf hence not in 3 nf
0 0 votes
Answer option D (NONE OF THE ABOVE)

Given, relation(roll number,name,dob,age)

We will get only 3 FD
1 Dob->age
2 name->roll number
3 roll number -> name

From FD set we get (date of birth,name) or (date of birth,roll number) as candidate keys

Therefore date of birth, name, roll number are prime attributes and age is non prime attribute.

From FD set subset of prime attributes date of birth is infering non prime attribute age. Which is voilation of 2nf.

So ,Even 2nf fails. So 3nf and bcnf also fails.

Therefore answer option D
Answer:
Position:
Show:

Related questions

61 61 votes
5 answers 5 answers
14.8k
14.8k views
Kathleen asked Sep 17, 2014
14,779 views
A program consists of two modules executed sequentially. Let $f_1(t)$ and $f_2(t)$ respectively denote the probability density functions of time taken to execute the two ...
68 68 votes
11 answers 11 answers
21.2k
21.2k views
Kathleen asked Sep 17, 2014
21,205 views
Consider three data items $D1, D2,$ and $D3,$ and the following execution schedule of transactions $T1, T2,$ and $T3.$ In the diagram, $R(D)$ and $W(D)$ denote the action...
45 45 votes
8 answers 8 answers
19.3k
19.3k views
Kathleen asked Sep 17, 2014
19,303 views
Consider the following $2-3-4$ tree (i.e., B-tree with a minimum degree of two) in which each data item is a letter. The usual alphabetical ordering of letters is used in...
59 59 votes
6 answers 6 answers
15.9k
15.9k views
Kathleen asked Sep 16, 2014
15,896 views
Consider the following SQL querySelect distinct $a_1, a_2, …, a_n$from $r_1, r_2, …, r_m$where PFor an arbitrary predicate P, this query is equivalent to which of the fol...