Computer Science: An Overview (12th Edition)
12th Edition
ISBN: 9780133760064
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 9, Problem 46CRP
Explanation of Solution
Interweaving to get $100 final balance:
- Initial balance in the account is $200.
- A balance of $100 would result if the second transaction retrieved the original amount and stored its new balance before the execution of first transaction.
- Suppose the transitions are represented as:
- T1: adding $100.
- T2: withdrawing $100.
- T3: storing the new balance of account A.
- So, the sequence of transactions followed to obtain $100 as the final balance is T2, T3, and T1. First $100 is withdrawn from the initial amount $200. Then the new balance of account A $100 is stored before adding $100 to account A.
Interweaving to get $300 final balance:
- Initial balance in the account is $200...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
For the following scenario for a point of sale system, draw the
following:
• A mail order company that distributes CDs and tapes at discount
prices to record club members (tells the purpose of the system).
• When an order processing clerk receives an order form, she
verifies that the sender is a club member by checking the
MEMBER FILE. If the sender is not a member, the clerk returns
the order along with a membership application form.
• If the customer is a member, the clerk verifies the order item data
by checking the ITEM FILE.
Then the clerk enters the order data and saves it to the DAILY
ORDERS FILE.
• At the same time, the clerk also prints an invoice and shipping
list for each order, which are forwarded to the ORDER
FULFILLMENT DEPARTMENT for processing there.
Answer:
Consider a database with objects X and Y and assume that there are
two transactions T1 and T2. Transaction T1 reads objects X and Y and then writes
object X. Transaction T2 reads objects X and Y and then writes objects X and Y.
1. Give an example schedule with actions of transactions T1 and T2 on objects X
and Y that results in a write-read conflict.
2. Give an example schedule with actions of transactions T1 and T2 on objects X
and Y that results in a read-write conflict.
3. Give an example schedule with actions of transactions T1 and T2 on objects X
and Y that results in a write-write conflict.
A company has various rules for how payments to suppliers are to be authorized.Some payments are in response to an approved purchase order. For approved purchase orders under $5,000, the accountingclerk can immediately issue a check againstthat purchase order and sign the check. Forapproved purchase orders between $5,000and $10,000, the accounting clerk can immediately issue a check but must additionallyobtain a second signature. Payments for approved purchase orders over $10,000 alwaysrequire the approval of the accounting manager to issue the check as well as the signature of two accounting clerks. Payments thatare not covered by a purchase order that areunder $5,000 must be approved by the accounting manager and a departmental manager who will absorb the cost of the paymentinto that department’s budget. Such checkscan be signed by a single accounting clerk.Payments that are not covered by a purchaseorder that are between $5,000 and $10,000must be approved by the accounting…
Chapter 9 Solutions
Computer Science: An Overview (12th Edition)
Ch. 9.1 - Identify two departments in a manufacturing plant...Ch. 9.1 - Prob. 2QECh. 9.1 - Summarize the roles of the application software...Ch. 9.2 - Prob. 1QECh. 9.2 - Prob. 2QECh. 9.2 - Prob. 4QECh. 9.2 - Prob. 5QECh. 9.2 - Prob. 6QECh. 9.3 - Prob. 1QECh. 9.3 - What is a persistent object?
Ch. 9.3 - Identify some classes as well as some of their...Ch. 9.3 - Prob. 4QECh. 9.4 - Prob. 1QECh. 9.4 - Prob. 2QECh. 9.4 - Prob. 3QECh. 9.4 - Prob. 4QECh. 9.4 - Prob. 5QECh. 9.4 - Prob. 6QECh. 9.5 - Prob. 1QECh. 9.5 - Prob. 2QECh. 9.5 - Prob. 3QECh. 9.5 - Prob. 4QECh. 9.5 - Prob. 5QECh. 9.5 - Prob. 6QECh. 9.5 - Prob. 7QECh. 9.6 - Prob. 1QECh. 9.6 - Give an additional example of a pattern that might...Ch. 9.6 - Prob. 3QECh. 9.6 - How does data mining differ from traditional...Ch. 9.7 - Prob. 1QECh. 9.7 - Prob. 2QECh. 9.7 - Prob. 3QECh. 9.7 - Prob. 4QECh. 9 - Prob. 1CRPCh. 9 - Prob. 2CRPCh. 9 - Prob. 3CRPCh. 9 - Prob. 4CRPCh. 9 - Prob. 5CRPCh. 9 - Prob. 6CRPCh. 9 - Prob. 7CRPCh. 9 - Prob. 8CRPCh. 9 - Prob. 9CRPCh. 9 - Prob. 10CRPCh. 9 - Prob. 11CRPCh. 9 - Prob. 12CRPCh. 9 - Using the commands SELECT, PROJECT, and JOIN,...Ch. 9 - Answer Problem 13 using SQL. PROBLEM 13 13. Using...Ch. 9 - Prob. 15CRPCh. 9 - Prob. 16CRPCh. 9 - Prob. 17CRPCh. 9 - Prob. 18CRPCh. 9 - Prob. 19CRPCh. 9 - Empl Id Name Address SSN Job Id Job Title Skill...Ch. 9 - Empl Id Name Address SSN Job Id Job Title Skill...Ch. 9 - Prob. 22CRPCh. 9 - Prob. 23CRPCh. 9 - Prob. 24CRPCh. 9 - Prob. 25CRPCh. 9 - Write a sequence of instructions (using the...Ch. 9 - Prob. 27CRPCh. 9 - Prob. 28CRPCh. 9 - Prob. 29CRPCh. 9 - Prob. 30CRPCh. 9 - Prob. 31CRPCh. 9 - Prob. 32CRPCh. 9 - Prob. 33CRPCh. 9 - Prob. 34CRPCh. 9 - Prob. 35CRPCh. 9 - Prob. 36CRPCh. 9 - Prob. 37CRPCh. 9 - Prob. 38CRPCh. 9 - Prob. 39CRPCh. 9 - Prob. 40CRPCh. 9 - Prob. 41CRPCh. 9 - Prob. 42CRPCh. 9 - Prob. 43CRPCh. 9 - Prob. 44CRPCh. 9 - Prob. 45CRPCh. 9 - Prob. 46CRPCh. 9 - Prob. 47CRPCh. 9 - Prob. 48CRPCh. 9 - Prob. 49CRPCh. 9 - Prob. 50CRPCh. 9 - Prob. 51CRPCh. 9 - Prob. 52CRPCh. 9 - Prob. 53CRPCh. 9 - Prob. 54CRPCh. 9 - Prob. 55CRPCh. 9 - Prob. 56CRPCh. 9 - Prob. 57CRPCh. 9 - Prob. 58CRPCh. 9 - Prob. 59CRPCh. 9 - Prob. 60CRPCh. 9 - Prob. 61CRPCh. 9 - Prob. 62CRPCh. 9 - Prob. 1SICh. 9 - Prob. 2SICh. 9 - Prob. 3SICh. 9 - Prob. 4SICh. 9 - Prob. 5SICh. 9 - Prob. 6SICh. 9 - Prob. 7SICh. 9 - Prob. 8SICh. 9 - Prob. 9SICh. 9 - Prob. 10SI
Knowledge Booster
Similar questions
- In the 2PL algorithm we considered, a transaction can't start until it has acquired all the locks it needs (we call this, Conservative 2PL). There is a different scheme possible, where a transaction does NOT need to wait for all its locks - it can start its transactions before all the locks have been acquired. What would be good about such a scheme, and, what would be bad? Do feel free to illustrate with a diagram.arrow_forwardWhen a transaction is aborted, we have said that the world is restored to its previous state, as though the transaction had never happened. We lied. Give an example where resetting the world is impossible.arrow_forwardDraw an ER diagram using Cardinality Notation for the following description: A veterinary hospital only treats dogs and cats (use ISA). Clients have an address, phone number and client ID. Each pet has a name, a pet ID and belongs to exactly one client. Each client can have at most 5 cats and 2 dogs.arrow_forward
- We have the following transactions with associated schedulesT1: R(A) R(B) W(A)T2: R(A) R(B) W(A) W(B)a) Give the schedule of transactions T1 and T2 that leads to a WR conflict.b) Give the schedule of transactions T1 and T2 that lead to RW conflict.c) Give the schedule of transactions T1 and T2 that leads to a WW conflict.d) For each of the given schedules, show how a strict 2FZ would prevent this.arrow_forwardPrimeVideo is a startup company providing concierge DVD kiosk service in upscale neighborhoods. PrimeVideo can own several copies (VIDEO) of each movie (MOVIE). For example, a kiosk may have 10 copies of the movie Twist in the Wind. In the database, Twist in the Wind would be one MOVIE, and each copy would be a VIDEO. A rental transaction (RENTAL) involves one or more videos being rented to a member (MEMBERSHIP). A video can be rented many times over its lifetime; therefore, there is an M:N relationship between RENTAL and VIDEO. DETAILRENTAL is the bridge table to resolve this relationship. The complete ERD is provided in the figure. Write the SQL code to create the table structures for the entities shown in the figure. The structures should contain the attributes specified in the ERD. Use data types (and lengths, if applicable) that are appropriate for the data that will need to be stored in each attribute. Enforce primary key and foreign key constraints as indicated by the ERD. Make…arrow_forwardConsider the following two transactions: T1 = R(A). W(A), R(B), R(C) T2 - W(C). R(B), R(A). W(B) Say that sharing lock, exclusive lock, and unlock actions are inserted by the scheduler, resulting in the following annotated transactions: T1 - X(A), R(A), W(A), S(B), R(B), S(C), U(A), R(C), U(B), S(C) T2 - X(C), W(C), X(B), S(A), U(C), R(B), R(A), U(A), W(B), U(B) The above schedule follows 2 PL so conflict serializability is guaranteed. O True O Falsearrow_forward
- a. Which itemsets (of any length) are frequent if you know that {ace} and {ad} are the only maximal frequent itemsets? b. If all transactions that contain {bcd} also contain {def}, which of the following itemsets {bcd}, {def}, {bcde}, {bcdf}, {bcdef} are not closed?arrow_forwardSuppose half of all the transactions in a clothes shop purchase jeans, and onethird of all transactions in the shop purchase T-shirts. Suppose also that half of the transactions that purchase jeans also purchase T-shirts. Write down all the (nontrivial) association rules you can deduce from the above information, giving support and confidence of each rule.arrow_forwardGiven the following scenario for a bank system: Āssume that there is one teller in bank "A". The bank has the following details: / One teller. / 10 waiting seats. When the customer arrives, he needs to use one of the waiting seats for roughly 10 minutes. When the teller starts serving the customer, he needs to authenticate the customer using his ID and then he will be able to perform the required transactions, which include money transfer (10 minutes), deposit (5 minutes), withdraw (5 minutes). After that the customer account will be updated. If the update is successfully completed, the customer can leave the bank. You are required to provide an example of the following: Entity: > Event: > Activity: Delay: System: In this bank system, what is your suggested discipline to be fair with all customers?arrow_forward
- c) Consider a scenario where a fraudulent dealer sends an electronic message to a stock agent, asking him to buy $5,000 worth of shares in CryptoBitCoin. The following day the value of CryptoBitCoin shares rises significantly. The dealer now acts that his original message was asking to purchase $50,000 worth of shares. On the contrary, if the share price drop, the dealer might act that the original message asked to buy shares in KryptoBitCoin instead. Based on this scenario, would you consider the dealer's action a breach of any information security goal(s)? If your answer is no, clearly explain the reasoning behind your answer. If your answer is yes, identify the breached security goal(s) with necessary explanation of your answer, and recommend suitable primitive(s) that can be used to address the corresponding security goal(s).arrow_forwardA transactional data set is as follows {(A,B), (A,C), (A,D), (B,C), (B,D), (A,B,C), (A, B, D)} Items in parenthesis are purchased together. What is the number of null transaction with respect to the rule if A than C? О а. 0 O b. 3 О с. 2 O d. 1arrow_forwardConsider the following two transactions: T1-R(B), W(B), R(C), R(A) T2-R(B). W(B) Say that sharing lock, exclusive lock, and unlock actions are inserted by the scheduler, resulting in the following annotated transactions: T1= X(B), R(B), W(B), S(C), R(C), S(A), U(B), R(A), U(C), U(A) T2-X(B), R(B), W(B), U(B) Cascading rollback is not possible for the above schedule. True Falsearrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
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