Which action is the best first step in the practical normalization workflow?
Database Normalization Workflow Online Quiz Questions
Use this free practice quiz with 20 questions to review Database Normalization Workflow, test your knowledge, and prepare for your next test or exam.
Select all checks or practices that support a sound decomposition in the normalization workflow.
- A
Check that joining the new relations reconstructs the original information without losing facts or creating spurious rows.
- B
Check that important dependencies can be enforced by examining individual relations rather than requiring complex joins.
- C
Accept any decomposition that reduces redundancy, even if information is lost.
- D
Use appropriate keys and constraints to enforce key and reference rules.
A decomposition preserves dependencies when important dependencies can still be enforced by checking individual relations rather than requiring complex joins.
- A
True
- B
False
In the normalization workflow, removing partial dependencies of non-key attributes on a composite key is done to reach which normal form?
For a composite key, remove partial dependencies of non-key attributes to reach .
After decomposing a relation, how should you check that the decomposition is lossless and preserves important dependencies?
Which approach to denormalization matches the workflow?
- A
Denormalize whenever any duplicate fact is found, without documenting it.
- B
Avoid reviewing queries and workload because normalization alone determines performance.
- C
Consider deliberate denormalization if performance later justifies it, and document duplicated facts and how they will be kept consistent.
- D
Remove constraints whenever denormalization is used.
Select all practices that belong in the normalization workflow.
- A
List candidate keys and functional dependencies, and ask what determines each fact.
- B
Infer all business rules from a small sample of rows.
- C
Check for partial dependencies on composite keys when working toward 2NF.
- D
Check whether non-key attributes determine other non-key facts when working toward 3NF.
- E
Treat reduced redundancy as sufficient even if a decomposition loses information.
A small sample of rows alone is enough to establish the domain’s business rules during normalization.
- A
True
- B
False
When listing attributes and candidate keys, what type of dependencies should you also identify to determine what establishes each fact?
In a normalization workflow, removing partial dependencies from a relation with a composite key brings it to . Separating facts determined by other non-key attributes brings it to .
Which sequence best follows the normalization workflow when preparing to check a relation for 2NF?
- A
Check whether non-key attributes determine other non-key facts, then define keys.
- B
Address repeating groups, multi-valued fields, and unclear row identity; define keys before checking partial dependencies.
- C
Review workload and denormalize before identifying candidate keys.
- D
Check lossless joins before listing attributes and functional dependencies.
When identifying domain entities and relationships, it is safe to infer the domain’s business rules from a small sample alone.
- A
True
- B
False
What is the name of the decomposition property that ensures joining the new relations reconstructs the original information without losing facts or creating spurious rows?
A decomposition reduces redundancy. What should you check before concluding that it is a good design?
- A
Choose the decomposition that produces the fewest relations, even if some original facts cannot be reconstructed.
- B
Choose the decomposition that removes redundancy, even if important rules require complex joins to enforce.
- C
Check that the decomposition is lossless, preserves important dependencies, and supports appropriate constraint enforcement.
- D
Choose the decomposition with the most foreign keys, regardless of the information it preserves.
If performance needs later justify deliberate denormalization, document duplicated facts and provide a reliable way to keep them consistent.
- A
True
- B
False
What is the term for a non-key attribute depending on only part of a composite key?
Which approach best begins a normalization workflow?
- A
Identify entities and relationships, then list attributes, candidate keys, and functional dependencies.
- B
Choose a decomposition from a small sample before identifying domain rules.
- C
Review query performance before determining what establishes each fact.
- D
Add foreign keys before identifying entities, relationships, or candidate keys.
What is the name of the decomposition property that allows important dependencies to be enforced by checking individual relations rather than requiring complex joins?
Which checks and action are part of the workflow for reaching 1NF?
- A
Check whether non-key attributes determine other non-key facts.
- B
Check for repeating groups, multi-valued fields, and unclear row identity; define keys.
- C
Review real queries and workload to decide whether denormalization is useful.
- D
Verify that important dependencies can be checked in individual relations.
Related study packs and tools
02 — Information and Representation
A progressive guide to how computers encode numbers, text, images, and sound as binary data, including the trade-offs and limits of digital representation.
2 Digital Logic
A 14-question medium-difficulty quiz on Boolean algebra, logic gates, truth tables, and combinational circuits.
03 — Python Programming Fundamentals
A focused set of flashcards covering Python variables, data types, expressions, control flow, functions, input, output, and common programming practices.
6 Computer Memory
Learn how computer memory stores and addresses information, how RAM and ROM differ, and how caches and the memory hierarchy balance speed, capacity, and cost.
07 Trees and Binary Search Trees
A progressive guide to tree structure, binary-tree traversals, binary search tree operations, deletion, balancing, and the way tree height determines time and space costs.
10 — Data, Systems, and Applications
A progression through how data is organized, searched, exposed through software interfaces, and managed through abstraction layers in modern computer systems.
Interrupts
Reviews how interrupts support event handling and multitasking, and how Linux system calls use the RISC-V `ecall` instruction and register conventions.
OS Processes
This quiz covers process management, context switching and scheduling, multitasking, traps and interrupts, and RISC-V privilege transitions.
Systemcalls
A quiz on operating-system system calls, including privileged-operation requests, process creation and execution with fork, exec, and waitpid, and signal handling.