+1835 731 5494 Email: instantessays65@gmail.com

# Information Systems homework help

\$12.99

Final Exam DAT604 Database Design and Impl. First Name Last Name ID# Question 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 Points 4 4 4 4 4 4 4 4 10 10 10 10 10 10 10 10 Total points: 112 points (100+12 bonus) 1. When two relations are union compatible, then a natural join can be carried out on them. a. True b. False 2. All primary keys in a database are candidate keys. a. True b. False 3. CARTESIAN PRODUCT is a unary operation a. True b. False 4. A foreign key is an attribute in a relation that a. matches the primary key attribute of another relation. b. can not have null value c. can have null value d. both a and c e. both a and b 5. The following functional dependency diagram satisfies a. 1NF b. 2NF c. 3NF d. BCNF e. All the above 6. The following functional dependency diagram satisfies a. 1NF b. 2NF c. 3NF d. BCNF e. allthe above 7. The following functional dependency diagram satisfies a. 1NF b. 2NF c. 3NF d. BCNF e. Allthe above Consider the following Functional Dependency Diagram (FDD). 8. What is the current normal form of this (FDD). 9. Normalize this FDD to 3NF (3rd normal form). You must show all your detailed works step by step. Consider the following Relation (EMPLOYEE) and answer the following questions? EMPLOYEE 10. Find the result of the following relational algebra expression. 11. If we want extract the Name and phone number of all employees who earn more than 35,00, what would be the relational algebra expression which gives us the list. Consider relations R and S as following. R A B 1 2 1 3 1 4 2 5 3 7 S B C 2 2 3 3 3 4 4 1 11 3 12. Find R R.B=S.B S (JOIN, with â€œR.B = S.Bâ€ as the join condition) 13. Find R*S (Natural JOIN) Consider relations R and S as following. R A B 1 2 1 3 1 4 S A B 2 2 3 3 1 2 1 4 14. Find R âˆ© (S U R) 15. Find (RU S) â€“ (R âˆ© S) Consider relations R1 and R2 as following. R1 A B C 1 7 1 1 7 3 5 4 2 4 5 3 3 1 1 3 1 3 4 2 1 6 6 1 4 2 3 R2 C 1 3 16. Find Final Exam DAT604 Database Design and Impl. First Name Last Name ID# Question 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 Points 4 4 4 4 4 4 4 4 10 10 10 10 10 10 10 10 Total points: 112 points (100+12 bonus) 1. When two relations are union compatible, then a natural join can be carried out on them. a. True b. False 2. All primary keys in a database are candidate keys. a. True b. False 3. CARTESIAN PRODUCT is a unary operation a. True b. False 4. A foreign key is an attribute in a relation that a. matches the primary key attribute of another relation. b. can not have null value c. can have null value d. both a and c e. both a and b 5. The following functional dependency diagram satisfies a. 1NF b. 2NF c. 3NF d. BCNF e. All the above 6. The following functional dependency diagram satisfies a. 1NF b. 2NF c. 3NF d. BCNF e. allthe above 7. The following functional dependency diagram satisfies a. 1NF b. 2NF c. 3NF d. BCNF e. Allthe above Consider the following Functional Dependency Diagram (FDD). 8. What is the current normal form of this (FDD). 9. Normalize this FDD to 3NF (3rd normal form). You must show all your detailed works step by step. Consider the following Relation (EMPLOYEE) and answer the following questions? EMPLOYEE 10. Find the result of the following relational algebra expression. 11. If we want extract the Name and phone number of all employees who earn more than 35,00, what would be the relational algebra expression which gives us the list. Consider relations R and S as following. R A B 1 2 1 3 1 4 2 5 3 7 S B C 2 2 3 3 3 4 4 1 11 3 12. Find R R.B=S.B S (JOIN, with â€œR.B = S.Bâ€ as the join condition

## Reviews

There are no reviews yet.