Terms such as data model, physical level, logical independence, catalog, schema, metadata and data dictionary can sound interchangeable during quick revision, and multiple-choice options are built precisely on the boundaries between them. The sharpest of those boundaries runs through the ANSI-SPARC architecture: the conceptual level fixes what the database holds, the internal level fixes how those records sit on disk, and the external level fixes what one user is allowed to see. Attempt all 12 questions before uncovering the answers, and use the DBMS MCQ subject hub if you want the wider practice route.
1. DBMS data-model MCQs: definitions and model families
Q1. The general modelling toolkit
A collection of conceptual tools for describing data, data relationships, data semantics and consistency constraints, is known as
(a) Design model
(b) Developed model
(c) Data model
(d) ER model
Answer: (c) Data model. A data model supplies the concepts used to describe structure, relationships, meaning and constraints. An ER model is one particular modelling approach, so it is narrower than the general term in the stem.
Q2. Recognised database models
Which of the following is a type of database model ?
(a) Hierarchical model
(b) Relational model
(c) Object-oriented model
(d) All of the above
Answer: (d) All of the above. A hierarchical model follows parent-child links, a relational model organises data as relations or tables, and an object-oriented model represents persistent data as objects. All three choices are recognised model families, so the inclusive option is correct.
Q3. The concept behind abstraction
A collection of concepts that can be used to describe the structure of database and provides the necessary means to achieve this abstraction:
(a) Data Model
(b) Relationship Model
(c) Query Model
(d) Form Model
Answer: (a) Data Model. This stem and Q1 land on the same term from opposite sides. Q1 lists what a data model must describe, namely structure, relationships, semantics and constraints; this one names what it is for, which is abstraction, hiding storage detail behind concepts a designer can reason about. Relationship, query and form models each handle one narrower task, and none of them supplies the complete description the stem asks for.
2. ANSI-SPARC architecture MCQs: levels and data independence
Q4. Where data is actually stored
Which of the following refers to the level of data abstraction that describes exactly how the data is actually stored?
(a) Conceptual Level
(b) Physical Level
(c) File Level
(d) Logical Level
Answer: (b) Physical Level. The external level contains user views, the conceptual level describes the global logical structure, and the internal or physical level covers files, records, indexes and access paths. “File level” is not a fourth level in the ANSI-SPARC architecture.
Q5. Logical data independence
Immunity of the external schemas (or application programs) to changes in the conceptual schema is referred to as:
(a) Physical Data Independence
(b) Logical Data Independence
(c) Both (a) and (b)
(d) None of the above
Answer: (b) Logical Data Independence. Logical data independence protects external schemas when the conceptual schema changes, while physical data independence protects the conceptual schema when internal storage changes. For example, conceptual relation Student(StudentID, Name) can become Student(StudentID, Name, Email) while the existing external view StudentNames(StudentID, Name) remains unchanged.
Q6. The role disguised as a level
Which of the following is not a valid level in the ANSI-SPARC three-level architecture of DBMS?
(a) Administrator level
(b) External level
(c) Conceptual level
(d) Internal level
Answer: (a) Administrator level. External, conceptual and internal are the three valid abstraction levels. A database administrator is a genuine DBMS role, but that does not make “administrator” an architecture level.
3. Database architecture components MCQs: catalogs, rules and distribution
Q7. Catalog and schema hierarchy
The top level of the hierarchy consists of ______ each of which can contain ______.
(a) Catalogs, Schemas
(b) Schemas, Catalogs
(c) Environment, Schemas
(d) More than one of the above
(e) None of the above
Answer: (a) Catalogs, Schemas. For example, catalog KG_College can contain schemas Admissions and Academics, while Academics can contain objects such as Student and Course. The containment direction is catalog to schema, so reversing the two terms makes option (b) false.
Q8. Counting Codd's rules
How many core Codd's rules are commonly referred to in DBMS/RDBMS, excluding the foundational Rule 0?
(a) 10
(b) 11
(c) 12
(d) 13
Answer: (c) 12. The core set runs from Rule 1 through Rule 12, an inclusive range of 12 - 1 + 1 = 12 statements. Rule 0, the foundation rule, sits outside that count: it requires that any system claiming to be relational manage its databases entirely through relational capabilities. Counting Rule 0 in gives 12 + 1 = 13 numbered statements, but the stem excludes it.
Q9. Inconsistency across distributed sites
Which of the following is a disadvantage of using a distributed database system?
(a) Improved data accessibility
(b) Increased data security
(c) Data inconsistency
(d) More than one of the above
(e) None of the above
Answer: (c) Data inconsistency. Suppose sites Delhi and Jaipur both begin with an account balance of 5000. Delhi commits an update to 4500 while Jaipur temporarily still reads 5000, producing a visible difference of 5000 - 4500 = 500 until replication catches up. Improved accessibility is a benefit of distribution, not a disadvantage, and spreading data over more sites does not increase security either, so (c) is the only option that names a disadvantage at all.
4. Data dictionary and metadata MCQs: what the repository actually stores
Q10. Definitions, rules and storage allocation
Which of the following statement(s) is/are correct regarding Data Dictionary in Database Management System? Statements: I. Data Dictionary is a collection of definitions, rules and advisories of data designed to be used as a reference with the data warehouse. II. Data Dictionary is the area of memory allocated for data storage.
(a) Only I
(b) Only II
(c) Both I and II
(d) Neither I nor II
Answer: (a) Only I. A data dictionary is a metadata reference that holds definitions, rules and related guidance, so Statement I fits. Statement II describes an area allocated for storage, not a repository about the meaning and structure of data.
Q11. A repository of data about data
__________ is a structured repository of data, about data.
(a) Data Flow Diagram
(b) System Components Matrix
(c) Data Dictionary
(d) Decision Table
Answer: (c) Data Dictionary. “Data about data” means metadata. One dictionary row could record field name StudentID, type INTEGER, width 4 bytes, nullable No, and key role Primary key. A data flow diagram shows movement and a decision table expresses rules, so neither is the repository described.
Q12. Fields described by a data dictionary
A data dictionary is a special file that contains:
(a) names of all fields in all files.
(b) data types of all fields in all files.
(c) width of all fields in all files.
(d) all of these.
Answer: (d) all of these. Reuse the Q11 row: field name StudentID, data type INTEGER, and width 4 bytes. It contains each attribute named in (a), (b) and (c), so the inclusive option is correct.
5. DBMS architecture MCQ review: turn the 12 answers into a diagnostic
The twelve questions group into four boundaries, three questions each:
Block | Questions | Boundary being tested |
|---|---|---|
Data-model language | Q1 to Q3 | General model concepts versus narrower tools |
Abstraction and independence | Q4 to Q6 | External, conceptual and internal levels |
Architecture components and standards | Q7 to Q9 | Catalog hierarchy, rule counts and distribution |
Metadata | Q10 to Q12 | Definitions about data versus stored data |
A wrong answer in the first block usually signals nothing worse than a vocabulary gap. A wrong answer in the second or third block is more expensive, because the level names and the catalog-to-schema direction resurface later in query processing, storage structures and distributed design, so a shaky answer here propagates. Q1, Q3, Q10 and Q11 all rest on a single distinction, data versus the description of data, which is why a reader who misses one of them usually misses the others.
Suppose a learner misses Q3, Q5, Q8 and Q10. Four wrong answers leave 12 - 4 = 8 correct, so the first-pass score is 8/12. The error log should name the actual boundaries: abstraction wording in Q3, logical versus physical independence in Q5, the 12 versus 13 Codd-rule count in Q8, and metadata versus storage in Q10.
Revise those four distinctions, then reattempt only Q3, Q5, Q8 and Q10 before repeating the complete set. Continue with the DBMS normalization solved MCQs when these fundamentals feel stable.
6. The short version and the next DBMS practice step
Keep four rules ready for revision:
A data model describes data structure, relationships, meaning and constraints.
The internal or physical level explains how data is stored.
Logical data independence shields external views from conceptual changes.
A data dictionary stores metadata such as a field's name, type and width.
Now explain why Q4 is (b), Q5 is (b) and Q10 is (a) without looking at the options. If you can state each boundary in one sentence, you have retained the idea rather than memorised the letter.
For the next route, use CS Fundamentals for Placements for a placement-oriented core-CS sequence, Zero to Hero for broader semester-level foundations, or the CS Fundamentals category to compare the available paths. Choose the route that matches your present goal, and keep testing each definition against a concrete example.
