8.11 Problems

 < Day Day Up > 



8.11 Problems

  1. Animate the Bounded Buffer problem in Chapter 3 using the method described in Section 8.9.

  2. Choose any other problem at the end of Chapter 3 and animate it using the method described in Section 8.9.

  3. Show that the state diagrams in Problems 3.7, 3.8, and 3.9 are incorrect by animating them and running them long enough for the predicted anomalies to occur.

  4. If you run the gas station simulation long enough, it shows that the wait and notify in Java are unfair. How does it show this? Does this happen frequently?

  5. Create a type of path that can store two or more straight line segments and uses these segments sequentially to generate the points when nextPosition is called. Use this new type of path to move with one call from the Parking area to the pump.



 < Day Day Up > 



Creating Components. Object Oriented, Concurrent, and Distributed Computing in Java
The .NET Developers Guide to Directory Services Programming
ISBN: 849314992
EAN: 2147483647
Year: 2003
Pages: 162

flylib.com © 2008-2017.
If you may any questions please contact us: flylib@qtcs.net