If a table is normalized so that all its determinants are candidate keys then, the table is in-
- A.1NF
- B.2NF
- C.3NF
- D.BCNF
Show answer
Answer: D. BCNF
BCNF requires every determinant to be a candidate key.
Related questions
- Which of the following symbol table implementation is best suited if access time is to be minimum?
- A binary search tree is constructed by inserting the numbers, 60 25 72 15 30 68 13 18 in order. The number of nodes in the left sub tree is-
- A critical section is a program segment-
- A collection of objects that use common structure and a common behavior is known as-
- Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?