DBMS DPP PART - 1 BY-SUNIL YADAV SIR 1

DBMS DPP PART - 1

1. Goals for the design of the logical 6. In a Hierachical database, a

scheme include hashing function is used to locate
(a) Avoiding data inconsistency the
(b) Being able to construct query (a) Collision (b) Root
easily (c) Foreign Key (d) Records
(c) Being able to access data 7. An aggregation, the association is
efficiently drawn using which symbol?
(d) All of the above (a) A line which loops back on to the
2. Purpose of ‘Foreign Key’ in a table same table
is to ensure (b) A small open diamond at the end
(a) Null Integrity of a line connecting two tables
(b) Referentail Integrity (c) A small closed diamond at the end
(c) Domain Integrity of a line connecting two tables
(d) Null and Domain Integrity (d) A small closed triangle at the end
3. Which type of DBMS provides of a line connecting two tables
support for maintaining several
8. Let R1(a, b, c) and R2(x, y, z) be two
versions of the same entity?
(a) Relational Database Management relations in which a is the foreign
System key of R1 that refers to the primary
(b) Hierarchical key of R2. Consider following four
(c) Object Oriented Database options.
Management System (a) Insert into R1
(d) Network (b) Insert into R2
4. Let R(a, b, c) and S(d, e, f) be two (c) Delete from R1
relation in which d is the foreign (d) Delete from R2
key of S that refers to the primary Which of the following is correct
key of R. Consider the following about the referential integrity
four operations R and S. constraint with respect to above?
I. Insert into R (a) Operations (a) and (b) will cause
II. Insert into S violation
III. Delete from R (b) Operation (b) and (c) will cause
IV. Delete from S violation
Which of the following can cause a (c) Operation (c) and (d) will cause
violation of the referential violation.
integrity constraint above? (d) Operation (d) and (a) will cause
(a) Both I and IV violation.
(b) Both II and III 9. A many-to-one relationship exists
(c) All of these (d) None of these between entity sets r1 and r2. How
5. Let x, y, z, a, b, c be the attributes will it be represented using
of an entity set E. If {x}, {x, y}, {a, functional dependencies if Pk(r)
b}, {a, b, c}, {x, y, z} are superkeys denotes the primary key attribute
then which of the following are the of relation r?
candidate keys? (a) Pk(r1) Pk(r2) (b) Pk(r2) Pk(r1)
(a) {x, y} and {a, b} (b) {x} and {a, b} (c) Pk(r2) Pk(r1) and Pk(r1) Pk(r2)
(c) {x, y, z} and {a, b, c} (d) {z} and {c} (d) Pk(r2) Pk(r1) or Pk(r1) Pk(r2)

Join RPSC Programmer Offline/Online Batch Contact @ 9694473047

DBMS DPP PART - 1 BY-SUNIL YADAV SIR 2

10. The following functional 13. Relation R has eight attributes

dependencies hold true for the ABCDEFGH Fields of R contain
relational schema {V, W, X, Y, Z}: only atomic values.
F = {CH G, A BC, B CFG, E
A, F EG}, is a set of function
dependencies (FDs) so tha F+ is
exctly the set of FDs that hold for
Which of the following is R.
irreducible equivalent for this set How many candidate keys does the
of functional dependencies? relation R have?
(a) V W (b) V W (a) 3 (b) 4
V X W X (c) 5 (d) 6
Y V Y V 14. The following functional
Y Z Y Z dependencies are given:
(c) V W (d) V W AB CD, AF D, DE F, C G,
V X W X F E, G A.
Y V Y V Which one of the following options
Y X Y X is false?
Y Z Y Z (a) {CF}+ = {ACDEFG}
11. Consider the relation scheme R = (b) {BG}+ = {ABCDG}
(E, F, G, H, I, J, K, L, M, N) and the (c) {AF}+ = {ACDEFG}
set of functional dependencies (d) {AB}+ = {ABCDFG}
{{E, F} {G}, {F} {I, J}, {E,H} {K, L}, 15. Consider the following tables T1
{K} {M}, {L} {N}} on R. What is and T2
the key for R?
(a) {E, F}
(b) {E, F, H}
(c) {E, F, H, K, L}
(d) {E}
12. Consider the relation X (P, Q, R, S,
T, U) with the following set of
functional dependencies.
F={ In table T1, P is the primary key
{P, R} {S, T}, and Q is the foreign key
{P, S, U} {Q, R} referencing R in table T2 with on-
} delete casade and on-update
Which of the following is the trivial cascade. In Table T2, R is the
functional dependency in F+ is primary key and S is the foreign
closure of F? key referencing P in table T1 with
(a) {P, R} {S, T} on-delete set NULL and on-update
(b) {P, R} {R, T} cascade. In order to delet record
(c) {P, S} {S} (3, 8) from table T1, the number of
(d) {P, S, U} {Q} additional records that need to be
deleted from table T1 is _______.
(a) 0 (b) 1
(c) 2 (d) 3

Join RPSC Programmer Offline/Online Batch Contact @ 9694473047

DBMS DPP PART - 1 BY-SUNIL YADAV SIR 3

16. The following table has two 18. Consider a relation scheme R = (A,
attributes A and C where A is the B, C, D, E, H) on which the
primary key and C is the foreign following functional dependencies
key referencing A with on-delete hold : {A B, BC D, E C, D A}.
cascade. What are the candidate keys of R?
A C (a) AE, BE (b) AE, BE, DE
------------ (c) AEH, BEH, BCH
2 4 (d) AEH, BEH, DEH
3 4 19. Let R = (A, B, C, D, E, F) be a
4 3 relation scheme with the following
5 2 dependencies: C F, E A, EC D,
7 2 A B. Which of the following is a
9 5 key of R?
6 4 (a) CD (b) EC
The set of all tuples that the must (c) AE (d) AC
be additionally deleted to preserve 20. Consider a scgema R(A,B,C,D) and
refefential integrity when the tuple functional dependencies A B and
(2, 4) is deleted is: C D. Then the decomposition of
(a) (3, 4) and (6, 4) R into R1(AB) and R2(CD) is
(b) (5, 2) and (7, 2) (a) Dependency preserving and
(c) (5, 2), (7, 2) and (9, 5) lossless join
(d) (3, 4), (4, 3) and (6, 4) (b) Lossless join but not dependency
17. Form the following instance of a preserving
relation scheme R(A, B, C), we can (c) Dependency preserving but not
conclude that: lossless join
(d) Not dependency preserving and
not lossless join

(a) A functionally determines B and B

functionally determines C
(b) A functionally determines B and B
does not functionally determine C
(c) B does not functionally determines
C
(d) A does not functionally determines
B and B does not functionally
determines C

Join RPSC Programmer Offline/Online Batch Contact @ 9694473047