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

The determinant suppose to be -28 and 262are the right answers but why -27 and 261 are shown please explain
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
Please explain your answer for both questions. For the first part n is greater than or equal to zero
Correct answer will be upvoted else downvoted. Computer science. You don't care to alter your bearing excessively, so you will make close to n−1 heading changes. Thus, your way will be a polygonal chain from (0,0) to (n,n), comprising of all things considered n line portions where each section has positive integer length and vertical and level fragments substitute. Not all ways are equivalent. You have n integers c1,c2,… ,cn where ci is the expense of the I-th section. Utilizing these costs we can characterize the expense of the way as the amount of lengths of the portions of this way duplicated by their expense, I. e. on the off chance that the way comprises of k sections (k≤n), the expense of the way is equivalent to ∑i=1kci⋅lengthi (fragments are numbered from 1 to k in the request they are in the way). Find the way of the base expense and print its expense. Input The principal line contains the single integer t (1≤t≤1000) — the number of experiments. The…
Simplify n∧(¬q∨q) to n
Use the substitution method to identify the big-Oh of the represented by the following recurrence relation. Note: c is a constant. T(n) = cn + T(n/2) + T(n/2), T(1) = c
In order to minimize an FA, you have to try and determine if any of the states are actually the same state. You can do this by a table a table and finally by tables that shaped table All the results are stored in a nifty "stair step" that prevents any state from being compared to
The set of letters S consists of 30 As, 6 Bs, 24 Cs, 15 Ds, and 15 Es. The set of letters T consists of 25 As, 20 Bs, 15 Cs, 5 Ds and 35 Es. What is the mutual index of coincidence between sets S and T? Leave your answer as a fraction in lowest terms