Scribd
Upload
89 views

Database Management System 1. For A Database Relation R (A, B, C, D) Where The Domains of A, B, C and D Only Include Atomic

The document contains 20 multiple choice questions about database management systems and normalization. Some key topics covered include functional dependencies, normal forms (1NF, 2NF, 3NF, BCNF), candidate keys, decomposition, and lossless join properties. The questions test understanding of concepts like functional dependencies, normal forms, decomposition, and determining the highest normal form for relations based on given dependencies.

Uploaded by

bhavesh agrawal
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
89 views

Database Management System 1. For A Database Relation R (A, B, C, D) Where The Domains of A, B, C and D Only Include Atomic

The document contains 20 multiple choice questions about database management systems and normalization. Some key topics covered include functional dependencies, normal forms (1NF, 2NF, 3NF, BCNF), candidate keys, decomposition, and lossless join properties. The questions test understanding of concepts like functional dependencies, normal forms, decomposition, and determining the highest normal form for relations based on given dependencies.

Uploaded by

bhavesh agrawal
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

DATABASE MANAGEMENT SYSTEM

1. For a database relation R (a, b, c, d) where the domains of a, b, c and d only include atomic
values, only the following functional dependency and those that can be inferred from them
hold: a  c , b  d

The relation is in:


A. 1NF but not in 2NF
B. 2NF but not in3NF
C. 3NF
D. None of the above

2. Relation produced from an E-R model will always be in:


A. 1NF B. 2NF C. 3NF D. 4NF

3. Choose the correct statement:


A. An alternative key is a candidate key that is not a primary key.
B. An alternate key is a primary key that is not a candidate key.
C. An alternate key is a candidate key that is also a primary key.
D. None of these.

4. 3NF is inadequate in situations where the relation:


A. has multiple candidates key
B. has candidate key that are composite
C. has overlapped candidate keys
D. all the above

5. If a relation is in BCNF, it is also in:


A.1NF B. 2NF C. 3NF D. All of the above

6. Consider a relation R= {M, N, O,P, Q, R, S, T} with the following set of dependencies:


MN Q
M RQ
N R
R ST

Next consider the following set of decompositions for the relation schema R:
D1= {R1,R2,R3,R4}: R1={M,N,O,P}, R2={M,P,Q}, R3= {N,R}, R4={R,S,T}
D2= {R1,R2,R3,R4}: R1={M,N,O}, R2= {P,Q}, R3= {N,R}, R4= {R,S,T}

Which of the above decomposition (1) has/ have lossless join property?

1
A. Only D1 B. Only D2 C. Both D1 and D2 D. Neither D1 nor D2

7. Consider the following set of functional dependency on the scheme (A, B,C)
ABC, BC, A B, ABC

The canonical cover for this set is:


(A) ABC and B C
B. ABC and AB C
C. A BC and A B
D. A B and B C

8. Which of the following statements is FALSE?


A. Any relation with 2 attributes is in BCNF
B. A relation in which every key has only one attribute is in 2NF
C. A prime attribute can be transitively dependent on a key in a 3NF relation
D. A prime attribute can be transitively dependent on a key in a BCNF relation

9. The following functional dependency hold for relations R(A,B,C) and S(B,D,E):
B  A, A  C

The relation R contains 200 tuples and the relation contains 100 tuples. What is the maximum
number of tuples possible in natural join R S?

10. Which normal form is considered adequate for relational database design?
A. 2NF B. 3NF C. 4NF D. BCNF

11. A functional dependency of the form X Y is trivial if:


A. Y⊆X B. Y⊂X C. X⊆Y D. X⊂Y and Y⊂X

12. If every non-key attribute is functionally dependent on the primary key then the relation will
be in:
A. 1NF B. 2NF C. 3NF D. 4NF

13. Given the functional dependencies:


XW; XY; YZ and Z PQ

Which of the following does not hold good?


A. X Z B. W Z C. X WY D. None of these

14. Consider the schema R=(S, T, U, V) and dependency be ST, T U, U V, V S.


Let R= (R1 and R2) be a decomposition such that R1∩R2.

2
The decomposition is:
A. Not in 2NF
B. In 2NF but not in 3NF
C. In 3NF but not in 2NF
D. In both 2NF and 3 NF

15. Relation R is decomposed using a set of functional dependency F, and relation S is


decomposed using another set of functional dependencies G. One decomposition is definitely
BCNF, the other is definitely 3NF, but is not known to make a guaranteed identification.
Which of the following tests should be used for the decomposition? (Assume that closure of
F and G are available)

A. Dependency preservation
B. BCNF definition
C. Both (A) and (B)
D. 3NF definition

16. The relation schema: student_performance (name, course_number, roll_number, grade) has
the following functional dependencies:
name, course_number grade
roll_number, course_number grade
nameroll_number
roll_number name

The highest normal form of this relation schema is:


A. 2NF B. 3NF C. BCNF D. 4NF

17. Relation R has attributes A, B, C, D, E, F, G, H, I and J and satisfies the following functional
dependencies:
ABD E
CJ
B G
CI I
B F
G HI

Which of the following is not a candidate key of R?


A. A, B, C, I
B. A, B, C, D, G
C. A, B, C, D, E
D. A, B, C, D

18. Consider the 2 relation schema: R1= (A, B, C, D, E) and R2= (A, B, C, D, E). Statement 1 is
the FD of R1 and statement 2 is the FD of R2.
1. A B, AB C, D AC, D E
2. A BC, D AE

3
Which of the following statements is true?
A. FD of R1 is equivalent to FD of R2
B. FD of R1 and R2 not equivalent
C. We cannot compare FD of R1 and R2
D. None of the above

19. Given R (A, B, C, D, E, F) and F= {ABC, D E, E F, D A}

What is the highest normal form of R?


A. 1NF B. 2NF C. 3NF D. BCNF

20. A relation empdtl is defined with attribute empcode(unique), name, street, city, state and
pincode. For any pincode, there is only one city and state. Also for any given street, city and
state there is just one pincode. In normalization, empdtl is a relation in:

A. 1NF
B. 2NF and hence also in 1NF
C. 3NF and hence also in 2NF and 1NF
D. BCNF and hence also in 3NF, 2NF and 1NF

You might also like