adplus-dvertising
frame-decoration

Question

Relational Algebra is

a.

Data Definition Language

b.

Meta Language

c.

Procedural query Language

d.

None of the above

Posted under DBMS

Answer: (c).Procedural query Language

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Relational Algebra is

Similar Questions

Discover Related MCQs

Q. _______ produces the relation that has attributes of R1 and R2.

Q. Which of the following operation is used if we are interested in only certain columns of a table?

Q. Which of the following operations need the participating relations to be union compatible?

Q. The result of the UNION operation between R1 and R2 is a relation that includes

Q. Using Relational Algebra the query that finds customers, who have a balance of over 1000 is

Q. Cross Product is a:

Q. Consider the join of a relation R with relation S. If R has m tuples and S has n tuples, then the maximum size of join is:

Q. The natural join is equal to :

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

Q. The operators in SELECT operation statement such as 'and' , 'or' and 'not' are classified as

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

Q. Because of the calculus expression, the relational calculus is considered as

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

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

Q. The Boolean expression used in the SELECT operation consists of clauses such as

Q. The types of binary operations includes

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

Q. The operation which allows to process relationships from multiple relations rather than single relation is classified as

Q. The branch of calculus which is based on mathematical logic is classified as

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