Back to the 2025 paper
Similar questions
Database 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 SystemRelation R (ABCDEFGH) contains only atomic values for all of its attributes. F = {CH → G, A → BC, B → CFH, E → A, F → EG} is a set of functional dependencies (FDs) so that F is exactly the set of FDs that hold for R. (i) Find all the candidate keys the relation R have? (ii) Find the highest normal form with justification in which R exist?20227mDatabase 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 SystemFrom the instance of a relation scheme R (A, B, C) | A | B | C | |---|---|---| | 1 | 1 | 1 | | 1 | 1 | 0 | | 2 | 3 | 2 | | 2 | 3 | 2 | we can conclude that: (i) A functionally determines B and B functionally determines C (ii) A functionally determines B and B does not functionally determine C (iii) B does not functionally determine C (iv) A does not functionally determine B and B does not functionally determine C20192m
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