1. Consider the following relation that involves student data: GRADE (ClassName, Section, Term, Grade, StudentID, StudentName, ProfessorName, Department, ProfessorEmail) Assume that only one professor teaches a class section, and professors teach in only one department. Suppose the following dependencies exist: StudentID -> StudentName (ClassName, Section, Term) -> ProfessorName ProfessorName -> Department, ProfessorEmail What normal form is the relation in? Normalize it up to 3NF.

1. Consider the following relation that involves student data: GRADE (ClassName, Section, Term, Grade, StudentID, StudentName, ProfessorName, Department, ProfessorEmail) Assume that only one professor teaches a class section, and professors teach in only one department. Suppose the following dependencies exist: StudentID -> StudentName (ClassName, Section, Term) -> ProfessorName ProfessorName -> Department, ProfessorEmail What normal form is the relation in? Normalize it up to 3NF.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

1. Consider the following relations:Student (snum: integer, sname: string, major: string, level: string, age: integer)Class (name: string, meets at: string, room: string, fid: integer)Enrolled (snum: integer, cname: string)Faculty (fid: integer, fname: string, deptid: integer)The meaning of these relations is straightforward; for example, Enrolled has onerecord per student-class pair such that the student is enrolled in the class. Level is atwo character code with 4 different values (example: Junior: A Level etc)Write the following queries in SQL. No duplicates should be printed in any of theanswers.i. Find the names of all Juniors (level = A Level) who are enrolled in a classtaught by Prof. Kwizeraii. ii. Find the names of all classes that either meet in room R128 or have five ormore Students enrolled.iii. Find the names of all students who are enrolled in two classes that meet atthe same time.
Consider the following schema for a student relation. Student{Student ID, Last Name, First Name, Course ID, Course Section, Course Name, Faculty_ID, Faculty Last Name, Faculty First Name, Faculty Building&Office #, Semester, Grade}Sample Data:A43469873, Clark, Mary, MSIS5663, 01, Data Warehousing, A98706724, Sarathy, Rathindra, BUS407, SP2022, AIn a given semester (Note that there will be multiple semesters): A student may be enrolled in multiple courses, from multiple faculty, and receives a grade for each A faculty may teach multiple sections of multiple coursesIf you make any other assumptions, clearly state them here.a. Assuming that the table is in 1NF, identify all candidate key(s) and your choice of primary key.b. Identify the functional dependencies in the 1NF table above based on the chosen primary key, including any partial and transitive dependencies. (If necessary, clearly state your assumptions). In answering this, you may use the format in question 1d.c. After…
Question 1: Normalization Please TYPE IF POSSIBLE OR WRITE CLEARLY Consider a relation X with six attributes WYSMFE where WS is a composite primary key for X. Assume X has the following functional dependencies (X is one table with the attributes W, Y, S, M, F, E): WS è YMFE S è YME E è M In what normal form is relation X? Explain why? Is it possible to decompose X into a number of relations in order to achieve a higher normal form? Explain how (this means using English sentences and a diagram showing the final relation(s)).
Given:1. The universal relation schema Q(CTHRSG), where C = course, T = teacher, H = hour, R = room, S= student, and G = grade.2. The minimal set of functional dependencies F are assumed: C ->T each course has one teacher HR -> C only one course can meet in a room at one time. HT -> R a teacher can be in only one room at one time. CS -> G each student has one grade in each course. HS -> R a student can be in only one room at one time. 3. The decomposition of the universal schema Q(CTHRSG) based on the algorithm (Lossless Join and Dependency-Preserving Decomposition into 3NF Relation Schema) is:D = {R1, R2, R3, R4, R5}, where R1 = {CT} R2 = {HRC} R3 = {HTR} R4 = {CSG} R5 = {HSR} 4. HS is the key of R, and is a part of R5. Please apply the Lossless Join Testing algorithm to see if the decomposition D is a lossless join decomposition. Please provide testing details step by step when you apply the set of functional dependency for testing.
Consider a relation named as BOOK that contains data about the books in a library. BOOK relation was initially created with the attributes BookID (an id that library assigns), ISBN, CopyNr (used to differentiate copies of the same book), Title, PublYear, Author, and AuthorBornYear. Primary key: BookID, CopyNr and Author Candidate key: ISBN, CopyNr and Author Below is three dependencies of attributes: Dependency 1 (D1): ISBN, Title, PublYear, AuthorBornYear were dependent on BookID, CopyNr and Author Dependency 2 (D2): Title and PublYear were dependent on BookID, CopyNr Dependency 3 (D3): AuthorBornYear was dependent on Author . First determine which normal form (1NF, 2NF, 3NF or BCNF) the above relation is, and why. Then, if necessary, convert the above relation to the highest normal form (BCNF). Write any assumptions that you make.
Let us consider the following relational database. Students(stuID, lastName, firstName, major, gpa) Faculty(facID, name, deptName, rank) Classes(classNumber, facID, schedule, room) Enrolls(stuID, classNumber, grade) The column facID of relation Classes that references the table Faculty, The column StuID of relation Enrolls that references table Students, and The column classNunber of relation Enrolls that references table Classes. The following SQL statement is intended to add a record to the table Students. Assume that the entered value for each column is appropriate. In other words, there is no domain constraint violation. INSERT INTO Students(stuID, lastName, firstName, major) VALUES('950555111', 'Anna' 'Smith', 'BSIT'); However, this statement does not work correctly. Briefly explain why and list the correct SQL statement.
According to the university database that we explain in the class, explain how functional dependencies can be used to indicate the following: • A one-to-one relationship set exists between entity sets student and instructor. A Many-to-one relationship set exists between entity sets student and instructor
Given the following relation R and its functional dependencies: R(workerNumber, repairNumber, workerName, machineNumber, spentTime, repairDate, machineName, workshopNumber, workshopName ) workerNumber à workerName repairNumber à repairDate, machineNumber machineNumber à machineName, workshopNumber workshopNumber à workshopName 1)Create a database whose tables are at least in 3NF, showing the dependency diagrams for each table
Given the following relation that stores details of employees and their projects: If the functional dependencies are consistent with the above relation, put TRUE. If they are not, put FALSE. 1.ProjectID ➡ EmployeeName 2.ProjectID ➡ EmployeeSalary 3.ProjectID , EmployeeName ➡ EmployeeSalary 4.EmployeeName ➡ EmployeeSalary 5.EmployeeSalary ➡ ProjectID 6.EmployeeSalary ➡ EmployeeName , ProjectID
Consider the relation schema R (A, B, C, D) with all possible functional dependencies. For each of the following situations, identify the highest normal form for this relation R. A, C -> B, D C -> D A, C -> B, D B -> D A, C -> B, D
Consider a relation with schema R(A,B,C,D,E,F,G). Choose the key for the relation for the following sets of functional dependencies. BCD→A BC→E A→F F→ G C→ D A→ G ? A) B B) C C) BC D) All combinations of attributes are key
Question 1: Normalization PLEASE WRITE ELIGIBLE AND SHOW FULL STEPS FOR DIAGRAM TO DECOMPOSE Consider a relation X with six attributes WYSMFE where WS is a composite primary key for X. Assume X has the following functional dependencies (X is one table with the attributes W, Y, S, M, F, E): WS è YMFE S è YME E è M Is it possible to decompose X into a number of relations in order to achieve a higher normal form? Explain how (this means using English sentences and a diagram showing the final relation(s)).