Content Frame
Note for screen reader users: There is text between the form elements on this page. To be sure that you do not miss any text, use item by item navigation methods, rather than tabbing from form element to form element.
Skip Breadcrumb Navigation
Home  arrow Student Resources  arrow Chapter Quizzes  arrow Chapter 12

Chapter 12

UML Patterns

This activity contains 10 questions.

Question 1.
From a pattern viewpoint, the most significant difference between merge sort and quick sort is:


Open Hint for Question 1 in a new window.
 
End of Question 1


Question 2.
The characters: +, -, #, ~, as prefixes to data and methods in UML diagrams, mean:


Open Hint for Question 2 in a new window.
 
End of Question 2


Question 3.

What can be said about the efficiency of programs developed using the Sorting pattern?
  1. Such programs almost always are highly efficient
  2. Such programs almost always are highly inefficient
  3. The efficiency of the resulting program depends upon the specific algorithms used to implement the split and join methods
  4. The efficiency of the resulting program depends mostly upon the ordering of the data that is sorted

Open Hint for Question 3 in a new window.
 
End of Question 3


Question 4.
What functions do you think are common to most Container-Iterator patterns?
  1. Begin iteration
  2. Access current item
  3. Move to next item
  4. Move to previous item
  5. How many items are there?
  6. Restart iteration
  7. Stop iteration


Open Hint for Question 4 in a new window.
 
End of Question 4


Question 5.

What is (are) the relationship(s) between UML diagrams and Patterns?
  1. UML diagrams provide a pictorial representation of patterns
  2. Patterns are a mechanism for implementation UML diagrams
  3. UML diagrams and Patterns are two tools which are used to facilitate the practice of programming

Open Hint for Question 5 in a new window.
 
End of Question 5


Question 6.

What restriction(s) are there on the use of the Sorting pattern?
  1. The < operator must be defined
  2. The compareTo method must be defined
  3. Some way to compare all pairs of elements in the set to be sorted must be defined
  4. Either the < operator or the > operator must be defined

Open Hint for Question 6 in a new window.
 
End of Question 6


Question 7.

Which of the following statements are true?
  1. UML class diagrams are connected by upward-pointing arrows, pointing towards their immediate ancestor
  2. UML class diagrams are connected by upward-pointing arrows, pointing towards their immediate successors
  3. In Java, an UML class diagram can have several upward-pointing arrows leaving from it
  4. In Java, an UML class diagram can have several upward-pointing arrows pointing to it

Open Hint for Question 7 in a new window.
 
End of Question 7


Question 8.

Which of these statements is true?
  1. Since Java has but single inheritance, UML inheritance diagrams will be tree-like
  2. Since Java has but single inheritance, UML inheritance diagrams will be graph-like
  3. Since Java has multiple inheritance, UML inheritance diagrams will be tree-like
  4. Since Java has multiple inheritance, UML inheritance diagrams will be graph-like

Open Hint for Question 8 in a new window.
 
End of Question 8


Question 9.

Which statement(s) are correct? The Model-View-Controller pattern:
  1. Is particularly appropriate for GUIs
  2. frequently is used for sorting
  3. can provide for more than a single view
  4. almost always deals with more than a single model
  5. is an example of applying "divide and conquer" strategy to the art of design
 
End of Question 9


Question 10.

Which statement(s) are true?
  1. UML and patterns are tools designed specifically for Java
  2. UML and patterns are tools designed for all general-purpose programming languages
  3. UML and patterns are tools designed for object-oriented programming languages
  4. UML and patterns are tools designed for structured programming languages

Open Hint for Question 10 in a new window.
 
End of Question 10





Pearson Copyright © 1995 - 2010 Pearson Education . All rights reserved. Pearson Addison Wesley is an imprint of Pearson .
Legal Notice | Privacy Policy | Permissions

Return to the Top of this Page