1. A key in a relational database table

a. a proper subset of a candidate key.

b. a proper superset of a candidate key.

c. a minimal superkey.

d. none of a., b., or c. are correct

2. If a relational database table is in Boyce-Codd normal form, it is also in

a. the first normal form.

b. the second normal form.

c. the third normal form.

d. all of a., b., and c.

3. _____________________ guarantee(s) that the number of index block accesses is equal to the level of the index structures.

a. Multilevel index

b. Dynamic hashing

c. B-tree/B+-tree

d. Multi-Way search tree