ASSIGNMENT QUESTIONS
Q1. A relation R(A, B, C, D) stores employee project information.
You are told that:
Each employee (A) works in exactly one department (B)
A department (B) can handle multiple projects (C)
Each project (C) has only one project manager (D)
Which of the following functional dependencies are correct?
Explain your reasoning.a)A->B,b)B->C,c)C->D,d)A->D
Q2. In a relation R(StudentID, CourseID, Instructor, Room):
Each course is taught by one instructor
An instructor teaches in only one room
A student can enroll in multiple courses
Identify all valid functional dependencies and justify why StudentID does NOT determine Room.
Q3. Consider the relation R(X, Y, Z) with the following statements:
X uniquely identifies Y
Z uniquely identifies Y
X and Z together identify all attributes
Which of the following sets of functional dependencies best represents the situation?
a) X → Y, Z → Y
b) XZ → Y
c) Y → X, Y → Z
d) X → Z, Z → X
Explain why the incorrect options fail logically.
Q4. A database stores Vehicle(RegNo, OwnerName, OwnerAddress, LicenseNo).
Given:
Each vehicle registration number is unique
One owner can have multiple vehicles
Each license number belongs to exactly one owner
Identify the correct functional dependencies and explain why
OwnerName → RegNo is invalid.
Q5. For relation R(A, B, C, D) with candidate key (A, B), consider the FDs:
A→C
B→D
Does the relation suffer from partial dependency?
Explain your answer in terms of key attributes vs non-key attributes.
Q6. A relation R(P, Q, R) satisfies the dependency P → Q.
Which of the following statements is always true?
a)Q functionally determines P
b) For every value of P, there is only one value of Q
c) P is a candidate key
d) Q cannot be part of any key
Explain your choice.
Q7. If AB → C and C → D are given, which of the following is correct?
a) A → D
b) B → D
c) AB → D
d) D → AB
Justify the correct answer using transitivity.
Q8Consider a relation R(A, B, C, D) with the following functional dependencies:
A→B
B→C
CD → A
Without computing full attribute closures, identify the candidate key(s) of R.
Explain why A alone is not a candidate key.
Q9Find the candidate key from a given relation R(P, Q, R, S) satisfies:
PQ → R
R→S
Q10. For relation R(StudentID, CourseID, Instructor, Grade), assume:
A student can enroll in multiple courses
Each course is taught by only one instructor
A grade is assigned per student per course
Identify the candidate key(s) and justify why
(StudentID, Instructor) is not a candidate key.
Q11. Find CK from given relation R(A, B, C, D, E) with FDs:
A→B
C→D
DE → A
[Link] CK by considering relation R(A, B, C) with FDs:
A→B
B→A
Justify your answer.
Q13. A relation R(M, N, O, P) satisfies:
M→N
O→P
Which attribute(s) must definitely be part of every candidate key?
Explain your reasoning.
Q14. Consider relation R(A, B, C) with two sets of functional dependencies:
F₁:A → B, B → C
F₂:A → C, A → B
Are F₁ and F₂ equivalent?
Explain your answer by discussing dependency implication, not by computing full closures.
Q15. For relation R(P, Q, R), consider the FD sets:
F₁:P → Q, Q → R
F₂:P → R
Determine whether F₁ ≡ F₂.
Justify whether equivalence requires mutual implication.
Q.15. Consider relation R(A, B, C) with functional dependencies:
A→B
B→C
A→C
Without computing full closures, determine whether A → C is redundant.
Explain how transitivity helps in identifying redundancy.
Q.16. For relation R(A, B, C, D), the FD set is: AB → C, A → D
Is attribute B extraneous in AB → C?
Explain your reasoning based on attribute necessity, not calculation.
Q17. Given relation R(P, Q, R, S):
F: P → QR, Q → R, P → S
Which dependency is unnecessary when constructing the canonical cover?
Justify your answer.
Q.17. Consider the FD set on relation R(A, B, C):
A → BC
Which of the following is true about its minimal cover?
a)A → BC must remain unchanged
b) A → B and A → C must both appear
c) Only A → B is required
d) Only A → C is required
Explain your choice.
Q18. For relation R(A, B, C, D), consider:
ABC → D
A→B
Which attribute(s), if any, can be removed from the left-hand side of ABC → D when finding the
minimal cover?
Explain your reasoning.
Q19. Given relation R(X, Y, Z, W) with:
X→Y
Y→Z
X→Z
Z→W
Identify which FD(s) will be removed in the irreducible cover and explain why.
Q.20. Two FD sets are given on relation R(A, B, C, D):
F₁:
A→B
B→C
A→C
C→D
F₂:
A→B
B→C
C→D
Are F₁ and F₂ both valid canonical covers?
Explain your answer.
Q.21. Why can two different minimal covers exist for the same FD set, yet still be considered
correct?
Answer with respect to equivalence and redundancy, not procedure.
Q22. Given relation R(A, B, C, D) with functional dependencies:
A→B
B→C
C→D
Without calculating the full closure, determine which attributes are definitely included in A⁺.
Explain why A alone is sufficient to derive all attributes.
Q.24or relation R(P, Q, R, S), the FD set is:
P→Q
R→S
Which attributes will never appear in P⁺?
Explain your reasoning.
Q25. Consider relation R(A, B, C) with:
A→B
B→A
Compare A⁺ and B⁺.
Are the two closures identical?
Explain what this implies about key attributes.
Q.26Given relation R(X, Y, Z, W) with FDs:
X→Y
Y→Z
XZ → W
Without computing stepwise closure, explain why W is included in X⁺.
Q27. In relation R(A, B, C, D) with:
AB → C
C→D
Which attribute(s) cannot be determined by A⁺ alone?
Explain your answer.
Q28. Given FD set F on R(A, B, C):
A→B
AB → C
A student claims that A⁺ = {A, B, C}.
Is the claim correct?
Justify your answer using closure reasoning.
Q29. Given relation R(A, B, C, D):
A→B
C→D
Compare (AC)⁺ and A⁺.
Explain why one closure is strictly larger than the other.
Q30. If X⁺ = {X, Y, Z}, which of the following must be true?
a) X → Y
b) Y → Z
c) X → Z
d) Z → X
Explain your answer.
Q.31Why is attribute closure considered a fundamental tool for:
Finding candidate keys
Checking FD equivalence
Computing minimal covers
Answer in brief.
Q32. A relation STUDENT(StudentID, Name, PhoneNumbers) stores multiple phone numbers for a
student in a single attribute separated by commas.
Without converting the table, explain whether the relation satisfies 1NF.
If not, identify the exact reason for violation.
Q33. Consider the relation ENROLLMENT(StudentID, CourseID, StudentName, CourseName) with:
Candidate key: (StudentID, CourseID)
Each student has exactly one name
Each course has exactly one course name
The relation is already in 1NF.
Explain whether it satisfies 2NF, and justify your answer using partial dependency.
Q34. A relation R(A, B, C, D) has candidate key (A, B) and the following dependencies:
A→C
B→D
Is the relation in 2NF?
Explain why the presence of multiple partial dependencies affects normalization.
Q35. Consider relation EMP(EmpID, DeptID, DeptName) with:
EmpID → DeptID
DeptID → DeptName
The primary key is EmpID.
Determine whether the relation is in 2NF and 3NF.
Explain your answer focusing on transitive dependency.
Q36. A relation R(P, Q, R) satisfies:
P→Q
Q→R
Assuming P is the primary key, identify the highest normal form satisfied by the relation.
Explain your reasoning.
Q37. The relation SALES(OrderID, ProductID, ProductName, Quantity) has:
Candidate key: (OrderID, ProductID)
ProductID → ProductName
Is the relation in 2NF?
Explain why Quantity does not affect the normal form decision.
Q38. A relation R(A, B, C) has the following dependencies:
A→B
B→A
Attribute C is not functionally dependent on A or B.
Determine whether the relation is in 3NF.
Explain the role of prime and non-prime attributes in your answer.
Q39. Consider relation R(A, B, C, D) with:
AB → C
C→D
The candidate key is AB.
Is the relation in 3NF?
Justify your answer using the formal 3NF condition.
Q.40. A student claims: “If a relation is in 2NF, it must also be in 3NF.”
Using a suitable reasoning (no example required), explain whether this statement is true or false.
Q41. Explain why removing partial dependencies leads to 2NF, but removing transitive dependencies
leads to 3NF.
Your answer should focus on dependency paths, not definitions.
Q42. A relation STUDENT(StudentID, Name, Subjects) stores multiple subjects for a student in a
single attribute.
Explain why decomposition is required to achieve 1NF and describe how many relations will result
after decomposition (no schema writing required).
Q43. Consider relation ENROLLMENT(StudentID, CourseID, StudentName, CourseName) with:
Candidate key: (StudentID, CourseID)
StudentID → StudentName
CourseID → CourseName
The relation is already in 1NF.
Explain why decomposition is still required for 2NF and identify the type of dependencies that cause
decomposition.
Q44. A relation R(A, B, C, D) has:
Candidate key: (A, B)
A→C
B→D
Explain how many relations will be formed when decomposing into 2NF and justify your answer.
Q45. Consider relation EMP(EmpID, DeptID, DeptName) with:
EmpID → DeptID
DeptID → DeptName
Explain why the first decomposition removes partial dependency but not transitive dependency, and
why another decomposition is required for 3NF.
Q46. A relation R(P, Q, R) satisfies:
P→Q
Q→R
Assuming P is the primary key, explain:
1. Why decomposition is not needed for 2NF
2. Why decomposition is needed for 3NF
Q47. The relation SALES(OrderID, ProductID, ProductName, Quantity) has:
Candidate key: (OrderID, ProductID)
ProductID → ProductName
Explain which attribute(s) cause decomposition into 2NF and why Quantity remains in the original
relation.
Q48. The relation SALES(OrderID, ProductID, ProductName, Quantity) has:
Candidate key: (OrderID, ProductID)
ProductID → ProductName
Explain which attribute(s) cause decomposition into 2NF and why Quantity remains in the original
relation.
Q49. While decomposing a relation into 3NF, why is it important that the decomposition is:
Lossless
Dependency preserving
Explain in brief with respect to data consistency, not definition
Q50. Explain how the nature of functional dependencies determines:
The number of decomposed relations
The normal form achieved
Your answer should focus on dependency paths, not formulas.
Q51. A student decomposes a relation directly from 1NF to 3NF without checking 2NF.
Is this approach logically correct?
Explain when this shortcut works and when it may fail.
Q52. A relation R(A, B, C, D) has:
AB → C
C→D
Explain:
Why the first decomposition removes partial dependency
Why a second decomposition is still required to reach 3NF
Q.53. An online shopping transaction involves:
Deducting money from the customer’s account
Reducing product stock
Generating an order ID
If the system crashes after money is deducted but before the order ID is generated, explain how the
Atomicity property handles this situation.
Q54. Two transactions T₁ and T₂ are executing concurrently on a railway reservation system and both
attempt to book the last available seat.
Explain how the Isolation property prevents an incorrect final state, even though both transactions
run at the same time.
Q.55. A transaction successfully updates a student’s exam result and displays a “Transaction
Successful” message.
Immediately after this, a power failure occurs.
Explain how Durability guarantees that the updated result is not lost.
Q.56. Explain why Atomicity and Durability are both required for reliable transactions.
What problem would arise if Atomicity exists without Durability?
Q57. In a ticket booking system:
Seat is allocated
Passenger details are saved
Payment is confirmed
Explain which ACID properties are involved at each step and why violation of any one property can
lead to inconsistency.
Q58. If a transaction violates Consistency, does it necessarily violate Atomicity?
Explain your answer with reasoning.
Q59. Explain the difference between Consistency and Isolation using a single transaction vs
concurrent transactions perspective.
Q.60. A relation STUDENT_COURSE(StudentID, StudentName, CourseID, CourseName) stores student
and course details together.
Explain why it is not possible to insert a new course unless at least one student is enrolled.
Identify the type of anomaly involved.
Q.61. In the relation EMP_DEPT(EmpID, EmpName, DeptID, DeptName), if the last employee of a
department resigns, the department details are also removed.
Explain:
1. Why this situation leads to an anomaly
2. Which normal form violation causes this problem
Q62. A relation PRODUCT_ORDER(ProductID, ProductName, SupplierName, OrderID) stores supplier
details repeatedly for each order.
Explain how updating the SupplierName in only one tuple can lead to inconsistency.
Identify the anomaly and explain why normalization prevents it.
Q63. Explain why anomalies are design problems, not execution or user errors.
Relate your answer to poor schema design.
Q64. Consider relation ENROLLMENT(StudentID, CourseID, StudentName, CourseName) with:
Candidate key: (StudentID, CourseID)
StudentID → StudentName
CourseID → CourseName
Explain which anomalies still exist and why decomposition into 2NF removes them.
Q65. A relation EMP(EmpID, DeptID, DeptName, Location) satisfies:
EmpID → DeptID
DeptID → DeptName, Location
Explain which anomalies remain if the relation is only in 2NF and how 3NF decomposition eliminates
them.
Q.66. Is it possible for a relation to be in 2NF and still suffer from update anomaly?
Explain your answer with reasoning (no example required).
Q67. Explain how insert, delete, and update anomalies are related to:
Data redundancy
Functional dependencies
Your answer should focus on understanding, not definitions.