Take a database, having FDs as: DOB->Age; Age->Eligibility; Name->RollNo; RollNo->Name; CourseNo->CourseName; CourseNo->Teacher; (RollNo, CourseName)->Marks. The relation (RollNo, Name, DOB, Age) is in which Normal Form?

Take a database, having FDs as: DOB->Age; Age->Eligibility; Name->RollNo; RollNo->Name; CourseNo->CourseName; CourseNo->Teacher; (RollNo, CourseName)->Marks. The relation (RollNo, Name, DOB, Age) is in which Normal Form?

Database Systems: Design, Implementation, & Management

11th Edition

ISBN:9781285196145

Author:Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel

Publisher:Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel

Chapter10: Transaction Management And Concurrency Control

Section: Chapter Questions

Problem 1P

See similar textbooks

Similar questions

I need help with the following Consider a STUDENT relation in a UNIVERSITY database with the followingattributes (Name, Ssn, Local_phone, Address, Cell_phone, Age, Gpa). Note thatthe cell phone may be from a different city and state (or province) from thelocal phone. A possible tuple of the relation is shown below:Name Ssn Local_phone Address Cell_phone Age GpaGeorge Shaw 123-45-6789 555-1234 123 Main St., 555-4321 19 3.75William Edwards Anytown, CA 94539a. Identify the critical missing information from the Local_phone andCell_phone attributes. (Hint: How do you call someone who lives in a dif ferent state or province?)b. Would you store this additional information in the Local_phone andCell_phone attributes or add new attributes to the schema for STUDENT?c. Consider the Name attribute. What are the advantages and disadvantagesof splitting this field from one attribute into three attributes (first name,middle name, and last name)?d. What general guideline would you recommend for…
Given the database schema with the following relations: STUDENT (id_stud, name_stud) LECTURER (id_lect, name_lect) SUBJECT (id_subject, id_lect, name_subject, credits, id_room) ROOM (id_room, no_room) ENROLL (id_stud, id_subject) Create an algebraic relation for: a. Displays all names of lecturers who teach the subject with a total of 4 credits b. Displays all no_room with the student name "Eko" c. Displays all data in the form of student id, student name, name of the course followed and the name of the lecturer who taught the subject name "Database" From the database schema and the questions above, create an appropriate SQL query for each of these statements above.
Draw the relationships and entities model for each of the following: * in the traditional way* for example: see the pic??. In the database of the library, the author can author more than one book, and the book can be subscribed toWritten by more than one author
Consider a relational database for an online hotel booking company. The database consisting ofthe following tables (where the primary keys are underlined): Hotel (hId, hName, hAddress, hCity) Guest(gId, gName, gAddress, gCity) Room(hid, roomNo, type, price) Booking(gId, hId, roomNo, fromDate, year, noOfDays)Where hId and gId are identifiers for the hotels and the guests,and the Booking relation indicated that a guest booked a hotel room for a specified number of days(noOfDays) starting from fromDate of a given year. For instance, a tuple < g12345, h5555, 220,Jan05, 2016, 15> in Booking indicates that the guest g12345 booked room 220 of the h5555 hotelfor 8 days starting on Jan 5, 2016. The attribute "gAddress" records the home address of theguests.Write the following queries in relational algebra (1) Return thename of guests who have booked a hotel room in NYC in January 2016 (i.e.,fromDate between 01/01 and 01/31 and year=2016).(2) Return thename of guests who have booked a…
Consider that a database contains the following relations PARENT(X, Y), and a relation BIRTH(X, B), where B is the birthdate of a person X. The following information is used for question (b), (c) that we have the following family tree
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.
Today almost every commercial database is based on O the hierarchical model O the linked-list model O the object-oriented model lists the relational model Given the relations: STUDENT (SID. StudentName, Major, AdvisorID) ADVISOR (AdvisorID, AdvisorName, Office, Phone) such that each student is assigned to one advisor, which of the following is true? O Major is a candidate key. O Phone is a candidate key. AdvisorName is a determinant. O AdvisorID is a foreign key. O SID is both a primary key and a foreign key.
Consider the Database schema on the relations Courses (Number, Faculty, Course Title, Tutor) Student (Number, Surname, First Name, Faculty) Tutors (Number, Surname, First Name) Exam (Student, Course, Grade, Date) Study Plan (Student, Course, Year) Formulate in relational algebra, in domain calculus, in tuple calculus and in Data log, the queries that produce: The student who have gained an ‘A’ in at least one exam, showing for each of them, the first name, sur name and the date of the first of such occasions; For every course in the engineering faculty, the student who passes the exam during last session; The students who pass all the exams required by their respective study plan For every course in the literature faculty, the student who pass the exam with the highest grade; The student whose study plans require them to attend lectures only in their own faculties; First name and sur name of the students who have taken an exam with a tutor having the same surname as the…
Consider a database schema with a relation Emp whose attributes are as shown below, with types specified for multivalued attributes. Emp = (ename, ChildrenSet multiset(Children), SkillSet multiset(Skills))Children = (name, birthday)Skills = (type, ExamSet setof(Exams))Exams = (year, city) Redesign the database above into first normal form and fourth normal form. List any functional and multivalued dependencies that you assume. Also list all referential-integrity constraints that should be present in the first and fourth normal form schemas.
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
Suppose we have a relational database with five tables.table key AttributesS(sid, A) SidT(tid, B) TidU(uid, C) UidR(sid, tid, D) sid, tidQ(tid, uid, E) tid, uidHere R implements a many-to-many relationship between the entities implemented with tables S and T, and Q implements a many-to-many relationship between the entities implemented with tables T and U.D. Suppose you replaced SELECT with SELECT DISTINCT in your queries from parts (a) and Could one of these modified queries return more records than the other? If so, which one? Justify your answer. E. Consider again your query from part (a). If pair sid, uid is returned by this query then there must exist at least one “path” that goes from from table S to table T (via relation R) and then from table T to table U (via relation Q). Note that there can be many such paths for a given pair sid, uid. Write an SQL query that returns records of the form tid, total where…
Suppose we have a relational database with five tables. table key Attributes S(sid, A) Sid T(tid, B) Tid U(uid, C) Uid R(sid, tid, D) sid, tid Q(tid, uid, E) tid, uid Here R implements a many-to-many relationship between the entities implemented with tables S and T, and Q implements a many-to-many relationship between the entities implemented with tables T and U. A. Write an SQL query that returns all records of the form sid, uid where sid is the key of an S- record and uid is the key of a U-record and these two records are related through the relations R and Q. Use SELECT and not SELECT DISTINCT in your query. B. Write an SQL query that returns records of the form A, C where the A-value is from an S- record and the C-value is from a U-record and these two records are related through the relations R and Q. Use SELECT and not SELECT DISTINCT in your query. C. Could one of your queries from parts (a) and (b) return more records than the other? If so, which one? Justify your answer. D.…

SEE MORE QUESTIONS

Recommended textbooks for you

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781285196145

Author:

Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel

Publisher:

Cengage Learning