DBMS Practice Quiz (11 questions)

All questions and answers

1. Which statements accurately describe databases and DBMS functions?

A database is an organized collection of related data.
A database system includes its data, software, applications, users, and hardware.
A DBMS is software for defining and managing access to a database.
A DBMS improves integrity but does not provide security or authorization.
A DBMS can support concurrent access, backup, and recovery.

A database is an organized collection of related data. · A database system includes its data, software, applications, users, and hardware. · A DBMS is software for defining and managing access to a database. · A DBMS can support concurrent access, backup, and recovery.

Explanation

A database organizes related data, and a DBMS provides software functions for defining, managing, and controlling access to it. DBMS capabilities include concurrency, backup and recovery, integrity, security, and authorization; a database system also encompasses applications, users, and hardware.

2. A company changes its file organization while retaining its logical schema and applications. Which statements about data abstraction and independence are accurate?

A file system commonly offers stronger controlled sharing and recovery facilities than a DBMS.
The external level presents the database portion needed by a particular user or application.
The change is logical data independence because it alters the conceptual schema.
Data abstraction hides unnecessary storage details and presents data at different levels.
Physical data independence allows internal storage changes without changing the logical schema or applications.

The external level presents the database portion needed by a particular user or application. · Data abstraction hides unnecessary storage details and presents data at different levels. · Physical data independence allows internal storage changes without changing the logical schema or applications.

Explanation

Changing file organization while retaining the logical schema and applications is physical data independence, not logical data independence. Data abstraction presents different levels, including user-specific external views; file systems generally have weaker sharing and harder recovery than DBMSs.

3. A team is comparing data models for a project. Which statements correctly distinguish their structures and building blocks?

A hierarchical model arranges records in a tree with parent-child relationships.
A relational model represents data in tables with rows and columns.
A network model connects records as a graph and can support multiple parents.
An ER model represents entities, attributes, and relationships for physical design.
Data-model building blocks include entities, attributes, relationships, constraints, and operations.

A hierarchical model arranges records in a tree with parent-child relationships. · A relational model represents data in tables with rows and columns. · A network model connects records as a graph and can support multiple parents. · Data-model building blocks include entities, attributes, relationships, constraints, and operations.

Explanation

Hierarchical models use tree structures with parent-child relationships, while network models connect records as a graph and can support multiple parents. Relational models represent data in tables with rows and columns. ER models represent entities, attributes, and relationships for conceptual design, and common model building blocks include entities, attributes, relationships, constraints, and operations.

4. A university requires each course to have a unique identifier and sets permitted marks from 0 to 100. Which statements apply to business rules and their implementation?

A marks range can be enforced through a CHECK constraint.
A required identifier is best implemented with a FOREIGN KEY constraint.
Business rules describe database storage formats rather than organizational policies.
These requirements are business rules because they define organizational requirements.
A uniqueness requirement can be implemented with a UNIQUE constraint.

A marks range can be enforced through a CHECK constraint. · These requirements are business rules because they define organizational requirements. · A uniqueness requirement can be implemented with a UNIQUE constraint.

Explanation

Business rules define or restrict organizational operations and help determine database constraints. UNIQUE can enforce distinct course identifiers, and CHECK can enforce a mark range; a FOREIGN KEY links records rather than requiring a value, and business rules concern organizational policies, not storage formats.

5. What does durability mean in the ACID properties of a database transaction?

Concurrent transactions do not interfere through incomplete operations.
A transaction preserves database rules and valid states.
All operations in a transaction succeed together or none take effect.
Committed changes remain recorded even after a system failure or restart.

Committed changes remain recorded even after a system failure or restart.

Explanation

Durability ensures that changes made permanent by COMMIT survive failures, such as a restart after a payment is recorded. Atomicity is the plausible alternative about all-or-nothing operations, rather than the persistence of committed changes.

6. In common ER notation, how is a weak entity represented?

With an underlined attribute
With a double diamond
With an oval connected to its owner
With a double rectangle

With a double rectangle

Explanation

A weak entity is shown with a double rectangle, distinguishing it from a regular entity. A double diamond denotes its identifying relationship, not the weak entity itself.

7. What is the role of a foreign key in a relational database?

It uniquely identifies each row within its own table.
It determines the permitted values for an attribute.
It supplies a value when an attribute is left unspecified.
It links a row to a key value in the same or another table.

It links a row to a key value in the same or another table.

Explanation

A foreign key refers to a primary or candidate key, linking records and supporting referential integrity. A primary key, rather than a foreign key, uniquely identifies each row in its own table.

8. How does BCNF differ from 3NF in its treatment of non-trivial functional dependencies?

BCNF requires dependency preservation after decomposition, while 3NF requires every decomposition to be lossless.
BCNF requires every dependent attribute to be prime, while 3NF requires every determinant to be a candidate key.
BCNF requires every determinant to be a super key, while 3NF also permits a prime attribute on the dependent side.
BCNF forbids partial dependencies on composite keys, while 3NF requires each cell to contain an atomic value.

BCNF requires every determinant to be a super key, while 3NF also permits a prime attribute on the dependent side.

Explanation

BCNF requires the left side of every non-trivial functional dependency to be a super key, whereas 3NF allows the dependent attribute to be prime as an alternative. A prime attribute on the dependent side can satisfy 3NF even when the determinant is not a super key, so that condition is not sufficient for BCNF.

9. Who proposed the relational rules that include the Information rule and the Guaranteed access rule?

E. F. Codd
Peter Chen
Michael Stonebraker
Edgar F. Codd’s database research group

E. F. Codd

Explanation

E. F. Codd proposed the rules for relational database management systems. Peter Chen is associated with the entity–relationship model, not authorship of Codd’s relational rules.

10. What consequence follows from the closure property of relational algebra when operators are combined in a query?

Each operation produces a relation that can serve as input to another operation.
Each operation permanently modifies the input relations in the database.
Each operation requires its output to be converted into a tuple variable.
Each operation must produce a scalar value before another can be applied.

Each operation produces a relation that can serve as input to another operation.

Explanation

Closure means relational algebra operators take relations as input and return relations, allowing the result of one operation to be used by another. Producing a scalar value is not required; scalar output is not the defining consequence of closure.

11. A university wants to identify students who have completed every course in a specified required-course list. Which relational operation can find those students from enrollment and required-course relations?

Division, which returns student values linked to every required course
An equijoin, which pairs rows whose course identifiers are equal
A left outer join, which retains every student and matching course rows
Grouping, which calculates an aggregate for each student group

Division, which returns student values linked to every required course

Explanation

Division is suited to queries that ask which values are associated with every value in another relation, such as students enrolled in all required courses. An equijoin can match enrollment rows to required courses, but matching individual courses does not by itself establish that a student has taken every required course.

Study with flashcards

Lock in the answers with 10 flashcards on DBMS.

What is a database?

An organized collection of related data.

What does DBMS software do with a database?

It defines, creates, stores, retrieves, updates, and controls access to it.

Which data models are included in the data-model classification?

Hierarchical, network, relational, entity–relationship, object-oriented, object-relational, and semi-structured models.

See the flashcards →

Read the study guide

Go over the full study guide for DBMS.

Read the study guide →

Related classes

Make your own practice quizzes

Upload your class notes and Revizly writes a practice quiz with explained answers in about a minute.

Quiz maker