**INDUSTRY AND COMPANY AWARENESS (ICA)**

## MCQs

**Answer: Option A. ->**BCNF is stricter than 3 NF

Loss less, dependency “ preserving decomposition into BCNF is always possibleWe say that the decomposition is a lossless decomposition if there is no loss of information by replacing r (R) with two relation schemas r1(R1) andr2(R2).

**Answer: Option A. ->**First

FirstThe first normal form is used to eliminate the duplicate information.

**Answer: Option D. ->**Have a composite key

Have a composite keyThe relation in second normal form is also in first normal form and no partial dependencies on any column in primary key.

**Answer: Option A. ->**Eliminate all hidden dependencies

Eliminate all hidden dependenciesThe relation in second normal form is also in first normal form and no partial dependencies on any column in primary key.

**Answer: Option A. ->**Key

KeyKey is the basic element needed for the constraints.

**Answer: Option C. ->**Normalization

NormalizationNormalisation is the process of removing redundancy and unwanted data.

**Answer: Option B. ->**2 NF and hence also in 1 NF

2 NF and hence also in 1 NFThe relation in second normal form is also in first normal form and no partial dependencies on any column in primary key.

**Answer: Option C. ->**3NF

3NFThe first normal form is used to eliminate the duplicate information.

**Answer: Option C. ->**4NF

4NFA Table is in 4NF if and only if, for every one of its non-trivial multivalued dependencies X \twoheadrightarrow Y, X is a superkey”that is, X is either a candidate key or a superset thereof.

**Answer: Option C. ->**3NF

3NFThe table is in 3NF if every non-prime attribute of R is non-transitively dependent (i.e. directly dependent) on every superkey of R.