Consider the relations Courses1, Courses2,Enrollment and Students.Courses1Courses2Enrollmentsid cidcid enameAl CalculusA2 AlgebraA5 EnglishLocationcidnameClassroomEnglishHistoryB2LIA5L3101AlL2L3BIL4102A5ComputingL5103BI102Al102A2Student(sid, sname, age, level)(1) Give the results of the following relational_algebra expressions:a) Ttcid (oname ="History' OR 'Computing (Courses2))b) Courses1-Courses2c) CourseslnCourses2d) Courses1 AEnrollmente) Enrollment / Ttcid (Coursesl)(2) Write the following query in Relational Algebra.a) Find the sids of students who have enrolled incourse Calculus._b) Find the names of students who have enrolled incourse Calculus._c) Find the names of students who have enrolled atleast one course._d) Find the names of students who have enrolled inCalculus or Algebra.Le) Find the sids of students who have enrolled in allcourses (both Courses1 and Courses2).

Selection is a relational algebra operation that uses a condition to select rows from a relation. A…

(2) Write the following query in Relational Algebra. a) Find the sids of students who have enrolled in course Calculus. b) Find the names of students who have enrolled in .course Calculus. c) Find the names of students who have enrolled at least one course. d) Find the names of students who have enrolled in Calculus or Algebra.

(2) Write the following query in Relational Algebra. a) Find the sids of students who have enrolled in course Calculus. b) Find the names of students who have enrolled in .course Calculus. c) Find the names of students who have enrolled at least one course. d) Find the names of students who have enrolled in Calculus or Algebra.

Database Systems: Design, Implementation, & Management

12th Edition

ISBN:9781305627482

Author:Carlos Coronel, Steven Morris

Publisher:Carlos Coronel, Steven Morris

Chapter8: Advanced Sql

Section: Chapter Questions

Problem 18RQ

See similar textbooks

Similar questions

Given the following relational schema (Hint: the bold text represents a primary key), Department (dept_code, dept_name, emp_num, dept_address, dept_ext)Professor(emp_num, emp_fname, emp_lname, emp_dob, dept_code, prof_ext) Write a relation algebra to find all professor names (firstname and lastname) who are in the department named "Biology"
Consider the following relational schema:Student (sid, sname, dept)Enroll (cid, sid, grade, semester)Course (cid, cname, dept, credit)Prereq (cid, pid) Write the following queries in Relational Algebra expression: a) For students who have received an A in a course, return name of students and titleof the course. b) Find name and id of students taken at least one of the prerequisite of CS595course and got an A grade in this prerequisite course.
Consider the following relations: Employee(E_id: integer, E_name: string, Age: integer, Salary: real) Works(E_id: integer, Dep_id: integer, Start_date: date) Department(Dep_id: integer, Dep_name: string, Budget: real, Manager_E_id: integer) What referential integrity constraints exist between these relations? What are the options for enforcing these constraints when a user attempts to delete a Dept tuple?
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.
question one: defined the following relation on A={0,2,5,6} Answer each of the following questions by listing the index of the relation. For example, for Part 1), if R1 and R2 and are reflexive, simply enter 1, 2 as the answer.1) Which relations are reflexive? 2) R0={(0,6),(6,6),(6,2),(0,0),(0,2),(2,2),(5,5)} 3) R1={(6,6),(2,2),(5,5),(0,0),(0,6)} 4) R2={(0,6),(6,6),(0,0),(5,6),(6,5),(5,0),(5,5),(2,2),(0,5) 5) R3={(5,5),(0,0),(6,6),(2,2) 6) R4={(5,5),(6,2),(6,6),(0,0),(6,5),(2,6),(2,2)} 1) Which relations are reflexive? 2) Which relations are symmetric? 3) Which relations are anti-symmetric? 4) Which relations are transitive? 5) Which relations are equivalence relations? 6) Which relations are partial orders? question two :defined the following relation on A={0,1,5,6} Answer each of the following questions by listing the index of the relation. For example, for Part 1), if R1 and R2 and are reflexive, simply enter 1, 2 as the answer. R0={(5,5),(0,0),(6,6),(1,1)}…
For each of the following pairs of expressions, give instances of relations thatshow the expressions are not equivalent. σθ(E1 ⟕E2) and E1 ⟕σθ(E2), where θ uses only attributes from E2.
Consider a database that consists of the following relations.SUPpLIER(Sno. Sname)PART(Pno, Pname)PROJECT(Jno, Jname)SUPPLY(Sno, Pno, Jno)The database records information about suppliers, parts, and projectsandincludes a ternary relationship between suppliers, parts, and projects.Thisrelationship is a many-many-many relationships. Specify and execute thefollowingqueries using the relational algebraRetrieve the part numbers that are supplied to exactly two projects.b. Retrieve the names of suppliers who supply more than two parts toproject J11c. Retrieve the part numbers that are supplied by every supplier.d. Retrieve the project names that are supplied by supplier S1' only.e. Retrieve the names of suppliers who supply at least two different partseach to at least two different projects.
Consider the following relations:Album (albumId: integer, title: string, artistId (FK): integer)Artist (artistId: integer, name: string)Composer (artistId: integer, name: string)Singer (artistId: integer, name: string)Write the following queries in relational algebra.(1) Find all the titles of the albums.(2) Find all the tuples whose albumId is 2.(3) Rename the relation Artist to Art and attributes to artId, title.(4) Find all the tuples that are either an Artist or a Composer.(5) Find the tuples of Artists who are not a Composer.(6) Find the tuples of people who are Composer and a Singer at the same time.(7) Find the titles of albums created by the artist ‘Black Sabbath’.
Consider the following relation for published books:BOOK (Book_title, Authorname, Book_type, Listprice, Author_affil, Publisher)Author_affil refers to the affiliation of the author. Suppose the following dependencies exist:Book_title → Publisher, Book_typeBook_type → ListpriceAuthor_name → Author-affil (a) What normal form is the relation in? Explain your answer.(b) Apply normalization until you cannot decompose the relations further. State the reasons behind eachdecomposition.
Given the following relational schema (Hint: the bold text represents a primary key), Department (dept_code, dept_name, emp_num, dept_address, dept_ext)Professor(emp_num, emp_fname, emp_lname, emp_dob, dept_code, prof_ext) Write a relation calculus using Domain Relational Calculus to find all professor names (firstname and lastname) who are in the department with the code "CIS"
Let us consider the following relational database. Students(stuID, lastName, firstName, major, gpa) Faculty(facID, name, deptName, rank) Classes(classNhmber, facID, schedule, room) Enrolls(stuID, classNumber, grade) The primary keys are underlined. The referential integrity constraints are as follows: The column facID of relation Classes that references table Faculty, The column of stuID of relation Enrolls that references table Students, and The column classNumber of relation Enrolls that references table Classes. The following SQL statement is intended to define the table Students. However, this statement does not work correctly. CREAT TABLE Students( lastName VARCHAR(20), firstName VARCHAR(20), major VARCHAR(40) gpa DECIMAL(3,2), PRIMARY KEY(stuID)); However, this statement does not work correctly. Briefly explain why and list the corrected SQL statement.
Please answer the remaining questions 4,5!! Please answer this DBMS ques asap! Suppose that we have three relations R1={A, B, C}, R2={A, B, D} and R3={B, C, D} under the relational data model. The relation R1 has 5 tuples, the relation R2 has 6 tuples and the relation R3 has 7 tuples. There are no NULL values in these relations. For each of the following relational algebra expressions, list the minimum and maximum numbers of tuples in the result that the relational algebra expression may have. (4) R1 ⋈ R2(5) ρX (R2) ⋈X.B≠Y.B ρY (R2) You can use the following format to organise your answers. (4) max=____ , min=____ ;(5) max=____ , min=____ ;

SEE MORE QUESTIONS

Recommended textbooks for you

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781305627482

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

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

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781305627482

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

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

SEE MORE TEXTBOOKS