8. Consider the following relation instance of the CAR relation schema: CAR Model #cylinders Origin Таx Fee Camry 4 Japan 15 30 Mustang 6. USA 0. 45 Fiat 4. Italy 18 30 Accord 4. Japan 15 30 Century USA 45 Mustang 4 Canada 30 Monte Carlo 6. Canada 45 Civie 4 Japan 15 30 Mustang 4 Mexico 15 30 Mustang 6. Mexico 15 45 Civie 4 Korea 15 30 What is the minimal cover of functional dependencies that exists in CAR? What is (are) the candidate key(s) of CAR? If there is more than one candidate key, select a primary key from among the candidate keys. d. Based on the primary key, what is the immediate Nomal Form violated in CAR? e. Develop a dependency-preserving solution that eliminates this Normal Form violation. Is vour solution a lossless-ioin decomposition? а. b. С.

This question concerns the logical design of a relation schema LOAN describing the borrowing of a book at a library. If a tuple is in this relation, it means that a specific copy with identifica- tion number catalogNo has been borrowed by a library member with identification number memberNo on dateOut (borrowing day) and has been returned on dateReturn (return day). If the book has not yet been returned dateReturn is null. LOAN (catalogNo, dateOut, memberNo, dateReturn) (a) What would the following functional dependency mean? { dateOut, memberNo} → dateReturn (b) Give all full functional dependencies for schema LOAN, assuming that a book can be borrowed just once per day, that members can borrow many books on any given day, and that members can borrow the same book several times.

Let W(A, B) and Q(C,D) be two relation schemas. Let r₁ and r2 be the corresponding relation instances. B is a foreign key that refers to C in r2. Assuming that all tuples in r₁ and r2 satisfy referential integrity constraints, which of the following is ALWAYS TRUE? (А) Пв (г1) - Пс (rz) =Ø (B) IIc (₂)-118 (1₁) = 0 (С) Пв (г1 ) = Пс (12) (D) Пв (r1 ) - Пс (12) +Ø OB OD OA O C

Given relation R(u, y, c, d, e, f, w) where there are two keys: {y,c} and {w}. Given a set of functional dependencies F = {fd1: {y,c} -> {u,d,e,f,w}, fd2: u -> c, fd3: w -> {u,y,c,d,e,f}}. Is R in 3NF? Explain why.

The distinction between a weak and a strong entity collection has to be clarified.

Faculty (facultyNum, deptNum, officeNum, rank, dateHired, salary) ● Where: officeNum deptNum rank, dateHired → salary What is the highest normal form that the above relation satisfies? Decomposition into BCNF:

Select all binary relation properties that apply to the following relation: Equal magnitude: |x| = lyl O antisymmetric O reflexive O symmetric O transitive

Give all the keys of R if the functional dependencies on R in each of the following cases

QUESTION 6 Consider the following functional dependencies for a relation R(A, B, C, D) A -> (B, C, D), (A, D) -> (B, C) (C, D) -> (A, B) Identify the candidate key(s). O {C, D} O {A}, {C, D}, {A, D} O {A}, {C,D} O A

Consider the relation scheme R (A, B, C, D, E) and the set of functional dependencies F = { A → ВС; CD — E; В — D; E — А} on R. Find closure set of functional dependencies (F)+. What is the key for R?