Q.1 In the relational modes, cardinality is termed as:
(A) Number of tuples. (B) Number of attributes.
(C) Number of tables. (D) Number of constraints.
Ans: A
Q.2 Relational calculus is a
(A) Procedural language. (B) Non- Procedural language.
(C) Data definition language. (D) High level language.
Ans: B
Q.3 The view of total database content is
(A) Conceptual view. (B) Internal view.
(C) External view. (D) Physical View.
Ans: A
Q.4 Cartesian product in relational algebra is
(A) a Unary operator. (B) a Binary operator.
(C) a Ternary operator. (D) not defined.
Ans: B Cartesian product in relational algebra is a binary operator.
(It requires two operands. e.g., P X Q)
(A) Number of tuples. (B) Number of attributes.
(C) Number of tables. (D) Number of constraints.
Ans: A
Q.2 Relational calculus is a
(A) Procedural language. (B) Non- Procedural language.
(C) Data definition language. (D) High level language.
Ans: B
Q.3 The view of total database content is
(A) Conceptual view. (B) Internal view.
(C) External view. (D) Physical View.
Ans: A
Q.4 Cartesian product in relational algebra is
(A) a Unary operator. (B) a Binary operator.
(C) a Ternary operator. (D) not defined.
Ans: B Cartesian product in relational algebra is a binary operator.
(It requires two operands. e.g., P X Q)