Make Sequence Diagram draw from Supermarket transaction with Type of Combined Fragments as follow: Operator Purpose alt loop Branches & loops alternative interaction repeated interaction
Make Sequence Diagram draw from Supermarket transaction with Type of Combined Fragments as follow: Operator Purpose alt loop Branches & loops alternative interaction repeated interaction
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
![BaL - Alternative (alt)
▪ To model alternative sequences
▪ Guards are used to select the one
path to be executed
■ Guards
alt [...]
[...]
I
▪ Modeled in square brackets
▪ default: true
▪ predefined: [else]
Multiple operands
▪ Guards had to be disjoint to
avoid indeterministic behavior
alt
:Student
opt
register(matNo, exam)
[status == ok]
register: "ok"
:StudentAdmin
System
[status == waiting list free]
register: "w"
[else]
[register on WL == true]
register(matNo, exam)
register: "ok"
register: "error"
Database
enter(matNo, exam)
statusenter: status.
enterWL(matNo, exam)
enterWL: "ok"
BaL- Repeated (loop)
■ To express that a sequence is to be executed repeatedly
Exactly one operand
Keyword loop followed by the minimal/maximal number of iterations (min..max) or (min, max)
default: (*).. no upper limit
I
I
▪ Guard
■ Evaluated as soon as the minimum number of iterations has taken place
▪ Checked for each iteration within the (min, max) limits
If the guard evaluates to false, the execution of the loop is terminated
Guard
loop is executed
at least once,
then as long as
a<1 is true
EXAMPLE DIAGRAM OF COMBINED FRAGMENTS AS REFERENCE TO ANSWER THE QUESTIONS!
Max
Min.
loop(...) [...]
loop(1,*)
[a<1]
K
1
Notation alternatives:
loop (3,8)= loop (3..8)
loop (8,8) loop (8)
loop loop (*) = loop (0,*)](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F273770c6-75e4-47ab-8933-03e6ac16f901%2Febd71772-7ca2-4c8b-9096-55f580b35dc5%2Fd4vszbf_processed.jpeg&w=3840&q=75)
Transcribed Image Text:BaL - Alternative (alt)
▪ To model alternative sequences
▪ Guards are used to select the one
path to be executed
■ Guards
alt [...]
[...]
I
▪ Modeled in square brackets
▪ default: true
▪ predefined: [else]
Multiple operands
▪ Guards had to be disjoint to
avoid indeterministic behavior
alt
:Student
opt
register(matNo, exam)
[status == ok]
register: "ok"
:StudentAdmin
System
[status == waiting list free]
register: "w"
[else]
[register on WL == true]
register(matNo, exam)
register: "ok"
register: "error"
Database
enter(matNo, exam)
statusenter: status.
enterWL(matNo, exam)
enterWL: "ok"
BaL- Repeated (loop)
■ To express that a sequence is to be executed repeatedly
Exactly one operand
Keyword loop followed by the minimal/maximal number of iterations (min..max) or (min, max)
default: (*).. no upper limit
I
I
▪ Guard
■ Evaluated as soon as the minimum number of iterations has taken place
▪ Checked for each iteration within the (min, max) limits
If the guard evaluates to false, the execution of the loop is terminated
Guard
loop is executed
at least once,
then as long as
a<1 is true
EXAMPLE DIAGRAM OF COMBINED FRAGMENTS AS REFERENCE TO ANSWER THE QUESTIONS!
Max
Min.
loop(...) [...]
loop(1,*)
[a<1]
K
1
Notation alternatives:
loop (3,8)= loop (3..8)
loop (8,8) loop (8)
loop loop (*) = loop (0,*)
Transcribed Image Text:Make Sequence Diagram draw from Supermarket
transaction with Type of Combined Fragments as follow:
Operator
Purpose
alt
loop
Branches &
loops
alternative interaction
repeated interaction
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 2 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY