Correct Answer: Each value of determines one value of
Explanation:
means that two rows with the same value must also have the same value.
Incorrect! Try again.
2In the dependency , which attribute is the determinant?
Functional Dependencies and Anomalies
Easy
A.Neither attribute
B.
C.
D.Both attributes
Correct Answer:
Explanation:
The attribute on the left side of a functional dependency is called the determinant.
Incorrect! Try again.
3Which anomaly occurs when the same fact must be changed in several rows?
Functional Dependencies and Anomalies
Easy
A.Update anomaly
B.Deletion anomaly
C.Selection anomaly
D.Insertion anomaly
Correct Answer: Update anomaly
Explanation:
An update anomaly occurs when duplicated data requires the same change in multiple rows.
Incorrect! Try again.
4Which anomaly may prevent adding a new department until at least one employee belongs to it?
Functional Dependencies and Anomalies
Easy
A.Sorting anomaly
B.Update anomaly
C.Insertion anomaly
D.Deletion anomaly
Correct Answer: Insertion anomaly
Explanation:
An insertion anomaly occurs when one fact cannot be stored without supplying an unrelated fact.
Incorrect! Try again.
5Which anomaly occurs when deleting a row unintentionally removes the only stored details about another entity?
Functional Dependencies and Anomalies
Easy
A.Indexing anomaly
B.Insertion anomaly
C.Update anomaly
D.Deletion anomaly
Correct Answer: Deletion anomaly
Explanation:
A deletion anomaly causes useful information to be lost when a related row is deleted.
Incorrect! Try again.
6What is a trivial functional dependency?
Functional Dependencies and Anomalies
Easy
A.A dependency whose right side contains no attributes from the table
B.A dependency that exists only when every table value is unique
C.A dependency whose right side is a subset of its left side
D.A dependency whose left side contains only candidate-key attributes
Correct Answer: A dependency whose right side is a subset of its left side
Explanation:
A dependency such as is trivial because the right side is contained in the left side.
Incorrect! Try again.
7What is the main cause of insertion, update, and deletion anomalies in poorly designed tables?
Functional Dependencies and Anomalies
Easy
A.A large number of users
B.Excessive data redundancy
C.Frequent database backups
D.Strong password policies
Correct Answer: Excessive data redundancy
Explanation:
Repeated storage of the same facts can create inconsistencies and modification anomalies.
Incorrect! Try again.
8What is the main purpose of database normalization?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Easy
A.Increase duplicated data
B.Store every attribute in one table
C.Replace all primary keys
D.Reduce redundancy and anomalies
Correct Answer: Reduce redundancy and anomalies
Explanation:
Normalization organizes tables to reduce repeated data and prevent modification anomalies.
Incorrect! Try again.
9Which requirement must a table satisfy to be in First Normal Form (1NF)?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Easy
A.Every field contains an atomic value
B.Every table has exactly two columns
C.Every non-key attribute determines the primary key through another attribute
D.Every attribute is a foreign key
Correct Answer: Every field contains an atomic value
Explanation:
A table is in 1NF when each field contains a single, indivisible value and repeating groups are removed.
Incorrect! Try again.
10Which value would violate 1NF if stored in a single PhoneNumber field?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Easy
A.555-0103
B.555-0104
C.555-0101
D.555-0101, 555-0102
Correct Answer: 555-0101, 555-0102
Explanation:
Storing multiple phone numbers in one field violates the 1NF requirement for atomic values.
Incorrect! Try again.
11A table must already be in which normal form before it can satisfy Second Normal Form (2NF)?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Easy
A.3NF
B.BCNF
C.1NF
D.Fourth Normal Form
Correct Answer: 1NF
Explanation:
A relation must first satisfy 1NF before it can be considered for 2NF.
Incorrect! Try again.
12Second Normal Form (2NF) primarily removes which type of dependency?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Easy
A.Partial dependency
B.Multivalued dependency
C.A dependency in which every determinant must be a superkey without exception
D.Trivial dependency
Correct Answer: Partial dependency
Explanation:
2NF removes dependencies in which a non-key attribute depends on only part of a composite candidate key.
Incorrect! Try again.
13When can a partial dependency occur?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Easy
A.When a candidate key is composite
B.When a table has no attributes
C.When every field contains NULL
D.When the database has only one table
Correct Answer: When a candidate key is composite
Explanation:
A partial dependency occurs when an attribute depends on only part of a key made from multiple attributes.
Incorrect! Try again.
14Third Normal Form (3NF) primarily removes which type of dependency involving non-key attributes?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Easy
A.Transitive dependency
B.Partial dependency
C.Reflexive dependency
D.Trivial dependency
Correct Answer: Transitive dependency
Explanation:
3NF removes transitive dependencies in which a non-key attribute depends on another non-key attribute.
Incorrect! Try again.
15Suppose and . Which dependency is transitive?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Easy
A.
B.
C.
D.
Correct Answer:
Explanation:
Because StudentID determines DeptID, which determines DeptName, StudentID transitively determines DeptName.
Incorrect! Try again.
16Which statement describes Boyce-Codd Normal Form (BCNF)?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Easy
A.Every non-key attribute may determine other non-key attributes if the table is in 1NF
B.Every attribute must contain a numeric value
C.Every relation must have exactly one candidate key
D.Every determinant is a candidate key
Correct Answer: Every determinant is a candidate key
Explanation:
In BCNF, the determinant of every non-trivial functional dependency must be a candidate key or superkey.
Incorrect! Try again.
17How does BCNF generally compare with 3NF?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Easy
A.BCNF is stricter than 3NF
B.BCNF allows repeating groups that are prohibited by all earlier normal forms
C.BCNF is weaker than 1NF
D.BCNF is identical to 2NF
Correct Answer: BCNF is stricter than 3NF
Explanation:
BCNF applies a stricter determinant requirement than 3NF.
Incorrect! Try again.
18What is denormalization?
Denormalization
Easy
A.Converting all text values into numbers
B.Intentionally adding redundancy to improve performance
C.Splitting every relation until each table contains only one column
D.Removing every index from a database
Correct Answer: Intentionally adding redundancy to improve performance
Explanation:
Denormalization deliberately introduces some redundant data, often to make read operations faster.
Incorrect! Try again.
19What is a common reason for denormalizing a database?
Denormalization
Easy
A.To ensure that each query scans every table and reconstructs all related records
B.To remove every candidate key
C.To reduce the number of joins
D.To guarantee elimination of redundancy
Correct Answer: To reduce the number of joins
Explanation:
Combining frequently accessed data can reduce joins and improve query performance.
Incorrect! Try again.
20What is a common disadvantage of denormalization?
Denormalization
Easy
A.Greater risk of inconsistent data
B.Complete prevention of update anomalies
C.Automatic removal of duplicate data
D.Guaranteed reduction in storage use
Correct Answer: Greater risk of inconsistent data
Explanation:
Because denormalization duplicates data, separate copies may become inconsistent when updates are not synchronized.
Incorrect! Try again.
21In the relation Enrollment(StudentID, CourseID, StudentName, CourseName, Grade), assume each student has one name and each course has one name. Which functional dependency is valid?
Functional Dependencies and Anomalies
Medium
A.StudentName -> StudentID
B.Grade -> CourseID
C.StudentID -> StudentName
D.CourseID -> Grade
Correct Answer: StudentID -> StudentName
Explanation:
A student identifier uniquely determines that student's name, so StudentID -> StudentName holds. A course can have many grades, and names are not necessarily unique.
Incorrect! Try again.
22A relation stores EmployeeID, EmployeeName, ProjectID, and ProjectName. The key is (EmployeeID, ProjectID), and EmployeeID -> EmployeeName. Which anomaly is most directly caused by this dependency?
Functional Dependencies and Anomalies
Medium
A.Deletion anomaly
B.Insertion anomaly
C.Selection anomaly
D.Update anomaly
Correct Answer: Update anomaly
Explanation:
Employee details are repeated for every project assigned to the employee. Changing the employee's name requires updating multiple rows, creating an update anomaly.
Incorrect! Try again.
23Consider OrderLine(OrderID, ProductID, ProductName, Quantity), where (OrderID, ProductID) is the key and ProductID -> ProductName. What problem exists in this relation?
Functional Dependencies and Anomalies
Medium
A.A transitive dependency
B.A partial dependency
C.A join dependency
D.A multivalued dependency
Correct Answer: A partial dependency
Explanation:
ProductName depends only on ProductID, which is part of the composite key (OrderID, ProductID). This is a partial dependency.
Incorrect! Try again.
24A university relation contains (StudentID, CourseID, InstructorID) with the dependencies StudentID, CourseID -> InstructorID and InstructorID -> CourseID. Which attribute set is also a candidate key?
Functional Dependencies and Anomalies
Medium
A.(StudentID, CourseID, InstructorID)
B.(CourseID, InstructorID)
C.(StudentID, InstructorID)
D.(InstructorID)
Correct Answer: (StudentID, InstructorID)
Explanation:
From (StudentID, InstructorID), InstructorID determines CourseID, so the set determines all attributes. Neither attribute alone is sufficient, making it a candidate key.
Incorrect! Try again.
25If a relation has the dependency chain A -> B and B -> C, which dependency follows by transitivity?
Functional Dependencies and Anomalies
Medium
A.C -> B
B.A -> B -> C
C.A -> C
D.B -> A
Correct Answer: A -> C
Explanation:
By Armstrong's transitivity rule, if A -> B and B -> C, then A -> C.
Incorrect! Try again.
26A table records SupplierID, SupplierName, PartID, and PartPrice. A supplier can supply many parts, and a part can be supplied by many suppliers. Which issue is most likely if all data remains in one table?
Functional Dependencies and Anomalies
Medium
A.Loss of all candidate keys
B.Violation of atomicity only
C.Automatic prevention of deletion
D.Repeated supplier and part facts
Correct Answer: Repeated supplier and part facts
Explanation:
The many-to-many relationship causes supplier and part details to be repeated across rows. This can lead to update, insertion, and deletion anomalies.
Incorrect! Try again.
27Which design satisfies First Normal Form (1NF)?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Medium
A.A table storing comma-separated phone numbers
B.A table with one atomic value per cell
C.A table containing repeating column groups
D.A table with nested records in one attribute
Correct Answer: A table with one atomic value per cell
Explanation:
1NF requires each attribute value to be atomic and prohibits repeating groups or multivalued fields within a single cell.
Incorrect! Try again.
28A relation is in 1NF with composite key (A, B) and dependency A -> C. What additional condition is required for the relation to be in 2NF?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Medium
A.C must depend on both A and B
B.C must be a candidate key
C.B must determine A
D.A must depend on C
Correct Answer: C must depend on both A and B
Explanation:
2NF eliminates partial dependencies. Every non-key attribute must depend on the whole composite key, not just part of it.
Incorrect! Try again.
29Consider Employee(EmployeeID, DepartmentID, DepartmentName) with EmployeeID -> DepartmentID and DepartmentID -> DepartmentName. Which normal form is violated by the dependency structure?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Medium
A.2NF
B.3NF
C.1NF
D.BCNF only
Correct Answer: 3NF
Explanation:
DepartmentName depends transitively on the key: EmployeeID -> DepartmentID -> DepartmentName. Removing this transitive dependency is required for 3NF.
Incorrect! Try again.
30A relation has candidate key K and functional dependency K -> A, where A is a non-key attribute. Which statement is correct?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Medium
A.This dependency is allowed in 3NF
B.This dependency violates 1NF
C.This dependency violates BCNF
D.This dependency proves a partial dependency
Correct Answer: This dependency is allowed in 3NF
Explanation:
A candidate key determining a non-key attribute is expected and does not violate 3NF. It also satisfies BCNF because the determinant is a superkey.
Incorrect! Try again.
31For a relation to satisfy BCNF, every nontrivial functional dependency must have what property?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Medium
A.X contains one attribute
B.X is a superkey
C.Y is a superkey
D.Y contains one attribute
Correct Answer: X is a superkey
Explanation:
BCNF requires the determinant of every nontrivial functional dependency to be a superkey.
Incorrect! Try again.
32A relation has candidate keys (A, B) and (B, C). A non-key attribute D depends on B alone. Which normal form is definitely violated?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Medium
A.2NF
B.None of these
C.1NF
D.3NF
Correct Answer: 2NF
Explanation:
B is a proper subset of both composite candidate keys, and B -> D is a partial dependency on a non-key attribute. Therefore, 2NF is violated.
Incorrect! Try again.
33A relation R(A, B, C) has dependencies A -> B and B -> C, with A as the only candidate key. Which decomposition best removes the transitive dependency?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Medium
A.R1(A, B) and R2(B, C)
B.R1(A, C) and R2(A, B, C)
C.R1(A) and R2(B, C)
D.R1(A, B, C) and R2(C)
Correct Answer: R1(A, B) and R2(B, C)
Explanation:
Separating A -> B and B -> C into two relations removes the transitive dependency while preserving the relevant relationships.
Incorrect! Try again.
34A relation R(Student, Course, Instructor) has dependencies Student, Course -> Instructor and Instructor -> Course. Which dependency causes a BCNF violation?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Medium
A.Student, Course -> Instructor
B.Course -> Instructor
C.Student -> Course
D.Instructor -> Course
Correct Answer: Instructor -> Course
Explanation:
Instructor is not a superkey because it does not determine Student. Therefore, Instructor -> Course violates BCNF.
Incorrect! Try again.
35Which statement best describes a lossless-join decomposition?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Medium
A.Joining the decomposed tables reconstructs the original relation
B.The decomposition prevents all future redundancy
C.The decomposition guarantees fewer total rows
D.The decomposition removes every foreign key
Correct Answer: Joining the decomposed tables reconstructs the original relation
Explanation:
A lossless decomposition preserves the original information because the natural join of the decomposed relations produces exactly the original relation.
Incorrect! Try again.
36Why can a 3NF decomposition be preferred over a BCNF decomposition in some designs?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Medium
A.3NF can preserve dependencies more reliably
B.3NF eliminates all foreign keys
C.3NF always uses fewer relations
D.3NF permits repeating groups
Correct Answer: 3NF can preserve dependencies more reliably
Explanation:
BCNF may require decompositions that do not preserve every functional dependency. 3NF often provides dependency preservation while still removing major redundancy.
Incorrect! Try again.
37A reporting system frequently joins five normalized tables to display a product summary. Which denormalization strategy could reduce query cost?
Denormalization
Medium
A.Remove constraints from every table
B.Replace all keys with free text
C.Store selected summary attributes together
D.Duplicate every table without changes
Correct Answer: Store selected summary attributes together
Explanation:
Maintaining a carefully chosen summary table or denormalized view can reduce repeated joins for read-heavy reporting workloads.
Incorrect! Try again.
38What is the primary trade-off when storing CustomerName in both Customer and Order tables?
Denormalization
Medium
A.Stronger normalization but more joins
B.Slower reads but fewer candidate keys
C.Faster reads but greater update risk
D.More atomic values but less indexing
Correct Answer: Faster reads but greater update risk
Explanation:
Duplicating customer data can avoid a join during order queries, but every name change must update multiple locations consistently.
Incorrect! Try again.
39A database stores a cached OrderTotal in the Orders table even though it can be calculated from OrderLine rows. What risk does this introduce?
Denormalization
Medium
A.The cached value may become inconsistent
B.The order can no longer have a primary key
C.The database cannot perform joins
D.The line items become non-atomic
Correct Answer: The cached value may become inconsistent
Explanation:
Whenever line quantities or prices change, the cached total must also be updated. Missing an update can make stored and calculated totals disagree.
Incorrect! Try again.
40Which workload most strongly justifies selective denormalization?
Denormalization
Medium
A.Systems requiring strict minimal redundancy
B.Tables whose attributes are not yet defined
C.Read-heavy queries with stable duplicated data
D.Write-heavy transactions with frequent changes
Correct Answer: Read-heavy queries with stable duplicated data
Explanation:
Denormalization is most useful when reducing joins improves frequent reads and the duplicated information changes infrequently enough to manage consistency.
Incorrect! Try again.
41For relation , let . Which set contains all and only the candidate keys of ?
Functional Dependencies and Anomalies
Hard
A.
B.
C.
D.
Correct Answer:
Explanation:
and contain all attributes. Also, and . Each set is minimal, while the other proposed sets include nonkeys or nonminimal superkeys.
Incorrect! Try again.
42Given , which functional dependency is implied by ?
Functional Dependencies and Anomalies
Hard
A.
B.
C.
D.
Correct Answer:
Explanation:
From , derive using , then using , and finally using . None of the other dependencies follows from the given set.
Incorrect! Try again.
43Consider . Which set is a minimal cover equivalent to ?
Functional Dependencies and Anomalies
Hard
A.
B.
C.
D.
Correct Answer:
Explanation:
After splitting , the dependency follows transitively from and . Also, follows from by augmentation, so both are redundant.
Incorrect! Try again.
44Relation satisfies . Assuming atomic attributes, what is the highest normal form of ?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Hard
A.Third Normal Form
B.First Normal Form only
C.Boyce-Codd Normal Form
D.Second Normal Form
Correct Answer: Second Normal Form
Explanation:
is the only candidate key because and then . A single-attribute key prevents partial dependencies, so 2NF holds. However, violates 3NF because is not a superkey and is nonprime.
Incorrect! Try again.
45For with , which classification is correct?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Hard
A.It is in BCNF but not in 4NF
B.It is in 3NF but not in BCNF
C.It is in 2NF but not in 3NF
D.It is in 1NF but not in 2NF
Correct Answer: It is in 3NF but not in BCNF
Explanation:
The candidate keys are and , so every attribute is prime. Thus satisfies 3NF because is prime, but it violates BCNF because is not a superkey.
Incorrect! Try again.
46For with , a BCNF decomposition uses the violating dependency and produces and . Which statement is correct?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Hard
A.The decomposition is lossless but not dependency preserving
B.The decomposition is lossy and not dependency preserving
C.The decomposition is lossy and dependency preserving
D.The decomposition is lossless and dependency preserving
Correct Answer: The decomposition is lossless but not dependency preserving
Explanation:
The common attribute is , and , so the decomposition is lossless. However, the projected dependencies do not allow to be enforced without joining the decomposed relations.
Incorrect! Try again.
47A binary decomposition of into and is lossless with respect to exactly when which condition holds?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Hard
A. and is in
B. and is in
C. or is in
D. or is in
Correct Answer: or is in
Explanation:
For a binary decomposition, the shared attributes must functionally determine every attribute of at least one component. This is the lossless-join criterion based on .
Incorrect! Try again.
48For with minimal cover , which decomposition is produced directly by the standard dependency-preserving 3NF synthesis algorithm after removing no subsumed schemas?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Hard
A.
B.
C.
D.
Correct Answer:
Explanation:
The synthesis algorithm creates one relation for each determinant together with its dependent attributes: , , and . The schema contains the original candidate key , ensuring a lossless decomposition.
Incorrect! Try again.
49An enrollment table has key and dependencies , , and . If deleting the final enrollment for a course also removes the only stored facts about its instructor, which anomaly occurs?
Functional Dependencies and Anomalies
Hard
A.An insertion anomaly
B.A deletion anomaly
C.An update anomaly
D.A join anomaly
Correct Answer: A deletion anomaly
Explanation:
Deleting an enrollment unintentionally destroys independent instructor information. This is a deletion anomaly caused by storing facts about multiple entities in one relation.
Incorrect! Try again.
50A column stores geographic coordinates as a single value such as POINT(12.4, 18.7), and the DBMS treats the entire value as indivisible for relational operations. What is the most accurate conclusion about 1NF?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Hard
A.It violates 1NF unless the value is stored in two relations
B.It satisfies 1NF if POINT is atomic in the defined domain
C.It violates 1NF because the value has two conceptual components
D.It satisfies 1NF only if both coordinates are candidate keys
Correct Answer: It satisfies 1NF if POINT is atomic in the defined domain
Explanation:
Atomicity is relative to the domain and supported operations. A structured value may satisfy 1NF when the DBMS treats it as one domain value rather than as a repeating group.
Incorrect! Try again.
51A current instance of happens to contain no two tuples with the same value. Which conclusion about the schema-level dependency is valid?
Functional Dependencies and Anomalies
Hard
A. is proven because the current instance satisfies it
B. is disproven because duplicate values are absent
C. holds in this instance but is not thereby proven semantically
D. becomes a key constraint for all future instances
Correct Answer: holds in this instance but is not thereby proven semantically
Explanation:
An FD is a semantic constraint intended to hold in every valid instance. A particular instance can satisfy an FD accidentally, so sample data alone does not establish the dependency.
Incorrect! Try again.
52Let satisfy . Assuming 1NF, what is the highest normal form of ?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Hard
A.Third Normal Form
B.First Normal Form
C.Boyce-Codd Normal Form
D.Second Normal Form
Correct Answer: First Normal Form
Explanation:
The candidate keys are and . Attribute is nonprime, and makes it dependent on the proper subset of candidate key . Therefore, the relation violates 2NF.
Incorrect! Try again.
53For with candidate key and dependencies and , what is the highest normal form, assuming no other nontrivial dependencies and atomic values?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Hard
A.Boyce-Codd Normal Form
B.Second Normal Form
C.First Normal Form only
D.Third Normal Form
Correct Answer: Second Normal Form
Explanation:
Neither nonprime attribute depends on a proper subset of , so 2NF holds. The dependency violates 3NF because is not a superkey and is not prime.
Incorrect! Try again.
54A system stores a denormalized monthly sales total alongside normalized transaction rows. Which design most directly prevents committed transactions from leaving the total inconsistent with its source rows?
Denormalization
Hard
A.Allow applications to update the total in separate transactions
B.Cache the total indefinitely and invalidate it after reporting
C.Recompute the total asynchronously during low-traffic periods
D.Update the rows and total atomically in one transaction
Correct Answer: Update the rows and total atomically in one transaction
Explanation:
Atomic maintenance ensures that the source rows and redundant total commit or roll back together. Triggers or equivalent transactional logic can enforce this invariant.
Incorrect! Try again.
55Which situation provides the strongest justification for deliberately denormalizing a BCNF design?
Denormalization
Hard
A.Storage is scarce, and redundant attributes are expected to reduce the database size
B.Developers prefer fewer tables, although no workload measurements or maintenance rules exist
C.The schema contains update anomalies, and duplicating more attributes makes updates easier to write
D.Measured read latency is dominated by repeated joins, and controlled redundancy meets the consistency budget
Correct Answer: Measured read latency is dominated by repeated joins, and controlled redundancy meets the consistency budget
Explanation:
Denormalization is justified by demonstrated workload benefits when the additional storage and consistency-maintenance costs are explicitly controlled. Convenience alone is not sufficient.
Incorrect! Try again.
56For with , consider the decomposition and . Which property combination is correct?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Hard
A.Lossless but not dependency preserving
B.Lossy but dependency preserving
C.Lossless and dependency preserving
D.Lossy and not dependency preserving
Correct Answer: Lossless but not dependency preserving
Explanation:
The intersection is , and , so the decomposition is lossless. The projections include and , but they cannot enforce the original dependency without a join.
Incorrect! Try again.
57Which statement best explains why a designer might select a 3NF decomposition instead of a BCNF decomposition?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Hard
A.Every 3NF relation automatically satisfies the stricter determinant rule of BCNF
B.A 3NF decomposition can preserve all dependencies when no lossless BCNF decomposition does
C.Every 3NF decomposition removes more redundancy than every BCNF decomposition
D.A 3NF decomposition is always lossless, whereas a BCNF decomposition is always lossy
Correct Answer: A 3NF decomposition can preserve all dependencies when no lossless BCNF decomposition does
Explanation:
The 3NF synthesis algorithm guarantees dependency preservation and can guarantee a lossless join. BCNF removes more FD-based redundancy, but some BCNF decompositions cannot preserve every original dependency.
Incorrect! Try again.
58When testing whether a relation is in BCNF, which set of dependencies must be considered?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Hard
A.Every nontrivial dependency in the closure
B.Only the dependencies explicitly listed in the original specification
C.Only the dependencies appearing in one selected minimal cover
D.Only dependencies whose right side is a nonprime attribute
Correct Answer: Every nontrivial dependency in the closure
Explanation:
BCNF requires the determinant of every nontrivial FD that holds on the relation to be a superkey. Therefore, implied dependencies in matter, not merely those explicitly listed.
Incorrect! Try again.
59A line-item relation stores , where . What is the principal normalization risk of storing LineTotal?
Denormalization
Hard
A.It makes the composite identifier cease to be a candidate key
B.It prevents Quantity and UnitPrice from remaining atomic values
C.It guarantees a lossy join whenever order data is decomposed
D.It creates redundant derived data that can become inconsistent after updates
Correct Answer: It creates redundant derived data that can become inconsistent after updates
Explanation:
The total is derivable from other stored attributes. If quantity or price changes without recomputing the total, the relation contains inconsistent facts—an intentional denormalization cost.
Incorrect! Try again.
60Let satisfy . What is the highest normal form of ?
Normalization Concepts and Forms (1NF, 2NF, 3NF, BCNF)
Hard
A.Third Normal Form but not Boyce-Codd Normal Form
B.Second Normal Form but not Third Normal Form
C.Boyce-Codd Normal Form
D.First Normal Form only
Correct Answer: Third Normal Form but not Boyce-Codd Normal Form
Explanation:
The candidate keys are , , and , making every attribute prime. Thus and satisfy 3NF through prime right-hand attributes, but they violate BCNF because neither nor is a superkey.
Incorrect! Try again.
Did this save you a night before the exam?
LPU Notes is free, and it stays free. Ads cover part of the server bill.
The rest comes out of a student's own pocket: the domain, the storage,
and keeping the site up through the weeks everyone needs it at once.
The payment button didn't load. An ad blocker or a filtered network is the usual reason.
to try again.
Nothing here is ever locked, and nothing unlocks. Chip in only if it was worth it.
What it pays for →