Assertion. Both WHERE and HAVING clauses work with GROUP BY in a SELECT statement.

Reason. The WHERE clause is applied before forming groups of rows and HAVING clause is applied after forming the groups.

1. Both A and R are true and R is the correct explanation of A.
2. Both A and R are true but R is not the correct explanation of A.
3. A is true but R is false.
4. A is false but R is true.

Assertion. Both WHERE and HAVING clauses are used for specifying conditions.

Reason. The WHERE condition is applicable on individual rows and HAVING condition is applicable on a group of rows.

1. Both A and R are true and R is the correct explanation of A.
2. Both A and R are true but R is not the correct explanation of A.
3. A is true but R is false.
4. A is false but R is true.

Assertion. Cartesian product and joins are related.

Reason. Cartesian product is a join without any condition.

1. Both A and R are true and R is the correct explanation of A.
2. Both A and R are true but R is not the correct explanation of A.
3. A is true but R is false.
4. A is false but R is true.

Assertion. The cardinality of a cartesian product can be predetermined, unlike joins.

Reason. The cardinality of a cartesian product is cardinality of table 1 x cardinality of table 2.

1. Both A and R are true and R is the correct explanation of A.
2. Both A and R are true but R is not the correct explanation of A.
3. A is true but R is false.
4. A is false but R is true.

Assertion. There must be some identical columns in tables in order to get cartesian product.

Reason. The cartesian product returns all possible combinations of rows from the participating tables.

1. Both A and R are true and R is the correct explanation of A.
2. Both A and R are true but R is not the correct explanation of A.
3. A is true but R is false.
4. A is false but R is true.

Assertion. The join in which columns are compared for equality, is called an Equi-join.

Reason. The join condition can only compare columns with equal sign.

1. Both A and R are true and R is the correct explanation of A.
2. Both A and R are true but R is not the correct explanation of A.
3. A is true but R is false.
4. A is false but R is true.

Assertion. The join, in which columns are compared for equality, is called an Equi-join.

Reason. In non-equi joins, the columns are compared with non-equality conditional operators.

1. Both A and R are true and R is the correct explanation of A.
2. Both A and R are true but R is not the correct explanation of A.
3. A is true but R is false.
4. A is false but R is true.

Assertion. There can be joins where all records from one of tables appear irrespective of their matching rows in the other table.

Reason. In LEFT JOIN, all rows from the left table appear in the result along with matching rows from the right table and NULL for the non-matching rows ; and same for the RIGHT JOIN where all rows came from the right table appear, along with only matching rows from the left table.

1. Both A and R are true and R is the correct explanation of A.
2. Both A and R are true but R is not the correct explanation of A.
3. A is true but R is false.
4. A is false but R is true.

Assertion. The UNION clause combines the rows of the participating tables, removing the duplicate rows.

Reason. To retain the duplicate rows in a UNION query, UNION ALL is used.

1. Both A and R are true and R is the correct explanation of A.
2. Both A and R are true but R is not the correct explanation of A.
3. A is true but R is false.
4. A is false but R is true.

Assertion. The MINUS and INTERSECT operators are similar.

Reason. The MINUS operator returns only the rows from the first result set while INTERSECT returns the common rows of both the result sets.

1. Both A and R are true and R is the correct explanation of A.
2. Both A and R are true but R is not the correct explanation of A.
3. A is true but R is false.
4. A is false but R is true.