1. A functional dependency f on R is _______ by a set of functional dependencies F on r if every instance of r(R) that satisfies f also satisfies F.

a) Logically Defined

b) Logically Derived

c) Logically implied

d) None of the mentioned

### View Answer

2. If F is a set of functional dependencies, then the closure of F is denoted by?

a) F*

b) Fo

c) F+

d) F

### View Answer

3. If a functional dependency is reflexive, B is a subset of A and A is the set of attributes, then

a) B→A holds

b) A→B holds

c) AB→C holds

d) None of the mentioned

### View Answer

4. State true or false: Armstrong’s axioms allow us to generate all F+ for any given F

a) True

b) False

### View Answer

5. Armstrong axioms are called sound because?

a) They are expensive

b) They cannot generate correct functional dependencies

c) They allow us to generate the complete closure

d) They cannot generate incorrect functional dependencies

### View Answer

6. State true or false: Functional dependencies are transitive

a) True

b) False

### View Answer

7. If A→B, A→ C then which of the following is true?

a) A→BC

b) A→B

c) A→C

d) All of the mentioned

### View Answer

8. If B is an attribute and A→B, Then B is said to be ________ by a.

a) Logically implied

b) Functionally implied

c) Logically determined

d) Functionally determined

### View Answer

9. We say that a decomposition having the property F’+ = F+ is a __________ decomposition.

a) Dependency losing

b) Dependency preserving

c) Lossless

d) None of the mentioned

### View Answer

10. 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.

a) Canonical cover

b) Complete cover

c) Canonical dependency

d) Canonical clause