Consider a relation scheme R = (A, B, C, D, E, H) on which the following 1 functional dependencies hold: {A->B, BC-> D, E->C, D->A}. Write the Apply 5 candidate keys of R? Consider the following relational schemes for a library database: Book (Title, Author, Catalog_no, Publisher, Year, Price) Collection (Title, Author, Catalog_no) the following are functional dependencies: 2 a. Title Author --> Catalog_no b. Catalog_no --> Title Author Publisher Year c. Publisher Title Year --> Price d. Assume {Author, Title} is the key for both schemes. Apply the appropriate normal form for Book and Cancellation? Consider a schema R (A, B, C, D) and functional dependencies A -> B and C ->D. 3 Solve and find whether the decomposition of R into R1 (A, B) and R2(C, D) Apply 5 belongs to which one or both (dependency preserving and loss less join)? 4 Show that: if and then Apply 5\

Let E1 and E2 be two entities in an E/R diagram with simple single-valued attributes. R1 and R2 are two relationships between E1 and E2, where R1 is one1 to-many and R2 is many-to-many. R1 and R2 do not have any attributes of their Apply 3 own. Calculate the minimum number of tables required to represent this situation in the relational model? 2 Analyze and find whether View exists if the table is dropped from the database? Ana yze 10 3 We can convert any weak entity set to strong entity set by simply adding Ana yze 3 appropriate attributes. Analyze why, then, do we have weak entity sets? UNIT - II Consider the following relational schema Employee (empno,name,office,age) Books(isbn,title,authors,publisher) Loan(empno, isbn,date) Write the following queries in relational algebra. a. Find the names of employees who have borrowed a book Published by 1 McGraw-Hill? Apply 10 b. Find the names of employees who have borrowed all books Published by McGraw-Hill? c. Find the names of employees who have borrowed more than five different books published by McGraw-Hill? d. For each publisher, find the names of employees who have borrowed?