Question [1]: [5 marks] Write the suitable SQL statement to answer the following questions based on the following relations: Note: Show screen shot of the query together with the output in SQL environment. Product ProductID 1 2 3 4 Supplier 5 6 Supplier ID 1023 1145 2451 4566 1342 ProductName Bread Juice Cheese Yogurt Milk Croissant Supplier Name Lusine Nadec AlMarai AlSafi Nova ProductPrice 6.5 10 23 3 7.75 2 Supplier ID 1023 1145 2451 1145 1145 1023 ProductNum 5 12 3 4 1 1. Write the DDL statements for defining all the relations. [1 mark] 2. Write the DML statements for inserting all the tuples listed in the above relations state. [0.5 mark] 3. Write an SQL query to raise the price of all products by 9%. [1 mark] 4. Write an SQL query to list all details of all products from Nadec supplier. (Nested Query). [1 mark] 5. List the number of products for each supplier that supplies more than 1 product. [1 mark] 6. Drop all the tables. [0.5 mark]

Question [1]: [5 marks] Write the suitable SQL statement to answer the following questions based on the following relations: Note: Show screen shot of the query together with the output in SQL environment. Product ProductID 1 2 3 4 Supplier 5 6 Supplier ID 1023 1145 2451 4566 1342 ProductName Bread Juice Cheese Yogurt Milk Croissant Supplier Name Lusine Nadec AlMarai AlSafi Nova ProductPrice 6.5 10 23 3 7.75 2 Supplier ID 1023 1145 2451 1145 1145 1023 ProductNum 5 12 3 4 1 1. Write the DDL statements for defining all the relations. [1 mark] 2. Write the DML statements for inserting all the tuples listed in the above relations state. [0.5 mark] 3. Write an SQL query to raise the price of all products by 9%. [1 mark] 4. Write an SQL query to list all details of all products from Nadec supplier. (Nested Query). [1 mark] 5. List the number of products for each supplier that supplies more than 1 product. [1 mark] 6. Drop all the tables. [0.5 mark]

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

Summarize this discussion by writing the truth table for A → B.
According to De Morgan's Law, (A'B')' would be A''+B'', which would simplify to A+B, and (BD)' would be B'+D'. This much I think I'm pretty solid on. However, if I'm correct, it makes the given solution completely incorrect. There are a lot of other parts of the given solution that are very unclear as well. Please try again with better explanations and showing of work. Thank you...
Do we need to make iteration even if the team is one member
And I don't find any difference between your WRITTEN solution and the other!
Not an exam. Just review for me. For each function f(n) below give an asymptoic upper bound using big-Oh notation. You should give the tighest bound (ie. smallest bound) possible and simplify the expression. Explain step by step how you your answers. Use signma notation to prove your answers if you can I attached the answers for question 3 and 4 for your reference so you can check your work but explain how you got those answers. I dont have the answer key for 1 so please try your best on that.
Compare the functions according to their order of growth. Prove the accuracy of your ordering. Note: Your analysis must be rigorous and precise. Merely stating the ordering without providing any mathematical analysis will not be accepted. a) (n2)! b) (n!)n
need help with part b, they are incorrect
Please, show your solution why.
Question 3: How many assignments of truth values to p; q; r and w are there for which ((p → q) → r) → w is true? Guess a formula in terms of the number of variables
Write A loopless algorithm for the computation of the successor?
improvements of the given algorthims.
Example of Longest Increasing Subsequence.