Full path coverage, of the type described above, is usually impractical or impossible. Any module with a succession of n {\displaystyle n} decisions in it can have up to 2 n {\displaystyle 2^{n}} paths within it; loop constructs can result in an infinite number of paths. More @Wikipedia
Hover over any link to get a description of the article. Please note that search keywords are sometimes hidden within the full article and don't appear in the description or title.
Bookmark or Share