Race conditions are possible in many computer systems. Consider a banking system with two methods: deposit (amount) and withdraw(amount). These two methods are passed the amount that is to be deposited or withdrawn from a bank account. Assume that a husband and wife share a bank account with a balance of $250.00 and that concurrently the husband calls the withdraw () method of $50.00 and the wife calls deposit () of $100.00. Describe how a race condition is possible and can cause an incorrect balance. What might be done to prevent the race condition from occurring?

Race conditions are possible in many computer systems. Consider a banking system with two methods: deposit (amount) and withdraw(amount). These two methods are passed the amount that is to be deposited or withdrawn from a bank account. Assume that a husband and wife share a bank account with a balance of $250.00 and that concurrently the husband calls the withdraw () method of $50.00 and the wife calls deposit () of $100.00. Describe how a race condition is possible and can cause an incorrect balance. What might be done to prevent the race condition from occurring?

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter10: Classes And Data Abstraction

Section: Chapter Questions

Problem 19PE

See similar textbooks

Similar questions

1.Implement Thirsty problem using semaphore . Scenario:To drink, a thirsty person must have three things; water, ice and a glass.There are three thirsty people, each having a different one (and only one) of the three required items. A fourth person, a server has unlimited supply of all three items. If nobody is drinking, the server places two of the three items (chosen at random) onto table. Thirsty person who can make a drink from those two items will pick them up and drink a glass of ice water. When done, thirsty person will notify the server and the process will repeat.
A vending machine is an automated machine that provides items such as snacks and beveragesto the consumers after the cash is inserted to the machine. For example, a vending machine todispense candies where the vending machine accepts 10 cent and 20 cent coins only. The priceof the candy is 30 cents. Therefore, the machine will automatically dispense the candywhenever it has received 30 cents. If it receives more that 30 cents, it will dispense the candywith the balance money. In this assignment, you are required to propose and design a vendingmachine controller for the above specifications. Assume that there are two outputs for thevending machine controller, which are F and G. F = 1 and G = 0 indicate 30 cents have beenreceived and there is no balance money. F = 1 and G = 1 indicate the machine received morethat 30 cents and need to return the balance money. Figure 1 show the block diagram of FSM the code down show Verilog program for the system you need to do the tech bench code…
A vending machine is an automated machine that provides items such as snacks and beveragesto the consumers after the cash is inserted to the machine. For example, a vending machine todispense candies where the vending machine accepts 10 cent and 20 cent coins only. The priceof the candy is 30 cents. Therefore, the machine will automatically dispense the candywhenever it has received 30 cents. If it receives more that 30 cents, it will dispense the candywith the balance money. In this assignment, you are required to propose and design a vendingmachine controller for the above specifications. Assume that there are two outputs for thevending machine controller, which are F and G. F = 1 and G = 0 indicate 30 cents have beenreceived and there is no balance money. F = 1 and G = 1 indicate the machine received morethat 30 cents and need to return the balance money. need to do Verilog program and techbench and the rsuilt
A vending machine is an automated machine that provides items such as snacks and beveragesto the consumers after the cash is inserted to the machine. For example, a vending machine todispense candies where the vending machine accepts 10 cent and 20 cent coins only. The priceof the candy is 30 cents. Therefore, the machine will automatically dispense the candywhenever it has received 30 cents. If it receives more that 30 cents, it will dispense the candywith the balance money. In this assignment, you are required to propose and design a vendingmachine controller for the above specifications. Assume that there are two outputs for thevending machine controller, which are F and G. F = 1 and G = 0 indicate 30 cents have beenreceived and there is no balance money. F = 1 and G = 1 indicate the machine received morethat 30 cents and need to return the balance money.need to provide the FSM, the block diagram of your FSM, tech bench based on this Verilog program; module veding2(clk, rst, w,…
A hungry mouse wants to eat all four fruits in a maze such as the one below, in as few moves as possible.. At each turn the mouse can move any number of squares in one of the directions up, down, left or right, but it is not allowed to enter (or jump over) any walls (i.e., the black squares). Thus, the mouse moves just like a rook in chess. To eat a fruit, the mouse has to stop at that square. Assume that the maze has 4 fruits, and the size of b xh squares. 1. Give a suitable representatión of the states in this searching problem. 2. How many possible actions can the mouse perform at each move? (1.e., what is the branching factor?)
Using JAVA solve the below problem Amitabh had a magical cat. That cat once fell down an empty well. As the walls of the well were not completely vertical, the cat could climb up the well. In one day, the cat can climb 1 unit height and the height of the well is h units. The cat starts at the bottom. Every day, a cat would divide into 2 cats. One of them would climb up 1 unit. The other would wait for help. But while waiting it would fall asleep and roll down 1 unit, unless it is already at the bottom, in which case it just remains there. When a cat would reach the top, it would run home toAmitabh. (Schrodinger doesn't know that some of the cats are in a well and so he can't rescue them). It has been d days since the cat fell into the well. How many cats would come out of the well today? You would notice that the number of cats grows very large with each passing day, so output the answer modulo 10^9+7. d = 0 means that the cat has fallen just now and so there's just one cat at the…
You will be given a square chess board with one queen and a number of obstacles placed on it. Determine how many squares the queen can attack. A queen is standing on an chessboard. The chess board's rows are numbered from to , going from bottom to top. Its columns are numbered from to , going from left to right. Each square is referenced by a tuple, , describing the row, , and column, , where the square is located. The queen is standing at position . In a single move, she can attack any square in any of the eight directions (left, right, up, down, and the four diagonals). In the diagram below, the green circles denote all the cells the queen can attack from : There are obstacles on the chessboard, each preventing the queen from attacking any square beyond it on that path. For example, an obstacle at location in the diagram above prevents the queen from attacking cells , , and : Given the queen's position and the locations of all the obstacles, find and print the number of…
Computer science. Correct answer will be upvoted else downvoted. You have an at first void cauldron, and you need to blend an elixir in it. The elixir comprises of two fixings: enchantment pith and water. The elixir you need to blend ought to contain precisely k % sorcery substance and (100−k) % water. In one stage, you can pour possibly one liter of sorcery pith or one liter of water into the cauldron. What is the base number of steps to mix a mixture? You couldn't care less with regards to the complete volume of the elixir, just with regards to the proportion between sorcery substance and water in it. A little update: in the event that you pour e liters of embodiment and w liters of water (e+w>0) into the cauldron, then, at that point, it contains ee+w⋅100 % (without adjusting) sorcery substance and we+w⋅100 % water. Input The primary line contains the single t (1≤t≤100) — the number of experiments. The sole line of each experiment contains a solitary integer k…
A chest of drawers, also called a dresser or a bureau, is a type of cabinet that has multiple parallel, horizontal drawers generally stacked one above another (See Figure 1). Each drawer has a lock to secure any property inside, but sometimes a drawer may not be secure even when it is locked. For instance, imagine a scenario where the second drawer from the top is locked, but the top drawer is not. In such a case, a burglar can access the second drawer by opening the top drawer and gaining access to the property inside the second drawer. Given the number of drawers, n, and the number of secure drawers, k. You can assume that nk. Write an O (nk) algorithm to find a number of ways to ensure that exactly k drawers are secure. For example, the number of drawers n = 6, and number of secure drawers k = 4. The output is 6 (ULLLLL, LULLLL, LLULLL, LLLULL, LLLLUL, and LLLLUU). FIGURE 1. Chest of Drawers
Computer Science Investing in stocks is a way to create assets that are supposed to provide financial security over time. In solving this problem, we assume that an investor buys several shares of stock at a certain price. These shares are going to be sold later on for a different price. Obviously, if the selling price is higher than the acquisition price, the investor makes a profit, registering capital gain. If the shares are sold at a lower price, the investor has a loss, which marks a negative capital gain. This whole process is done over a period of time, and you are required to create a scenario for buying and selling shares. The assumption is that the investor sells shares in the order in which they were purchased. The goal is to calculate the capital gain over time. Suppose that you buy n shares of stock or mutual fund for d dollars each. Later, you sell some of these shares. If the sale price exceeds the purchase price, you have made a profit—a capital gain. On the other…
A medical Centre can have many doctors. A doctor can be scheduled for many appointments but may not have any scheduled appointment at all. A patient can schedule request for one or more appointments. However, every appointment is about only one patient. As a result of every appointment, there must be a bill. One payment is applied to exactly 1 bill, and 1 bill can be paid off over time by several payments. A bill can be outstanding, having nothing yet paid on it at all. One patient can make many payments, but a single payment is made by only 1 patient. Some patients are insured by an insurance company. If they are insured, they can only carry insurance with one company. An insurance company can have many patients carry their policies. For patients that carry insurance, the insurance company will make payments, each single payment is made by exactly 1 insurance company. (Hint: final ERD must include 7 tables.) a) Identify the entities with attributes and keys (primary and foreign keys).…
A chess knight, on one turn, moves either two squares vertically and one horizontally, or two horizontally and one vertically. If we consider a knight starting at the point ⟨x, y⟩ in Z × Z, it has eight possible moves, to ⟨x+1,y+2⟩,⟨x+1,y−2⟩,⟨x−1,y+2⟩,⟨x−1,y−2⟩,⟨x+ 2, y + 1⟩, ⟨x + 2, y − 1⟩, ⟨x − 2, y + 1⟩, or⟨x − 2, y − 1⟩. (a) Prove that given any two points ⟨x, y⟩ and ⟨x′, y′⟩ in Z × Z, there is a sequence of knight moves from the first point to the second. (b) Let a and b be different positive naturals. An (a, b)-knight also has eight possible moves, from ⟨x,y⟩ to ⟨x±a,y±b⟩ or ⟨x±b,y±a⟩. What conditions on a and b allow the (a, b)-knight to go from any point in Z × Z to any other? Prove your answer. (c) If a and b do not meet the conditions of part (b), exactly which points can the (a,b)- knight reach from ⟨x, y⟩