dbms
AC14/AT11
Database Management Systems
TYPICAL QUESTIONS & ANSWERS
PART -I
OBJECTIVE TYPE QUESTIONS
Each Question carries 2 marks.
Choosethe correct or the best alternative in the following:
Q.1
Which of the following relational algebra operations do not require the participating tables to be union-compatible?
(A) Union
(B) Intersection
(C) Difference
(D) Join
Ans: (D)
Q.2
Which of the following is not a property of transactions?
(A) Atomicity
(B) Concurrency
(C) Isolation
(D) Durability
Ans: (B)
Q.3
Relational Algebra does not have
(A) Selection operator.
(C) Aggregation operators.
(B) Projection operator.
(D) Division operator.
Ans: (C )
Q.4
Checkpoints are a part of
(A) Recovery measures.
(C ) Concurrency measures.
(B) Security measures.
(D) Authorization measures.
Ans: (A)
Q.5
Tree structures are used to store data in
(A) Network model.
(B) Relational model.
(C) Hierarchical model.
(D) File based system.
Ans: (C )
Q.6
The language that requires a user to specify the data to be retrieved without specifying exactly how to get it is
(A) Procedural DML.
(B) Non-Procedural DML.
(C) Procedural DDL.
(D) Non-Procedural DDL.
Ans: (B)
Q.7
Precedence graphs help to find a
1
AC14/AT11
Database Management Systems
(A) Serializable schedule.
(C) Deadlock free schedule.
(B) Recoverable schedule.
(D) Cascadeless schedule.
Ans: (A)
Q.8
The rule that a value of a foreign key must appear as a value of some specific table is called a
(A) Referential constraint.
(B) Index.
(C) Integrity constraint.
(D) Functional dependency.
Ans: (A) The rule that a value of a foreign key must appear as a value of some specific table is called a referential constraint. (Referential integrity constraint is concerned with foreign key)
Q.9
The clause in SQL that specifies that the query result should be sorted in ascending or descending order based on the values of one or more
Database Management Systems
TYPICAL QUESTIONS & ANSWERS
PART -I
OBJECTIVE TYPE QUESTIONS
Each Question carries 2 marks.
Choosethe correct or the best alternative in the following:
Q.1
Which of the following relational algebra operations do not require the participating tables to be union-compatible?
(A) Union
(B) Intersection
(C) Difference
(D) Join
Ans: (D)
Q.2
Which of the following is not a property of transactions?
(A) Atomicity
(B) Concurrency
(C) Isolation
(D) Durability
Ans: (B)
Q.3
Relational Algebra does not have
(A) Selection operator.
(C) Aggregation operators.
(B) Projection operator.
(D) Division operator.
Ans: (C )
Q.4
Checkpoints are a part of
(A) Recovery measures.
(C ) Concurrency measures.
(B) Security measures.
(D) Authorization measures.
Ans: (A)
Q.5
Tree structures are used to store data in
(A) Network model.
(B) Relational model.
(C) Hierarchical model.
(D) File based system.
Ans: (C )
Q.6
The language that requires a user to specify the data to be retrieved without specifying exactly how to get it is
(A) Procedural DML.
(B) Non-Procedural DML.
(C) Procedural DDL.
(D) Non-Procedural DDL.
Ans: (B)
Q.7
Precedence graphs help to find a
1
AC14/AT11
Database Management Systems
(A) Serializable schedule.
(C) Deadlock free schedule.
(B) Recoverable schedule.
(D) Cascadeless schedule.
Ans: (A)
Q.8
The rule that a value of a foreign key must appear as a value of some specific table is called a
(A) Referential constraint.
(B) Index.
(C) Integrity constraint.
(D) Functional dependency.
Ans: (A) The rule that a value of a foreign key must appear as a value of some specific table is called a referential constraint. (Referential integrity constraint is concerned with foreign key)
Q.9
The clause in SQL that specifies that the query result should be sorted in ascending or descending order based on the values of one or more