Presentation is loading. Please wait.

Presentation is loading. Please wait.

R McFadyen 192.2911 Activity Diagrams Activity diagrams are used to present the procedural steps of an algorithm An algorithm comprises any of the following.

Similar presentations


Presentation on theme: "R McFadyen 192.2911 Activity Diagrams Activity diagrams are used to present the procedural steps of an algorithm An algorithm comprises any of the following."— Presentation transcript:

1 R McFadyen 192.2911 Activity Diagrams Activity diagrams are used to present the procedural steps of an algorithm An algorithm comprises any of the following structures: sequence decision repetition

2 R McFadyen 292.2911 Activity Diagrams start end branch merge fork join guard transition swimlanes activity Symbols

3 R McFadyen 392.2911sequence

4 R McFadyen 492.2911sequence Activity 1Activity 2Activity 3 Activities 1, 2, 3 follow one another in sequence. Activity 3 cannot start until Activity 2 is done, etc.

5 R McFadyen 592.2911 Example: instructions to make Zucchini Relish Combine vegetables with pickling salt and leave overnight Drain and rinse Combine remaining Ingredients with vegetables Boil 20 minutes Put in sterilized jars

6 R McFadyen 692.2911 conditional path / 2-way switch

7 R McFadyen 792.2911 conditional path / 2-way switch Activity 1 Activity 2 [condition 1] [condition 2] One of two paths is chosen Same symbol for decision as for merge

8 R McFadyen 892.2911 Example: instructions to make Zucchini Relish Combine vegetables with pickling salt and leave overnight Drain and rinse Combine remaining Ingredients with vegetables Boil 20 minutes Put in sterilized jars Go and purchase ingredients [ Missing some ingredients ] [ have all ingredients ]

9 R McFadyen 992.2911 if ( count > 0 ) average = sum / count; else average = 0.0; System.out.println (average); Example - programming [ count > 0 ] [ count <= 0 ] Average  sum/count Average  0 Print average

10 R McFadyen 1092.2911 multiway switch

11 R McFadyen 1192.2911 multiway switch Activity 1 Activity n One of several paths is chosen Same symbol for decision as for merge Activity 2 [condition2] [condition1] [condition n]

12 R McFadyen 1292.2911 Example – multiway switch switch (watts) { case 40: price = 0.50; break; case 60: price = 0.69; break; case 75: price = 0.85; break; case 100: case 150: price = 1; break; default: price = 0; System.out.print (“No bulb ” +watts + “watts in stock”); } // end switch

13 R McFadyen 1392.2911 Example – multiway switch Price  0.50 [watts= 40 ] Price  0.69 Price  0.85 Price  1.00 Price  0.00 [watts= 60 ] [watts= 100 or 150 ] [ watts 40, 60, 100, 150 ] [watts= 75 ] Print No bulb message

14 R McFadyen 1492.2911 iteration / looping

15 R McFadyen 1592.2911 iteration / looping Processing before test [ exit condition ] Processing after test [ continue condition ]

16 R McFadyen 1692.2911 int next; // the next number int sum = 0;// the sum so far int count = 0;// initialize loop counter while (count < MAX) {// test loop counter readInt(next); // get next number sum = sum + next;// add next number to sum count = count + 1; // increment loop counter } // end loop Example - programming

17 R McFadyen 1792.2911 Increment count [ Count < Max ] Read next integer Add integer to sum Sum  0 Count  0 Example - programming

18 R McFadyen 1892.2911parallelism/concurrency

19 R McFadyen 1992.2911parallelism/concurrency Activity 1 Activity 2 Activity 3 Both paths are performed in parallel. Activity 1 and 2 begin when Activity 0 is finished. Activity 0 Activity 4 Activity 4 begins when Activity 1 and 3 have both completed

20 R McFadyen 2092.2911 Example: instructions to make Zucchini Relish Combine vegetables with pickling salt and leave overnight Drain and rinse Combine remaining Ingredients with vegetables Boil 20 minutesPut in sterilized jars Chop onionsChop ZucchiniChop green peppersChop red peppers

21 R McFadyen 2192.2911 Example - Updating a Star Schema

22 R McFadyen 2292.2911 Example - Updating a Star Schema Churn Star Schema from The Official Guide to Informix/Red Brick Data Warehousing Rate_plan Period Customer Churn_reason Carrier Telephone Churn credit_limit outstanding_balance current_bill A Star Schema is a specialized ERD used in Data Warehousing. To update the database, we: (1) update each Dimension, and then (2) update the Fact table

23 R McFadyen 2392.2911 Example - Updating a Star Schema Update Customer Update Churn Update Rate plan Update Churn Reason Update Telephone Update Carrier Update Period

24 R McFadyen 2492.2911 Example - Updating a Star Schema Update Customer Update Churn Update Rate plan Update Churn Reason Update Telephone Update Carrier Update Period The dimensions can be updated independently of one another. Those activities can be carried on concurrently

25 R McFadyen 2592.2911Swimlanes

26 R McFadyen 2692.2911Swimlanes Org 1Org 2Org 3 An activity diagram can be partitioned according to organizational units Org n…

27 R McFadyen 2792.2911Swimlanes Activity 1 Activity 2 Activity 3 Swimlanes When we assign activities to particular organizational units, then we can partition the flow into swimlanes, one swimlane per unit. Activity 0 Activity 4 Org 1Org 2Org 3Org 4

28 R McFadyen 2892.2911Swimlanes Workflow for an Order Request product Customer SalesWarehouse A customer requests a product. The order is handled by Sales, and then the Warehouse picks the materials and ships the order. Then, the customer will receive the order and Sales will send out the bill. When the customer receives the bill, it is paid, and the order is closed by Sales. Process Order Pick & Ship Receive Order Send Bill Pay Bill Order Closed Receive Bill


Download ppt "R McFadyen 192.2911 Activity Diagrams Activity diagrams are used to present the procedural steps of an algorithm An algorithm comprises any of the following."

Similar presentations


Ads by Google