Specialization is used for the subgrouping of entities in relationship sets.

Specialization have a bottom up manner approach in its relationship among entities.

For generalization there should be some common attribute among the entities.

Generalization maintains relationship among higher level entity set and one or more lower level entity sets.

None of the above

Generalization in relational database is like an abstraction approach.

In Aggregation, the entities are treat as higher level entities.

Aggregation also classify the entities further.

Specialization classify the distinct entities in the entity sets.

Both (1) and (3).

Aggeregation possess 'has a' relationship.

Composition approach determines that the member object can exists without the containing class.

Composition possess 'is a' relationship.

All of the above.

Both (1) and (3).

The 'Train' possesses a generalization approach.

'Passenger' train and 'Goods' train possesses a specialization approach.

The 'Train' also possess aggregation approach.

All of the above.

Both (1) and (2).

In 2nd NF, primary key contains multiple attributes.

In 3 NF, a relation is decomposed and set up a new relation for each partial key.

A functional dependency exists only when both constraints functionally dependent on each other.

All of the above.

Only (1) and (3).

The database system can apply the DML (Data Manipulation Language) operations on multiple rows simultaneously.

The application programs affect on account of any operation in the changes in the disk storage.

The application programs will remain unimpaired in case of data are physically centralized or distributed.

The integrity constraints can not be applied on application programs.

Both (2) and (4).

There may be loss of data possible while maintaining database.

There may be null value in the column while inserting records.

There may be inconsistency in the database possible while maintaining database.

All of the above.

Only (1) and (3).

BCNF is the higher version of third normal form (3NF).

A database design is in BCNF if each entity in the set constitute the design.

BCNF performs dependency preservation.

All of the above.

Both (2) and (3).

For 2NF, a table must be in 1NF.

The list of values can not be allowed in 2 NF.

There is a one to many relationship exists in 2 NF.

Every non-key is fully dependent on the primary key.

None of the above

One-to-many relationship should have a primary and foreign key in parent and child table.

In relational database, we can not change the value of primary key.

Primary key can also make up of several columns.

All of the above.

Only (1) and (2).

The non-additive property is very critical in relation database.

Dependency preservation ensures that each functional dependency is represented in individual relations after decomposition.

Dependency preservation is not a necessary process in relational database.

None of these

Two tables 'Product' and 'Orders'.

Two tables 'Product' and 'ProductDetails'.

Two tables 'Teachers' and 'Classes'.

All of the above.

Only (1) and (3).

First Normal Form (1 NF).

Second Normal Form (2 NF).

Third Normal Form (3 NF).

All of the above.

Only (2) and (3).

A column indexing makes the fast access for selecting the data.

A column indexing makes the DML (Data Manipulation Language) operations slow down.

More than one indexes are possible in a particular table.

Indexers can be applied on a part of a column.

None of the above

It affects the database optimization.

Due to update anomaly, we need to update thousands of rows in the table.

It makes database inconsistent.

All of the above.

Only (2) and (3).