DBMS MCQ Questions and Answers
DBMS MCQ questions with answers form a vital part of technical exams and campus interviews. This topic explores database concepts, normalization, SQL queries, transaction management, and ER models. Practicing programming questions and answers from this section strengthens your database design and query optimization skills. These questions are frequently asked in GATE, Infosys, TCS, and Wipro assessments, making them essential for students and professionals alike. Detailed solutions and explanations make this section perfect for both beginners and advanced learners aiming to master database management fundamentals.
DBMS MCQ
Showing 10 of
527 questions
361. In a relation, an instance is stored as
- a Column
- a Row
- as a Many to many relationship
- as an index
362. The process of combining entity types from an ER diagram into a single relation in a relational database is to
- specialise
- generalise
- consume
- assume
363. The Data Dictionary provides which of the following features?
- Transaction deadlock detection.
- Support for the SQL interface to the database.
- Costings for future database changes.
- None of the above.
364. Consider the development process for the "Three level model". Select the statement which is most generally TRUE.
- "Data Model" concerns the external users' view of the data.
- "Physical Design" is used to produce an ER model.
- "Physical Design" may refer to indexes.
- An ER model is required prior to "Conceptual Design".
365. In the ANSI/SPARC three level database model, the external view is best described by which one of the following options?
- It is the place where the storage structures link to the database.
- It is not part of the model.
- It is dependent on the underlying DBMS product used (e.g. Oracle, DBASE).
- It is the place where the users interface to the DBMS.
366. A dominant entity is the entity
- on the N side in a 1 : N relationship
- on the 1 side in a 1 : N relationship
- on either side in a 1 : 1 relationship
- nothing to do with 1 : 1 or 1 : N relationship
367. ________________ guarantees that the spurious tuple generation does not occur with respect to relation schemas after decomposition.
- A lossless join property.
- lossy join property
- join property
- none.
368. relational algebra is ________
- structured query language
- procedural query language.
- programmed query language.
- none.
369. ___________ defines a set of associations or a relationship set among a given set of entity
- relation ship type
- degree of the relation
- both A & B
- none
370. __________is an association among two or more entities.
- entity set
- strong entity set
- weak entity set
- relationship