Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Please help!!! Thanks. Problem description: (You may use any of the following: Decision, Merge, Fork, Join, Action, Object and any other nodes.) Draw an Activity

Please help!!! Thanks.

Problem description:

(You may use any of the following: Decision, Merge, Fork, Join, Action, Object and any other nodes.)

Draw an Activity Diagram for the process below:

You have green, red and blue marbles in a single box. The marbles are sorted in the following way by color. One marble is picked at a time from this box, the color of the marble is checked and placed in a green box if it is green, blue box if it is blue and red box if it is red. This process continues until all marbles have been placed in the respective boxes. After this step, the marbles in each box are counted and each box is labeled with the color and count. This step is done in parallel for each of the boxes. The three boxes are then placed in the garage. Assume placing the sorted boxes in the garage is a single task. (Note, the counting is NOT done while sorting the colors).

Note: If you have already chosen a standard sorting algorithm (like Merge Sort or Quick Sort) as your problem, you may submit this as your Activity Diagram instead of the above problem. The Merge and Quick sort algorithms are nice since sub-tasks may be done in parallel and the individual solutions may be joined together (with fork and join).

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Temporal Databases Research And Practice Lncs 1399

Authors: Opher Etzion ,Sushil Jajodia ,Suryanarayana Sripada

1st Edition

3540645195, 978-3540645191

More Books

Students also viewed these Databases questions