Computer Sciences > Gate 2022 > 1

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

In a relational data model, which one of the following statements is TRUE?

A

A relation with only two attributes is always in BCNF.

B

If all attributes of a relation are prime attributes, then the relation is in BCNF.

C

Every relation has at least one non-prime attribute.

D

BCNF decompositions preserve functional dependencies.

Check Answer

Explanation

Correct : a

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science