DBMS · Question 24 · Medium
DBMS question 24
Relation R(A, B, C, D) has the functional dependencies AB → CD and B → C, and AB is its only candidate key. What is the highest normal form R satisfies?
- 2NF
- 1NF
- 3NF
- BCNF
Answer and explanation
Answer: B. 1NF
Explanation: C is a non-prime attribute that depends on B, which is only part of the key AB. That partial dependency violates 2NF, so R is only in 1NF.
Previous: Relation R has 3 attributes and 5 tuples, and relation S has 4 attributes and… · Next: A sparse (non-dense) index has an entry for only some of the search-key…
Practise dbms
Try a fresh set of dbms questions with an explanation after every answer, free and without signing up: DBMS practice. Or sit a full placement mock test.
More dbms questions
- Relation R(A, B, C, D, E) has the functional dependencies A → B, BC → D and D…
- A one-to-many relationship 'works in' links Department (one) to Employee…
- Relation R has 3 attributes and 5 tuples, and relation S has 4 attributes and…
- A sparse (non-dense) index has an entry for only some of the search-key…
- Changing the internal storage of a database, for example adding an index or…
- Relation R(A, B, C, D) has the functional dependencies A → B, B → C and C → A…
- Relation R(A, B, C, D, E) has exactly two candidate keys, A and B. How many…
- Consider the schedule S: w1(X), r2(X), w2(Y), c2, c1, where ri, wi and ci are…
- Under the wound-wait deadlock-prevention scheme, an older transaction Ti…
More technical & programming practice
SQL · Operating Systems · Computer Networks · Software Engineering · Cloud & DevOps · GenAI Basics · Pseudo-code · C Programming
LogicWiz Exams home · All practice topics · Placement mock tests · Daily 10 challenge