edited by
18,377 views
44 votes
44 votes

The relation scheme $\text{Student Performance (name, courseNo, rollNo, grade)}$ has the following functional dependencies:

  • name, courseNo, $\rightarrow$ grade
  • rollNo, courseNo $\rightarrow$ grade
  • name $\rightarrow$ rollNo
  • rollNo $\rightarrow$ name

The highest normal form of this relation scheme is

  1. $\text{2NF}$
  2. $\text{3NF}$
  3. $\text{BCNF}$
  4. $\text{4NF}$
edited by

5 Answers

–1 votes
–1 votes
1 st 2 FD's satisfy BCNF ... other 2 is in 3 NF but not in BCNF
So the highest normal form of the schema is 3 NF
Answer:

Related questions

26 votes
26 votes
2 answers
2
Kathleen asked Sep 18, 2014
11,348 views
The order of an internal node in a $B+$ tree index is the maximum number of children it can have. Suppose that a child pointer takes $6$ bytes, the search field value tak...