Topics

Relational Algebra and Calculus

⛪ Computer Science and Engineering > DataBase Management System

Both relational algebra and relational calculus are formal languages associated with relational model that are used to specify the basic retrieval requests.

Relational algebra consists of a basic set of operations, which can be used for carrying out basic retrieval operations. Relational calculus, on the other hand, provides declarative notations based on mathematical logic for specifying relational queries. Relational algebra uses a procedural approach by providing a step-by-step procedure for carrying out a query, whereas relational calculus uses the non-procedural approach as it describes the information to be retrieved without specifying the method for obtaining that information.

Looking for a resource to test your knowledge of Relational Algebra and Calculus in DBMS? Check out our interactive and challenging MCQ (Multiple Choice Questions) quiz that covers a variety of topics, from basic operations to advanced concepts. Practice your skills and prepare for interviews or exams with our comprehensive quiz.

➲ Relational Algebra and Calculus - Quiz

Q 1: Which of the following is the operation developed specifically for the relational databases?

A Union
B Cartesian product
C Division
D Difference

Q 2: Which of the following is the set-oriented operation?

A Select
B Difference
C Division
D Project

Q 3: Which of the following is the binary operation?

A Union
B Join
C Cartesian product
D All of these

Q 4: Which of the following is true for a right outer join?

A It includes all the tuples from both the relations satisfying the join condition along with all the tuples in the right relation that do not have a corresponding tuple in the left relation.
B It includes all the tuples from both the relations satisfying the join condition along with all the tuples in the left relation that do not have a corresponding tuple in the right relation.
C It selects all the tuples satisfying the join condition along with the tuples for which no tuples from the other relation satisfy the join condition.
D None of these

Q 5: Which of the following aggregate functions is used for counting tuples or values in a relation?

A Avg
B Count
C Max
D Min

Q 6: Which of the following is the component of a tuple relational calculus expression?

A The relation R for which tuple variable T is defined.
B A condition P(T) on the basis of which a set of tuples is to be retrieved.
C An attribute list specifying the required attributes to be retrieved for the tuples satisfying the given condition.
D All of these

A Join
B Division
C Cartesian product (multiplication)
D Projection

Q 11: Which of the following is the symbol for an existential quantifier?

Q 12: Which of the following is not a valid aggregate function?

A COUNT
B COMPUTE
C AVG
D MAX

Q 13: If relation R has m tuples and relation S has n tuples, then the result of join on relations R and S will have up to_________tuples.

A m * n
B m / n
C m + n
D m - n

Q 14:
The result of `R(A₁, A₂, …, A_m)XS(B₁, B₂, …, B_n)` is a relation with__________ attributes.

A m + n
B m - n
C m * n
D n - m

Q 15: The join operation where only matching tuples are kept in the result is called__________.

A Outer join
B Left outer join
C Inner join
D Right outer join

Q 16: Which of the following relational algebra operations require two tables as input with exactly the same attributes?

A Join, cartesian product (multiplication), division
B Project, restriction, union
C Union, intersection, minus
D Update, insert, delete

Q 17: Which of the following operations is used to select some required attributes from a relation while discarding the other attributes?

A Select operation
B Project operation
C Rename operation
D None of these

Q 18: Intersection operation is_____________.

A None of these
B Both (a) and (b)
C Associative
D Commutative