2. The following relational schema form a university database which isimplemented in a relational database:student (s_ID, s_name, semester, year)department(d_ID, d_name, floor)course (c_code, c_title, d_ID, credits)Write down the Relational Algebra for the following queries:a) Find your own name using your own registration number as the student ID.b) Show the ID and name of the department located at the floor number equals tothe last digit of your own registration number.c) Find the codes and titles of the courses having credits more than 3 credits.d) Find the name of all students from your own semester and year.

Here have to determine about sql query for given problem.

Answered: The following relational schema form a…

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) Assume the EMPLOYEE table has the following rowsID DEPT SALARY NAME100 SALES 40000 Smith101 RD 38000 Terry102 HR 60000 David103 SALES 58000 Ellie104 RD 70000 Judya) Provide the complete PL/SQL code to implement a Virtual Private Database suchthat an employee could only view the records for employees in the samedepartment while masking coworkers’ salary with NULL.b) Based on the Virtual Private Database you implemented in step a), would anemployee be able to insert, update or delete a record for another employee whoworks in another department? If yes, what might be the potential security risk andhow would you fix the problem by setting up the VPD appropriately?
q4- Choose all that apply
SQL code for: (1) Hint: A NULL in the hours column should be considered as zero hours. Find the ssn, lname, and the total number of hours worked on projects for every employee whose total is less than 40 hours. Sort the result by lname */ /* (2) For every project that has more than 2 employees working on it: Find the project number, project name, number of employees working on it, and the total number of hours worked by all employees on that project. Sort the results by project number. /* (3) For every employee who has the highest salary in their department: Find the dno, ssn, lname, and salary. Sort the results by department number. */ /* (4) For every employee who does not work on any project that is located in Houston: Find the ssn and lname. Sort the results by lname /* (5) Hint: This is a DIVISION query For every employee who works on every project that is located in Stafford: Find the ssn and lname. Sort the results by lname */
Database Systems please help me answer this question I will give you a good rating Thank you!
Write the relational algebra formula to apply an INTERSECT relational operator to the tables shown in Figure Q3.13.
All parts of this question use the following database schema: Flights(flno, from, to, distance) Aircraft(aid, aname, cruisingrange) Certified(eid, aid) Employees(eid, ename, salary) c) For each cruisingrange held by at least 3 aircraft, give the lowest salary of employees certified to fly one of those aircraft. Express in SQL only:
a) from university database , Write the following queries in SQL Find the titles of courses in the Comp. Sci. department that have 3 credits Find all instructors earning the highest salary (there may be more than one with the same salary) Find all courses that have never been offered (i.e., do not occur in the section relation). b) given the following tables( instructor, teaches) what is the output of the following query select i.name from instructor as i, teaches as t where i.ID=t.ID and semester=’ Fall’ and year=2017;
True or False below: Given two relations named A and B, if we q-JOIN A and B, the maximum number of attributes in the result relation could be (the number of attributes of A) times(*) the number of attributes of B). * in an SQL SELECT statement means “all the tuples”. In relational algebra, Cartesian Product (X) can be implemented using the q-JOIN operator. Cartesian Product ISA q-JOIN where q-condition always evaluates to true. SQL is based on Predicate Calculus. A query in SQL always specifies what should be included in the query result.
Use your ERD to define the table structures in the database using SQL DDL commands to build your schema.
Database Programming
Based on the table provided, answer the following questions in relational algebra.
Question Two Write SQL statements to do the following on the database schema shown below. a) Insert a new record in the course table with the following data values course number = 'COSC4390' course name = 'Knowledge Engineering' course credit hours= ‘3’ department = ’COSC'>. b) Change the class of student 'Ahmed' to 4. c) Delete the record of the student whose name is 'Ahmed' and his number is 22.

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS