Database final exam help

Question-1: (10 points) In the three-schema architecture, what are the mappings between External Schema and Conceptual Schema? Illustrate such mappings using an example in Relational Database Schema. Question2: (20 points) Relational View: Explain whether the following two statements are true or not: (1) With Relational View, it is more easy to specify queries; (2) With Relational View, it is more efficient to execute the queries. Question-3: (15 points) Based on the Company Database in the textbook, answer the following query in SQL: "For each department with more than one locations, retrieve the departments name, department number, and the number of employees who work for the department.". Question4: (15 points) Show how you may specify the following relational calculus language in the relational algebra. {D,E | S(D,E,F) and (($A)( $C)(R(A,B,C) and A= '10' and C=D))} Question-5: (40 points) Given an universal relation schema R = {A,B,C,D,E,F,G,H,I,J} and the following functional dependencies defined on R: AB? C; A? DE;B? F; F? GH; D? IJ. (a) Find a decomposition D1= {R1, R2, ?, Rn}, such that each Ri is in 3NF, and D1 has dependency-preserving property, but not lossless join property. Specify all steps of the procedure, and prove the correctness of the result. (20) (b) Find a decomposition D2= {R1, R2, ?, Rm}, such that each Rj is in BCNF, and D2 has lossless join property, but not dependency-preserving property. Specify all steps of the procedure, and prove the correctness of the result. (20) ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased. ## Platform Just answer the questions.