Match List I with List II. List I: A. BCNF, B. 3NF, C. 2NF, D. 4NF. List II: I. Removes multivalued dependency, II. Not always dependency preserving, III. Removes transitive dependency, IV. Removes partial functional dependency.
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. (A)-(II), (B)-(III), (C)-(IV), (D)-(I)
Explanation
BCNF decomposition is not always dependency preserving; 3NF removes transitive dependencies; 2NF removes partial dependencies; 4NF removes multivalued dependencies.
More Database Management Systems questions
- Statement I: Conservative 2PL is a deadlock-free protocol. Statement II: Thomas's write rule enforces conflict serializability. Statement I…
- Statement I: Composite attributes cannot be divided into smaller subparts. Statement II: Complex attributes are formed by nesting composite…
- The order of a leaf node in a B+ tree is the maximum number of (value, data record pointer) pairs it can hold. Given a block size of 1K byt…
- Which of the DBMS component ensures that concurrent execution of multiple operations on the database results into a consistent database sta…
- Consider following two statements: Statement I: Relational database schema represents the logical design of the database. Statement II: Cur…
- Given a fixed‐length record file that is ordered B on the key field. The file needs disk blocks to R store number of records. Find the aver…