When a *task* is accomplished by a task-decomposition *method* (TDM), this implies that the method performs several steps in a particular order, i.e. the method has an *algorithm* associated with it. An algorithm, in turn, consists of interconnected tasks (these are the subtasks of the original, higher-level task) and *iterations*. An iteration specifies repetition of a sequence of tasks (or other, nested iterations); this sequence is, again, represented by an algorithm.

← Back to Models

Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 4.0 International