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

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

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"
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 Tuple Relational Calculus to find tbe department names and their addresses that Prof "Peter Rob" work
Write a relational calculus based on the following relations: Professor (ProfID, ProfName, DeptNo) Course (CrsID, CrsName, Credits, DeptNo, ProfID) Department (DeptNo, DeptName) Use tuple relational calculus; 1. List all professor names, who are the owner of the courses named, "Database Design". 2. List all professor names who teach the 3-credit courses provided by the department named "Information Technology".
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)}…
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=____ ;
Given the following relational schema (Hint: the bold text represents a primary key), Professor(emp_num, emp_fname, emp_lname, emp_dob, dept_code, prof_ext)Class (class_code, course_code, class_section, class_time, class_room, emp_num)Course (course_code, course_name, crs_credits, dept_code) Write a relation algebra to find all "Database Design and Implementation" classes including section, time, room, and professor name (first name and last name). Hint: "Database Design and Implementation" is the course name
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 relational data model. Employee (empid, ename, address, title, headid) Works (Empid,Deptid,joindate) Department (Deptid, dname, block) Payment (title, salary) A) Write relational algebra for Display the employee name and department name of each employee. Display the employee who works as senior lecturer and belongs to BEI or BCT department. Display the employee name with corresponding department head. B) Write sql query for Creating the above relations; including appropriate versions of all primary and foreign key constraints Find the employee name and address whose address name ends with substring ‘pur’. Update the salary of senior lecturer by 25%.(Solve A - 1,2,3 only)
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 database schema (primary keys are bold and underlined). Answer questions 4.1 to 4.2: branch(branch_id, branch_name, branch_city, assets) customer(customer_id, customer_name, customer_street, customer_city, customer_st, customer_zip) loan(loan_number, branch_id, amount) borrower(customer_id, loan_number) account(account_number, branch_id, balance) depositor(customer_id, account_number) 4.1 For each of the following queries, write a relational algebra expression to answer the query: a) Find the names of all customers who live in Plymouth and have the name Bronson. b) Find the names and zip codes of all customers who have loans. c) Find the names, cities of residence, and state for all depositors who have accounts with balance that is less than $5000 4.2 For each of the following relational algebra expressions, explain the output of the expression in words:
Consider the following relational schema for a library database: Book (Title, Author, Catalog_no, Publisher, Year, Price, bookCoverType, contractDate) Collection (Title, Author, Catalog_no) Assume {Author, Title} is the key for both relations Additional functional dependencies are Title,Author --> Catalog_no Catalog_no --> Publisher, Year, bookCoverType Publisher, bookCoverType --> Price Author --> contractDate a) Explain what normal form the relation is in. b) Apply normalization until the 3rd State reasons behind each normalization
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’.

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