6/26/2021 Relational Algebra - Google Forms

Relational Algebra

Questions Responses 52 Total points: 5

Relational Algebra - II
Form description

This form is automatically collecting emails for Anil Neerukonda Institute of Technology & Sciences
users. Change settings

Relational Algebra is *

Data Definition Language

Meta Language

Procedural Language

Non-procedural Language

Consider the join of a relation R with a relation S. If R has 'm' tuples and S has 'n' tuples, then the *
maximum and minimum number of tuples in the join will be

https://docs.google.com/forms/d/10GhGJpXcNeE6Qo7waUbATxPmDT8V0WqL9fh5Qv256pw/edit 1/3
6/26/2021 Relational Algebra - Google Forms

(m+n) and 0

(m+n) and (m-n)

(mn) and 0

(mn) and (m+n)

Let R and S be two relations. The intersection operation (R ∩ S) can be represented using basic *
operations as

R-S

R - (R - S)

S - (R - S)

R - (S - R)

Let A and B be two relations. Then Πx(A) – (Πx((πx(A) X B) – A)) is equivalent *

A/B

A-B

https://docs.google.com/forms/d/10GhGJpXcNeE6Qo7waUbATxPmDT8V0WqL9fh5Qv256pw/edit 2/3
6/26/2021 Relational Algebra - Google Forms

A⋈B

None of the above

Let R and S be two relations. If degree of the relation R is 'm' and degree of the relation S is 'n', *
then the degree of the result of R X S

m-n

m*n

m+n

None of the above

https://docs.google.com/forms/d/10GhGJpXcNeE6Qo7waUbATxPmDT8V0WqL9fh5Qv256pw/edit 3/3