6. A serializable schedule A) Has its transactions executed one after another B) Is equivalent to a serial schedule C) Can have a dirty read anomaly D) Cannot be implemented in real life 7. An instance of a relation is A) A set of attributes B) A set of tuples at a given time C) A set of tables D) An object 8. If F is the set of given FDs, F is A) A set B) A relation C) A functional dependency D) A cartesian product 9. The following is not a true FD property A) If X Y then XZ YZ B) If X YZ then X-+ Y and X Z C) If XYZ then X+Z and Y+ Z D) If X Y and X Z then X YZ (S) .z(T) th 10. If R(XYZ) can be decomposed into S(XY) and T(XZ) such that R A) R is in 3rd normal form B) The decomposition is lossy C) R is in BCNF D) The decomposition is lossless 11. In the relational model: A) Concurrent transactions do not interact B) Every component is atomic C) Atomicity must be enforced D) Tuples in any instance are unique