Home »
MCQs »
DBMS MCQs
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.
- Rational Calculus
- Relational Calculus
- Ambiguous Calculus
- None of the above
Answer: B) Relational Calculus
Explanation:
A Relational Calculus system is a non-procedural query language.
Discuss this Question
2. A ___ query language focuses on how to get the end results for the user.
- Procedural
- Non-procedural
- Circular
- Flow
Answer: B) Non-procedural
Explanation:
A non-procedural query language focuses on how to get the end results for the user.
Discuss this Question
3. How many types of relational calculus are there?
- 1
- 2
- 3
- 4
Answer: B) 2
Explanation:
Explanation: There are two types of relational calculus: the tuple relational calculus and the domain relational calculus.
Discuss this Question
4. Which of the following is a type of relational calculus?
- Tuple Relational Calculus
- Domain Relational Calculus
- Both A and B
- None of the above
Answer: C) Both A and B
Explanation:
Tuple Relational Calculus and Domain Relational Calculus are two types of relational calculus.
Discuss this Question
5. In a relation, ___ are selected using the tuple relational calculus.
- Attributes
- Tuples
- Relation
- Calculus
Answer: B) Tuples
Explanation:
In a relation, tuples are selected using the tuple relational calculus.
Discuss this Question
6. ___ in TRC use tuples from a relation.
- Filtering Variables
- Unfiltering Variables
- Filtering Statics
- Unfiltering Statics
Answer: A) Filtering Variables
Explanation:
Filtering variables in TRC use tuples from a relation.
Discuss this Question
7. There can be ___ tuples in the result of the relation.
- One
- Two
- Three
- Many
Answer: D) Many
Explanation:
There can be many types in the result of the relation.
Discuss this Question
8. What is the notation to denote Tuple Relational Calculus?
- {T | P (T)}
- {P (T) | T}
- {P (T)}
- {T}
Answer: A) {T | P (T)}
Explanation:
{T | P (T)} is the notation to denote Tuple Relational Calculus.
Discuss this Question
9. What is the T in Tuple Relational Calculus's Notation?
- Input Tuples
- Resulting Tuples
- Both A and B
- None of the above
Answer: B) Resulting Tuples
Explanation:
T in Tuple Relational Calculus's Notation is Resulting Tuples.
Discuss this Question
10. P(T) represents the condition that is used to ___ T.
- Get
- Fetch
- Both A and B
- None of the above
Answer: C) Both A and B
Explanation:
P(T) represents the condition that is used to get or fetch T.
Discuss this Question
11. TRC can be ___.
- Quantified
- Qualified
- Destroyed
- Created
Answer: A) Quantified
Explanation:
TRC can be quantified.
Discuss this Question
12. ___ uses Quantifiers that can be either Existential (*) or Universal (∀).
- ERC
- TRC
- PRC
- NRC
Answer: B) TRC
Explanation:
TRC uses Quantifiers that can be either Existential (*) or Universal (∀).
Discuss this Question
13. What is the full form of DRC?
- Domain Rational Calculus
- Domain Relational Calculus
- Distributed Rational Calculus
- Distributed Relational Calculus
Answer: B) Domain Relational Calculus
Explanation:
The full form of DRC is Domain Relational Calculus.
Discuss this Question
14. The domain of ___ is used when filtering variables using domain relational calculus.
- Attributes
- Tuples
- Both a and b
- None of the above
Answer: A) Attributes
Explanation:
The domain of attributes is used when filtering variables using domain relational calculus.
Discuss this Question
15. Using the same operators used in ___, domain relational calculus can be used.
- Attribute Calculus
- Tuple Calculus
- Calculus
- None of the above
Answer: B) Tuple Calculus
Explanation:
Using the same operators used in tuple calculus, domain relational calculus can be used.
Discuss this Question
16. DRC uses logical connectives ∧ (and), ∨ (or) and ┓ (not).
- ∧ (and)
- ∨ (or)
- ┓ (not)
- All of the above
Answer: D) All of the above
Explanation:
DRC uses logical connectives ∧ (and), ∨ (or) and ┓ (not).
Discuss this Question
17. Binding the variable is done using the ___.
- Existential Functions (∃)
- Universal Quantifier Functions (∀)
- Both A and B
- None of the above
Answer: C) Both A and B
Explanation:
Binding the variable is done using the Existential Functions (∃) and Universal Quantifier Functions (∀).
Discuss this Question
18. DRC's notation is -
- {a1, a2, a3, ..., an | P (a1, a2, a3, ... ,an)}
- {P(a1, a2, a3, ... ,an) | a1, a2, a3, ..., an}
- {P(a1, a2, a3, ... ,an)}
- {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)}.
Discuss this Question
19. Formula P in DRC is built based on ____ attributes.
- Inner
- Outer
- Centric
- None
Answer: A) Inner
Explanation:
Formula P in DRC is built based on inner attributes.
Discuss this Question
20. a1, a2, ... an notation in DRC are the -
- Tuples
- Attributes
- Both A and B
- None of the above
Answer: B) Attributes
Explanation:
a1, a2, .... an notation in DRC are the attributes.
Discuss this Question