SpecificationFunctional Dependency1. Consider the relational schemas given below and the respective sets offunctional dependencies valid in the schemas. For each one of the relationalschemas identify its highest normal form. Remember that the identification of anormal form requires analysis of the valid functional dependencies and theminimal keys. Provide justification of each answer. A solution with nocomprehensive justification scores no marks.i.R1(A, B, С, D, E, F, G, H) F%3D {CH — G,A — ВС, Е — А,F — EG}ii.R2 = (S,C,L, D)F = {(L,D) → S, (L, D) → C,L → D}R3(A,B,C,D,E)F = {ABC → D, D → A} 2. In a higher education institution, in a semester, students are allowed to enrollup to 2 running subjects, and each running subject may have many studentsenroll to it. The final grade the students receive for a subject, and the creditvalue of each subject are recorded in the following relational table.ENROLMENT(StdNum, SubNum, Grade, CreditValue)3. When a staff is required to undertake an inspection of properties, the staff isallocated a company car for the day. A staff may inspect several properties ona given date, and a property is only inspected once on a given date. Thisinformation of the inspection are stored in the following relational table:PropertyInspection(PropertyNum, IDate, ITime, Comments, StaffNum,CarRegNum)4. In a company, employees involved in many projects, and each project may havemany employees working on it. The number of hours each employee works ineach project, and the start date on which the employee starts working on theproject are capture in the following relational table.EmployeeProject (EmpeNum, ProjNum, HoursWork,DateStartWorkOnProj)5. Each student is assigned with a counselor who will act as an advisor to thestudents. The student is given the counselor email address so that the studentcan contact the counselor for advice. The information on the student andcounselor are stored in the following relational table.STUDENTCOUNSELOR (StdNum, StdName, CounselorName,CounselorEmail)

(i) R( A ,B, C, D,E ,F ,G ,H) F= { CH---->G , A--->BC , E---->A , F---->EG }…

Specification Functional Dependency 1. Consider the relational schemas given below and the respective sets of functional dependencies valid in the schemas. For each one of the relational schemas identify its highest normal form. Remember that the identification of a normal form requires analysis of the valid functional dependencies and the minimal keys. Provide justification of each answer. A solution with no comprehensive justification scores no marks. i. R1(A,B,C,D,E,F,G,H) F = {CH → G, A→ BC,E → A, F → EG} ii. = (S, C,L, D) F = {(L,D) → S, (L, D) → C,L → D} iii. R3(A,B,C,D,E) F = {ABC → D, D → A}

Specification Functional Dependency 1. Consider the relational schemas given below and the respective sets of functional dependencies valid in the schemas. For each one of the relational schemas identify its highest normal form. Remember that the identification of a normal form requires analysis of the valid functional dependencies and the minimal keys. Provide justification of each answer. A solution with no comprehensive justification scores no marks. i. R1(A,B,C,D,E,F,G,H) F = {CH → G, A→ BC,E → A, F → EG} ii. = (S, C,L, D) F = {(L,D) → S, (L, D) → C,L → D} iii. R3(A,B,C,D,E) F = {ABC → D, D → A}

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

4
5. Consider a relational schema R=ABCDEGHI, and the following set of functional dependencies: {A→BC, B→CD, DE→GH}. Candidate key: AEI Normalize R such that the resulting set of decomposed relational schemas is in Third Normal Form.
Let R be a relational schema {A, B, C, D, E, F, G} and let F be the set of functional dependencies F = {AB→C, AC→B, BC→E, BC→G, AD→E, B→D, B→G, BE→A, AE→C, AE→G}. Perform the following (i) Remove Extraneous Attributes(ii) Remove redundant Functional dependencies(iii) Find the minimal Cover
The following Figure 2 shows an EER schema for a database that can be used to track sales at a car dealership. Map this schema into a relational data model, including all primary keys and referential integrity constraints (foreign keys). For the VEHICLE to CAR/TRUCK/SUV generalization, consider the four Step 8 options presented in the lecture notes for mapping specializations/generalizations. Show the relational schema design under each of those four options (8A, 8B, 8C, 8D). Model Vin Sid VEHICLE N Price SALE Date 1 SALESPERSON Name 1 CAR Ssn TRUCK Tonnage SUV CUSTOMER Engine_size Name No_seats Address State Figure 2: An EER diagram for a car dealership database. City Street
Question 20 Please fill in the blank correctly.
Suppose that A and B are two sets of entities connected by a relation R that has multiple one-to-one occurrences (see Figure 1). Think about a scenario in which R's generated connection is coupled with A's. SQL allows null values for attributes that are a part of a foreign key constraint. Give an example of how non-null constraints may be used in SQL to place a restriction on how much A can be involved in R.