Computer Science 340 Assignments

(most recent first - please note renumbering of the most recent three exercises)

All exercises should be turned in at the start of class on the due-date unless otherwise indicated.

• Exercise #8, Due Wednesday, Dec. 1:  Please work
• 18.1 - 18.5 on page 438
• 19.1 – 19.5 on page 461
22.1, 22.4, 22.6 on page 536
• 23.1, 23.2 on page 565
• Exercise #7, Due Friday, Nov. 19: Please work
• Problems 15.1, 15.2 on page 359
• Problems 16.1, 16.3 on page 386
• Problems 17.1 - 17.4 on page 414
• Exercise #6, Due Wednesday, Nov. 17: 

  Taken from problems 14.7 – 14.9 on page 338

  A group diary and time management system is intended to support the timetabling of meetings and appointments across a group of coworkers.  When an appointment is to be made that involves a number of people, the system finds a common slot in each of their diaries and arranges the appointment for that time.  If no common slots are available, it interacts with the user to rearrange his or her personal diary to make room for the appointment. 

  1.         Identify possible objects in this system and develop an object-oriented design for them.  You may make any reasonable assumptions about the systems when deriving the design (but write these assumptions down).  Identify static relationships (including hierarchical and aggregation relationships)

  2.         Write precise interface definitions in Java or C++ for the objects you have defined.

  3.         Draw a sequence diagram showing the interactions of objects when a group of people arrange a meeting.

  4.         Draw a statechart showing the possible state changes in one or more of these objects.

  In class Nov. 3:  Work part 1 as far as you can (reasonably) get in the short time provided in class, and make a brief presentation.

  Before Wednesday, Nov. 17:  Complete the assignment as a group.  Prepare both a written solution and a PowerPoint presentation.

  Wednesday, Nov. 17:  We will spend the time in formal presentations of the group work.  Turn in the written solution and (in handouts format) the PowerPoint presentation.  The length of presentations will depend on the number of small groups, but plan on no more than ten minutes with time for setup and questions/answers.  Presentations must be completed on this date.

  Value: 25 points, of which 5 points will be allocated to the presentation.

• Exercise #5, Due Friday, Oct. 29:  (15 pts.)  Please work
• Problems 11.3 (two points), 11.4 (three points), 11.5 (three points), 11.6 on pages 264 - 265
• Problems 12.1 - 12.5 on pages 290 - 291.  12.3 will be valued at two points.
• Exercise #4, Due Wednesday, Oct. 13:  (15 pts.) Please work:
  • Problems 7.1, 7.2,  and 7.5 on pages 167 - 168.  Problem 7.5 will be worth 3 points.
  • 8.1, 8.2 (2 points each), 8.3 (3 points) on page 191.
  • Build an object-oriented data design for the Hoh River College project discussed in class on Monday, Oct. 4.  Incorporate inheritance and aggregation.  Use Rational Rose if you can, but, since we will not have a chance to see a demonstration of RR until next Monday, sketches will be fine.  3 points.
• Exercise #3, Due Wednesday, Oct. 6:  Small Group Project modified from problems 6.3 - 6.5 (with additions) on page 141.
• Due Friday, Sept. 24 (10 pts.): Please work the following problems:
• 4.1, 4.2, 4.4, 4.5 on page 91
• 5.1, 5.2, 5.3, 5.6 on page 112. Problem 5.6 will be worth 3 points.
• Due Friday, Sept. 17:  (15 pts.) Please work the following problems:
• 1.2, 1.3, and 1.4 on page 18
• 2.2, 2.4, 2.6 (see if you can use Visio for the graphics), 2.8 (see the Computerworld article just forwarded) on pages 41, 42. Problem 2.6 will be worth 5/15 points.
• 3.6, 3.7, 3.8, 3.9 on page 62.
.
•