| 41. | State true or false: Functional dependencies are transitive |
|
Answer: (a).True
|
| 42. | If A→B, A→ C then which of the following is true? |
|
Answer: (d).All of the mentioned
|
| 43. | If B is an attribute and A→B, Then B is said to be ________ by a. |
|
Answer: (d).Functionally determined
|
| 44. | We say that a decomposition having the property F’+ = F+ is a __________ decomposition. |
|
Answer: (b).Dependency preserving
|
| 45. | A _________ Fc for F is a set of dependencies such that F logically implies all dependencies in Fc, and Fc logically implies all dependencies in F. |
|
Answer: (a).Canonical cover
|
| 46. | What does the BCNF decomposition algorithm do? |
|
Answer: (a).States a method to decompose a relation satisfying BCNF
|
| 47. | The 3NF decomposition algorithm is also called as _______ |
|
Answer: (b).3NF synthesis algorithm
|
| 48. | Which of the following is desirable in a database design with functional dependencies? |
|
Answer: (a).BCNF
|
| 49. | Which of the following is not a process of generating a good relational schema? |
|
Answer: (c).Joining multiple relations together to form a single relation containing all the attributes
|
| 50. | What is unique role assumption? |
|
Answer: (a).The attribute name has a unique meaning in the database
|
