×

# DBMS Relational Calculus MCQs

DBMS Relational Calculus MCQs: This section contains DBMS Relational Calculus Multiple-Choice Questions (MCQs).
Submitted by Anushree Goswami, on March 31, 2022

1. A ___ system is a non-procedural query language.

1. Rational Calculus
2. Relational Calculus
3. Ambiguous Calculus
4. None of the above

Explanation:

A Relational Calculus system is a non-procedural query language.

2. A ___ query language focuses on how to get the end results for the user.

1. Procedural
2. Non-procedural
3. Circular
4. Flow

Explanation:

A non-procedural query language focuses on how to get the end results for the user.

3. How many types of relational calculus are there?

1. 1
2. 2
3. 3
4. 4

Explanation:

Explanation: There are two types of relational calculus: the tuple relational calculus and the domain relational calculus.

4. Which of the following is a type of relational calculus?

1. Tuple Relational Calculus
2. Domain Relational Calculus
3. Both A and B
4. None of the above

Answer: C) Both A and B

Explanation:

Tuple Relational Calculus and Domain Relational Calculus are two types of relational calculus.

5. In a relation, ___ are selected using the tuple relational calculus.

1. Attributes
2. Tuples
3. Relation
4. Calculus

Explanation:

In a relation, tuples are selected using the tuple relational calculus.

6. ___ in TRC use tuples from a relation.

1. Filtering Variables
2. Unfiltering Variables
3. Filtering Statics
4. Unfiltering Statics

Explanation:

Filtering variables in TRC use tuples from a relation.

7. There can be ___ tuples in the result of the relation.

1. One
2. Two
3. Three
4. Many

Explanation:

There can be many types in the result of the relation.

8. What is the notation to denote Tuple Relational Calculus?

1. {T | P (T)}
2. {P (T) | T}
3. {P (T)}
4. {T}

Answer: A) {T | P (T)}

Explanation:

{T | P (T)} is the notation to denote Tuple Relational Calculus.

9. What is the T in Tuple Relational Calculus's Notation?

1. Input Tuples
2. Resulting Tuples
3. Both A and B
4. None of the above

Explanation:

T in Tuple Relational Calculus's Notation is Resulting Tuples.

10. P(T) represents the condition that is used to ___ T.

1. Get
2. Fetch
3. Both A and B
4. None of the above

Answer: C) Both A and B

Explanation:

P(T) represents the condition that is used to get or fetch T.

11. TRC can be ___.

1. Quantified
2. Qualified
3. Destroyed
4. Created

Explanation:

TRC can be quantified.

12. ___ uses Quantifiers that can be either Existential (*) or Universal (∀).

1. ERC
2. TRC
3. PRC
4. NRC

Explanation:

TRC uses Quantifiers that can be either Existential (*) or Universal (∀).

13. What is the full form of DRC?

1. Domain Rational Calculus
2. Domain Relational Calculus
3. Distributed Rational Calculus
4. Distributed Relational Calculus

Explanation:

The full form of DRC is Domain Relational Calculus.

14. The domain of ___ is used when filtering variables using domain relational calculus.

1. Attributes
2. Tuples
3. Both a and b
4. None of the above

Explanation:

The domain of attributes is used when filtering variables using domain relational calculus.

15. Using the same operators used in ___, domain relational calculus can be used.

1. Attribute Calculus
2. Tuple Calculus
3. Calculus
4. None of the above

Explanation:

Using the same operators used in tuple calculus, domain relational calculus can be used.

16. DRC uses logical connectives ∧ (and), ∨ (or) and ┓ (not).

1. ∧ (and)
2. ∨ (or)
3. ┓ (not)
4. All of the above

Answer: D) All of the above

Explanation:

DRC uses logical connectives ∧ (and), ∨ (or) and ┓ (not).

17. Binding the variable is done using the ___.

1. Existential Functions (∃)
2. Universal Quantifier Functions (∀)
3. Both A and B
4. None of the above

Answer: C) Both A and B

Explanation:

Binding the variable is done using the Existential Functions (∃) and Universal Quantifier Functions (∀).

18. DRC's notation is -

1. {a1, a2, a3, ..., an | P (a1, a2, a3, ... ,an)}
2. {P(a1, a2, a3, ... ,an) | a1, a2, a3, ..., an}
3. {P(a1, a2, a3, ... ,an)}
4. {a1, a2, a3, ..., an}

Answer: A) {a1, a2, a3, ..., an | P (a1, a2, a3, ... ,an)}

Explanation:

DRC's notation is - {a1, a2, a3, ..., an | P (a1, a2, a3, ... ,an)}.

19. Formula P in DRC is built based on ____ attributes.

1. Inner
2. Outer
3. Centric
4. None

Explanation:

Formula P in DRC is built based on inner attributes.

20. a1, a2, ... an notation in DRC are the -

1. Tuples
2. Attributes
3. Both A and B
4. None of the above

Explanation:

a1, a2, .... an notation in DRC are the attributes.