Back to the 2022 paper
Similar questions
DATABASE MANAGEMENT SYSTEMFind the highest normal form of a relation R(ABCD) with FD set (B→A, A→C, BC→D, AC→BE).20247mDatabase Management SystemFor relation: R(A,B,C); FDs={A \rightarrow B, B \rightarrow A}. Which statement is true? (i) A and B both are candidate keys (ii) Only A is key (iii) Only B is key (iv) Neither A nor B is key20252mDatabase Management SystemFor relation R(A,B,C,D,E) functional dependencies are given as follows: * A \rightarrow BC * CD \rightarrow E * B \rightarrow D Find candidate keys.20254mDatabase 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+)?20199m
PreviousWhich of the following is not a super key in R(V, W, X, Y, Z) with primary key VY? (i) VXYZ (ii) VWXZ (iii) VWXY (iv) VWXYZNextWhich of the following is a concurrency control protocol. (i) Strict 2-phase locking protocol (ii) Timestamp based protocol (iii) Graph based protocol (iv) All of the above
AI LearningWeb Platform
Coursify — Personal AI Course Generator
Struggling with a difficult subject or concept? Turn any engineering topic into a structured course with interactive lessons, quizzes, and research-backed explanations.