Assignment - 1
Assignment - 1
1. Define insertion anomalies, deletion anomalies, and update anomalies. Provide an example for each
anomaly, demonstrating how poorly designed schemas can lead to data redundancy and inconsistency.
2. Given the following set of attributes and FDs, determine the minimal cover of the functional
dependencies and explain the reasoning behind each step. R(A, B, C, D, E)
FDs: A → B, BC → D, D → E, A → C
3. (a) Explain the concept of closure of a set of functional dependencies. How is it used in database
design?
(b) Given the following relation and FDs, compute the closure of the set of attributes {A, B}.R(A, B, C, D)
FDs: A → C, B → D, AB → C
4. Given the following relation, normalize it step-by-step from 1NF to BCNF and explain each step:
R(StudentID, CourseID, Instructor, Grade, Department)
Multi-valued dependencies: A →→ B, A →→ C
Decompose the relation into smaller relations. Check if the decomposition is lossless and whether it
preserves dependencies.
Is the functional dependency A → C implied by the given set of FDs? Justify your answer using closure or
Armstrong’s Axioms.
9. Discuss a situation where denormalization might be beneficial despite the anomalies that arise from
it. Provide examples from a practical application such as a data warehouse or OLAP system.
Demonstrate how this schema could suffer from update anomalies if it is not normalized. Perform
normalization to resolve the anomalies and explain the process.