Back to the 2022 paper
Similar questions
Database Management System2NF removes which kind of dependency? (i) Transitive (ii) Partial (iii) Functional (iv) Multivalued20242mDatabase Management SystemConsider the universal relation R = \{A, B, C, D, E, F, G, H, I\} and the set of functional dependencies F = \{\{A, B\} \rightarrow \{C\}, \{A\} \rightarrow \{D, E\}, \{B\} \rightarrow \{F\}, \{F\} \rightarrow \{G, H\}, \{D\} \rightarrow \{I, J\}\} What is the key for R? Decompose R into 2NF, then 3NF relations.201814mDatabase Management SystemYou are given the following set F of functional dependencies for a relation: R(A, B, C, D, E, F): F = {ABC → D, ABD → E, CD → F, CDF → B, BF → D} (i) Find all keys of R based on these functional dependencies. (ii) Is this relation in Boyce-Codd normal form? Is it 3NF? Explain your answer. (iii) Can the set F be simplified (by removing functional dependencies or by removing attributes from the left-hand side of functional dependencies) without changing the closure of F (i.e. F+)?20199mDatabase Management SystemDescribe the term MVD in the context of DBMS by giving an example. Discuss 4NF and 5NF also.20247m
PreviousWhen is the decomposition of relation schema R into two relation schemes X and Y, said to be a loss-less-join decomposition? Why is this property so important? Explain with example.NextDiscuss the concept of generalization, specialization and aggregation.
Official AppAndroid App
PYQDeck for Android
Solve BEU previous-year exam papers anywhere, anytime. Fast search, offline paper viewing, and step-by-step solutions designed specifically for your phone.