Relational Algebra Mcqs

Our collections of Multiple choice questions and answers focuses on study of ” Relational Algebra “. These questions are chosen from a collection of most authoritative and best reference books on DBMS. Our aim is to prepare an individual for competitive exams like NTS | GAT | ECAT | Data Warehouse jobs | Data Mining | DB administration jobs | Nadra Jobs | Software House and Data Base and Web Developer jobs | University and College entrance exams and various tests and job interviews. One should practice our Mcqs to assimilate knowledge on Relational Algebra comprehensively.

  1. Home
  2. »
  3. Computer Science Mcqs
  4. »
  5. DBMS Mcqs
  6. »
  7. Relational Algebra Mcqs

1.
In unary relational operations, SELECT operation is partition of relation usually classified as

Horizontal partition

Vertical partition

Insert partition

Delete partition

2.
If in JOIN operation, conditions of JOIN operation are not satisfied then results of operation is

Zero tuples and empty relation

One tuple from one relation

Zero tuples from two relation

Two tuples from empty relations

3.
Because of calculus expression, relational calculus is considered as

Procedural language

Non procedural language

Structural language

Functional language

4.
DIVISION operation can be applied to two relations A and B such as R(A) ÷ R(B) where as

A does not belong to B

A must be added to B

A belongs or equal to B

A must be subtracted from B

5.
In EQUIJOIN condition, operation which is used to avoid superfluous attribute is classified as

ALPHA JOIN

NATURAL JOIN

UNNATURAL JOIN

THETA JOIN

6.
Boolean expression used in SELECT operation consists of clauses such as

Attribute name

Constant value

Comparison operators

All of above

8.
In notation for query graphs, double ovals or circles are used to represent

Non-declarative nodes

Constant nodes

Stable nodes

Declarative nodes

9.
Operation which allows to process relationships from multiple relations rather than single relation is classified as

Division operation

Relation operation

Square operation

Join operation

10.
Branch of calculus which is based on mathematical logic is classified as

Universal calculus

Predicate calculus

Indicate calculus

Local calculus

11.
In a query tree, operations of relational algebra are classified as

Internal nodes

External nodes

Theta nodes

Entity nodes

12.
Operation which is used to take union of tuples from relations that are not union compatible is classified as

FULL UNION operation

JOIN UNION operation

OUTER UNION operation

INNER UNION operation

13.
If matching tuples are not found, kind of OUTER JOIN operation which keeps all tuples of first and second relation is classified as

LEFT OUTER JOIN

FULL OUTER JOIN

HALF OUTER JOIN

DOWNWARD JOIN

14.
Operations which are used to enhance power of expression of relational algebra includes

Generalized projection

Recursive closure operations

Outer JOIN operations

All of above

15.
In relational calculus, variables are bounded with help of

Non-identifiers

Non-quantifiers

Quantifiers

Identifiers

error: You are not allowed to do so.....
0Shares
0
Scroll to Top