Back to the 2022 paper
Similar questions
Database Management SystemWhich of the following is *not* a feature of the relational database model? (i) Tables with rows and columns (ii) Use of SQL (iii) Pre-defined data access paths (iv) Data independence20242mDatabase Management SystemWhich of the following is true? (i) a super-key is always a candidate key. (ii) every 3NF schema is also a BCNF. (iii) generalization is bottom-up approach. (iv) none of these.20222mDatabase 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 SystemConsider the following relational schemes for a library database: Book (Title, Author, Catalog_no, Publisher, Year, Price), Collection (Title, Author, Catalog_no) with in the following functional dependencies: I. Title Author → Catalog_no II. Catalog_no → Title, Author, Publisher, Year III. Publisher Title Year → Price Analyze and find the highest normal form of the relation Book and Collection.20247m