TOP 500+ DBMS GATE Questions and Answers (Database Management System)

Are you preparing for your DBMS (Database Management System) GATE Preparation? Isn’t it difficult to find DBMS GATE questions and answers that suit your syllabus? This article is all you need to help you with DBMS GATE questions and become successful at DBMS GATE preparation.

DBMS GATE Questions and Answers

1. Which one of the following statements about normal forms is FALSE?

a) BCNF is stricter than 3 NF

b) Lossless, dependency-preserving decomposition into 3 NF is always possible

c) Lossless, dependency–preserving decomposition into BCNF is always possible

d) Any relation with two attributes is BCNF

Answer: c


2. Functional Dependencies are the types of constraints that are based on______

a) Key

b) Key revisited

c) Superset key

d) None of the mentioned

Answer: a


3. Which is a bottom-up approach to database design that design by examining the relationship between attributes:

a) Functional dependency

b) Database modeling

c) Normalization

d) Decomposition

Answer: c


4. Which forms simplifies and ensures that there are minimal data aggregates and repetitive groups:

a) 1NF

b) 2NF

c) 3NF

d) All of the mentioned

Answer: c


5. Which forms has a relation that possesses data about an individual entity:

a) 2NF

b) 3NF

c) 4NF

d) 5NF

Answer: c


6. Which forms are based on the concept of functional dependency:

a) 1NF

b) 2NF

c) 3NF

d) 4NF

Answer: c


7. We can use the following three rules to find logically implied functional dependencies. This collection of rules is called

a) Axioms

b) Armstrong’s axioms

c) Armstrong

d) Closure

Answer: b


8. Which of the following is not Armstrong’s Axiom?

a) Reflexivity rule

b) Transitivity rule

c) Pseudotransitivity rule

d) Augmentation rule

Answer: c


9. A relation is in ____________ if an attribute of a composite key is dependent on an attribute of other composite key.

a) 2NF

b) 3NF

c) BCNF

d) 1NF

Answer: b


10. What are the desirable properties of a decomposition

a) Partition constraint

b) Dependency preservation

c) Redundancy

d) Security

Answer: b


11. R (A,B,C,D) is a relation. Which of the following does not have a lossless join dependency preserving BCNF decomposition?

a) A->B, B->CD

b) A->B, B->C, C->D

c) AB->C, C->AD

d) A->BCD

Answer: d


12. The algorithm that takes a set of dependencies and adds one schema at a time, instead of decomposing the initial schema repeatedly is

a) BCNF algorithm

b) 2NF algorithm

c) 3NF synthesis algorithm

d) 1NF algorithm

Answer: c


13. The functional dependency can be tested easily on the materialized view, using the constraints ____________.

a) Primary key

b) Null

c) Unique

d) Both Null and Unique

Answer: d


14. Which normal form is considered adequate for normal relational database design?

a) 2NF

b) 5NF

c) 4NF

d) 3NF

Answer: d


15. The normal form which satisfies multivalued dependencies and which is in BCNF is

a) 4 NF

b) 3 NF

c) 2 NF

d) All of the mentioned

Answer: a


16. Which of the following is a tuple-generating dependencies?

a) Functional dependency

b) Equality-generating dependencies

c) Multivalued dependencies

d) Non-functional dependency

Answer: c


17. The main task carried out in the __________ is to remove repeating attributes to separate tables.

a) First Normal Form

b) Second Normal Form

c) Third Normal Form

d) Fourth Normal Form

Answer: a


18. Which of the normal form is based on multivalued dependencies?

a) First

b) Second

c) Third

d) Fourth

Answer: d


19. Which forms has a relation that possesses data about an individual entity?

a) 2NF

b) 3NF

c) 4NF

d) 5NF

Answer: c


20. If a multivalued dependency holds and is not implied by the corresponding functional dependency, it usually arises from one of the following sources.

a) A many-to-many relationship set

b) A multivalued attribute of an entity set

c) A one-to-many relationship set

d) Both A many-to-many relationship set and A multivalued attribute of an entity set

Answer: d


More Questions

Comments