Race conditions are possible in many computer systems. Consider an online auction system where the current highest bid for each
item must be maintained. A person who wishes to bid on an item calls the bid(amount) function, which compares the amount being bid to the current highest bid. If the amount exceeds the current highest bid, the highest bid is set to the new amount. This is illustrated below:double amount = 0.0;void bid(double amount) { if (amount > highestBid) highestBid = amount;}Describe how a race condition is possible in this situation (you may describe it with some scenario)?What might be done to prevent the race condition from occurring? (you may just modify the code using "acquire()" and "release()" statements)
1 answer:
You might be interested in
Answer: At time 18.33 seconds it will have moved 500 meters.
Explanation:
Since the acceleration of the car is a linear function of time it can be written as a function of time as
Integrating both sides we get
Now since car starts from rest thus at time t = 0 ; v=0 thus c=0
again integrating with respect to time we get
Now let us assume that car starts from origin thus D=0
thus in the first 15 seconds it covers a distance of
Thus the remaining 125 meters will be covered with a constant speed of
in time equalling
Thus the total time it requires equals 15+3.33 seconds
t=18.33 seconds