Which standard relational database normalization stage eliminates partial functional dependencies on candidate keys, requiring every non-prime attribute to be fully functionally dependent on the primary key?
Answer and explanation
Correct answer: C. Second Normal Form
- Step 1: 2NF requires a table to be in 1NF and have no non-prime attributes dependent on a proper subset of any composite candidate key. Step 2. Tables with single-attribute primary keys in 1NF are automatically in 2NF. Answer: Second Normal Form. Why not the others: 1NF eliminates repeating groups; 3NF eliminates transitive dependencies; BCNF eliminates all functional determinant anomalies.
Practise more Computer Systems, Networking and ICT.
Free questions with an explanation for every one, and full timed Bangladesh Civil Service Preliminary Examination mock tests.
More Computer Systems, Networking and ICT questions
- Which internal CPU register holds the memory address of the next machine instruction to be fetched and executed by the processor?
- Which type of computer memory provides the fastest read and write access times directly to the arithmetic logic unit?
- How many distinct memory addresses can be uniquely referenced by a microprocessor with a 32-bit address bus?
- What is the hexadecimal equivalent of the 8-bit binary number 11011010_2?
- Which logic gate outputs a binary 1 if and only if its two binary inputs are unequal (one is 1 and the other is 0)?
- Which two digital logic gates are considered universal gates because any combinational circuit can be constructed solely using either of the…