Database Systems: Design, Implementation, & Management
13th Edition
ISBN: 9781337627900
Author: Carlos Coronel, Steven Morris
Publisher: Cengage Learning
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Textbook Question
Chapter 8, Problem 5P
Write the SQL code to change the job code to 501 for the person whose employee number (EMP_NUM) is 107.
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
Hepp
Big-Omega.
Consider this code:
def f(n) \\n is natural number >=1
x = n
while x 1:
if x % 2 == 0:
else:
x = x/2
x = 2*x - 2
Determine the best possible lower bound for the number of iterations of the while
loop. Use this bound to determine the complexity class of the function f.
Proof of correctness of iterative algorithms
The algorithm Occur (A, f,l,x) below returns the number of occurrences of or in
array A between positions f and 1. More precisely, it satisfies the following precon-
dition/postcondition pair:
Precondition: A is an array, f and I are integers such that 1 ≤ ƒ ≤ i ≤
length(A).
Postcondition: The integer returned by the algorithm is the number of elements
of the following set: {j: f≤ j ≤l^A[j] = x}.
Occur (A, f, 1, x)
t = 0
i = f
while i<=1 {
if A[i] == x {
t = t +1
}
}
i = i + 1
return t
Provide a complete proof of correctness of this algorithm.
Chapter 8 Solutions
Database Systems: Design, Implementation, & Management
Ch. 8 - Prob. 1RQCh. 8 - Explain why it might be more appropriate to...Ch. 8 - What is the difference between a column constraint...Ch. 8 - What are referential constraint actions?Ch. 8 - What is the purpose of a CHECK constraint?Ch. 8 - Explain when an ALTER TABLE command might be...Ch. 8 - What is the difference between an INSERT command...Ch. 8 - What is the difference between using a subquery...Ch. 8 - What is the difference between a view and a...Ch. 8 - Prob. 10RQ
Ch. 8 - Prob. 11RQCh. 8 - Prob. 12RQCh. 8 - Write the SQL code that will create only the table...Ch. 8 - Having created the table structure in Problem 1,...Ch. 8 - Prob. 3PCh. 8 - Write the SQL code that will save the changes made...Ch. 8 - Write the SQL code to change the job code to 501...Ch. 8 - Write the SQL code to delete the row for William...Ch. 8 - Write the SQL code to create a copy of EMP_1,...Ch. 8 - Using the EMP_2 table, write the SQL code that...Ch. 8 - Using the EMP_2 table, write the SQL code to...Ch. 8 - Prob. 10PCh. 8 - Prob. 11PCh. 8 - Prob. 12PCh. 8 - Prob. 13PCh. 8 - Prob. 14PCh. 8 - Prob. 15PCh. 8 - Create the CUSTOMER table structure illustrated in...Ch. 8 - Create the INVOICE table structure illustrated in...Ch. 8 - Prob. 18PCh. 8 - Prob. 19PCh. 8 - Create an Oracle sequence named CUST_NUM_SEQ to...Ch. 8 - Create an Oracle sequence named INV_NUM_SEQ to...Ch. 8 - Prob. 22PCh. 8 - Modify the CUSTOMER table to include the customers...Ch. 8 - Prob. 24PCh. 8 - Prob. 25PCh. 8 - Create a trigger named trg_updatecustbalance to...Ch. 8 - Prob. 27PCh. 8 - Prob. 28PCh. 8 - Write a trigger to update the customer balance...Ch. 8 - Prob. 30PCh. 8 - Create a trigger named trg_line_total to write the...Ch. 8 - Create a trigger named trg_line_prod that...Ch. 8 - Create a stored procedure named prc_inv_amounts to...Ch. 8 - Create a procedure named prc_cus_balance_update...Ch. 8 - Modify the MODEL table to add the attribute and...Ch. 8 - Prob. 36PCh. 8 - Modify the CHARTER table to add the attributes...Ch. 8 - Write the sequence of commands required to update...Ch. 8 - Write the sequence of commands required to update...Ch. 8 - Write the command required to update the...Ch. 8 - Write the command required to update the...Ch. 8 - Write the command required to update the...Ch. 8 - Prob. 43PCh. 8 - Create a trigger named trg_char_hours that...Ch. 8 - Create a trigger named trg_pic_hours that...Ch. 8 - Create a trigger named trg_cust_balance that...Ch. 8 - Write the SQL code to create the table structures...Ch. 8 - The following tables provide a very small portion...Ch. 8 - For Questions 49-63, use the tables that were...Ch. 8 - Prob. 50PCh. 8 - Write a single SQL command to increase all price...Ch. 8 - Alter the DETAILRENTAL table to include a derived...Ch. 8 - Update the DETAILRENTAL table to set the values in...Ch. 8 - Alter the VIDEO table to include an attribute...Ch. 8 - Update the VID_STATUS attribute of the VIDEO table...Ch. 8 - Alter the PRICE table to include an attribute...Ch. 8 - Prob. 57PCh. 8 - Prob. 60P
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Average case complexity Consider this function: def put (1st, first, last, value): i = last while i last = i first and value < 1st [i]: last = last i-i-1 - 1 1st [last] value return 1st Assume 1st is a list of integers, value is an integer, and first <= last are nat- ural numbers. For the purpose of our computations, we will define n-last-first+1 (the size of 1st). Also, assume the elements of 1st are almost sorted, in the sense that the probability that each element of the array has a probability of being out of order with a distance m units from its correct place m, 0 ≤m ≤ n − 1, is propor- tional with, that is this probability equals 1. In order to determine c, keep in mind that all involved probabilities sum to 1. Additionally, you may use the formula Inn (which is true for large n) to determine the value of c. Once you have determined the value of c, compute the average runtime of the function put and determine its complexity class. m+1arrow_forwardHelp me with number 5 and 6arrow_forwardCorrectness of recursive functions Here is code for a recursive function that finds the minimum element of a list. def rec_min (A): if len(A) == 1: return A [0] else: m = len (A) // 2 min1 = rec_min (A[O..m-1]) min2 = rec_min (A [m..len (A)-1]) return min (min1, min2) State preconditions and postconditions for this function. Then, prove that this algorithm is correct according to your specifications.arrow_forward
- Use a loop invariant as a debugging tool Consider this alogrithm: Precondition: nЄ N. Postcondition: The returned value equals n(n + 1). Invariant: ri(i + 1)^i≤n+2 Variant: n-i +1 def f(n): r, i = 0,0 while i < n+2: i = 1+1 r = r+2*i return r Its implementation, however is buggy. In order to find the bug, you are required to attempt a proof of correctness of this algorithm using the provided invariant and variant. Please follow the process of the proof as instructed in class, and eventually you will get to a point where the proof breaks down, revealing the bug. Identify the bug. You do not actually need to write a corrected code, also you do not need to complete the proof after identifying the bug. All is required is to do, is to identify the bug, while presenting a proof of correcteness.arrow_forwardcan you please help me with number 5 and 6arrow_forwardIN C++ you will simulate a simple multithreading application with a “producer and consumer” problem Modify “Producer and Consumer Problem” from the lecture note so that it can use all buffer space, not “buffersize – 1” as in the lecture note. This program should work as follows: 1. The user will run the program and will enter two numbers on the command line.Those numbers will be used for buffersize and counter limit.2. The main program will then create separate producer and consumer threads.3. The Producer thread generates a random number through a random number generator function, inserts it into the buffer, prints the number, and increment counter.4. The Consumer thread goes to the buffer, takes a number in the proper order, prints it out, and increment counter.5. After the counter reaches its limit, both threads should be terminated and returned to the main.6. Main program terminates. program and sample run should clearly show the implementation of subtasks through…arrow_forward
- IN C++ you will simulate a simple multithreading application with a “producer and consumer” problem Modify “Producer and Consumer Problem” from the lecture note so that it can use all buffer space, not “buffersize – 1” as in the lecture note. This program should work as follows: 1. The user will run the program and will enter two numbers on the command line.Those numbers will be used for buffersize and counter limit.2. The main program will then create separate producer and consumer threads.3. The Producer thread generates a random number through a random number generator function, inserts it into the buffer, prints the number, and increment counter.4. The Consumer thread goes to the buffer, takes a number in the proper order, prints it out, and increment counter.5. After the counter reaches its limit, both threads should be terminated and returned to the main.6. Main program terminates. program and sample run should clearly show the implementation of subtasks through…arrow_forwardIN C++ you will simulate a simple multithreading application with a “producer and consumer” problem Modify “Producer and Consumer Problem” from the lecture note so that it can use all buffer space, not “buffersize – 1” as in the lecture note. This program should work as follows: 1. The user will run the program and will enter two numbers on the command line.Those numbers will be used for buffersize and counter limit.2. The main program will then create separate producer and consumer threads.3. The Producer thread generates a random number through a random number generator function, inserts it into the buffer, prints the number, and increment counter.4. The Consumer thread goes to the buffer, takes a number in the proper order, prints it out, and increment counter.5. After the counter reaches its limit, both threads should be terminated and returned to the main.6. Main program terminates.arrow_forwardConsider the following relations: Professor (profid: integer, name: varchar, salary: integer, age: integer, depid: integer)Department (did: integer, budget: integer, location: varchar, mgr eid: integer) Salaries range from $30,000 to $100,000, ages vary from 20 to 80, each department has about 20 employees on average, there are 10 locations, and budgets vary from $100,000 to $1 million. You can assume uniform distributions of values. For each of the following queries, what index would you choose to speed up the query? If your database system does not consider index-only plans (i.e., data records are always retrieved even if enough information is available in the index entry), how would your answer change? Query1: Print name, age, and salary for all professors. Query2: Find the dids of departments that are located in Edmonton and have a budget of more than $150,000.arrow_forward
- Does the final structure of a B+ tree depend on the order in which the terms are added to it? Answer using an illustration example.arrow_forwardHigh Incidence of Pressure Injuries Due to Delayed Risk Identification: The unit currently relies on manual assessments and paper-based documentation to identify patients at risk of pressure injuries. This often leads to delayed interventions, increasing patient discomfort, length of stay, and costs. An electronic risk assessment and monitoring system could enable earlier identification and timely preventive care. Draw swim lane diagrams with textual descriptions to identify the primary participants and key activities in the business process. The purpose is to capture just the primary steps in the process and who is involved. Note: Please I woud like you to generate a downloadable version or editable Word version of swimlane diagram.arrow_forwardHigh Incidence of Pressure Injuries Due to Delayed Risk Identification: The unit currently relies on manual assessments and paper-based documentation to identify patients at risk of pressure injuries. This often leads to delayed interventions, increasing patient discomfort, length of stay, and costs. An electronic risk assessment and monitoring system could enable earlier identification and timely preventive care. Draw swim lane diagrams with textual descriptions to identify the primary participants and key activities in the business process. The purpose is to capture just the primary steps in the process and who is involved.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781285196145Author:Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos CoronelPublisher:Cengage Learning
A Guide to SQLComputer ScienceISBN:9781111527273Author:Philip J. PrattPublisher:Course Technology Ptr
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781305627482Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programming with Microsoft Visual Basic 2017Computer ScienceISBN:9781337102124Author:Diane ZakPublisher:Cengage Learning
Np Ms Office 365/Excel 2016 I NtermedComputer ScienceISBN:9781337508841Author:CareyPublisher:Cengage
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
A Guide to SQL
Computer Science
ISBN:9781111527273
Author:Philip J. Pratt
Publisher:Course Technology Ptr
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781305627482
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programming with Microsoft Visual Basic 2017
Computer Science
ISBN:9781337102124
Author:Diane Zak
Publisher:Cengage Learning
Np Ms Office 365/Excel 2016 I Ntermed
Computer Science
ISBN:9781337508841
Author:Carey
Publisher:Cengage
dml in sql with examples; Author: Education 4u;https://www.youtube.com/watch?v=WvOseanUdk4;License: Standard YouTube License, CC-BY