Which is larger, the number of paths in a program or the number of points in its domain?



  • Can someone please help me with this question?!



  • This question is dependent on whether the domain structure is has branching or recursive elements. For example, a simple code containing three function points performed in sequence may have a single path. If those are selected from a case statement, then you could identify the case as one function point (or node) and the number of paths as three (or four if there is a "null" path with no selection made). With branching or recursion, however, the number of paths could become infinite with the addition of a single decision statement that leads back to the original case statement and/or one of the functions calling itself or another of the functions. In that case, only a few point could produce an enormous number of possible paths.


Log in to reply
 

Suggested Topics

  • 2
  • 2
  • 2
  • 2
  • 2