• Shuffle
    Toggle On
    Toggle Off
  • Alphabetize
    Toggle On
    Toggle Off
  • Front First
    Toggle On
    Toggle Off
  • Both Sides
    Toggle On
    Toggle Off
  • Read
    Toggle On
    Toggle Off
Reading...
Front

Card Range To Study

through

image

Play button

image

Play button

image

Progress

1/20

Click to flip

Use LEFT and RIGHT arrow keys to navigate between flashcards;

Use UP and DOWN arrow keys to flip the card;

H to show hint;

A reads text to speech;

20 Cards in this Set

  • Front
  • Back
We live in an almost completely designed world.
True
The strength of modeling, as well as its greatest weakness, is that a model is an abstraction of its target.
True
A design method typically specifies a design process, design notations, and
design heuristics.
True
In a UML activity diagram, a guard is a diamond-shaped node that is a junction point for multiple arrows that guards against deadlock.
False
Conceptual models represent the ideas that a client has about a program while analysis class models represent the important entities in a problem.
False
In UML class diagrams, classes are represented by symbols that always have three compartments.
False
An interface is a boundary across which entities communicate.
True
A design principle is rule of thumb for making a design better.
False
A quality attribute in architectural design is an internal characteristic of an architecture, such as information hiding or coupling, that is used to evaluate an architecture.
False
When you explain what you can accomplish by using an operation, you are explaining its pragmatics.
True
When you state and pre- and post conditions of an operation, you are stating its syntax.
False
Box-and-line diagrams should always have a legends.
True
Christopher Alexander is a famous software architect.
False
If A calls B, then A uses B.
True
If A uses B, then A calls B.
False
Every T program must have at least one pragma.
False
A state in a T program can be both final and initial.
True
There must be at least one initial state in a T program.
True
There must be at least one final state in a T program.
False
Every state in a T program must have a default transition.
False