Back to the 2025 paper
Similar questions
Database 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 SystemConsider R (A, B, C, D, E) with following FDs:- A → B, A → C, CD → E, B → D, E → A which of the following FDs is not implied by above set? (i) CD → AC (ii) BD → CD (iii) BC → CD (iv) AC → BC20222mDatabase Management SystemWhich statement is FALSE? (i) Every weak entity depends on a strong entity (ii) A weak entity can have a partial key (iii) Every many-to-many relationship becomes a separate relation (iv) Every relation generated from ER always has a single candidate key20252mDatabase Management SystemWhich of the following is true? (i) Every relation in 3NF is also in BCNF (ii) A relation R is in 3NF if very non-prime attribute of R is fully functionally dependent on every key of R (iii) Every relation in BCNF is also in 3NF (iv) No relation can be in both BCNF and 3NF20192m
PreviousWhich statement is FALSE? (i) Every weak entity depends on a strong entity (ii) A weak entity can have a partial key (iii) Every many-to-many relationship becomes a separate relation (iv) Every relation generated from ER always has a single candidate keyNextThe relational algebra expression \pi_A(R) - \pi_A((\pi_A(R) \times S) - R) is equivalent to: (i) Selection (ii) Join (iii) Division (iv) Projection
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.