### Enumeration of structured flowchartsEnumeration of structured flowcharts

Access Restriction
Subscribed

 Author Bender, Edward A. ♦ Butler, Jon T. Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©1985 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Abstract An analysis of structured flowcharts is presented, where size is measured by the number, $\textit{n},$ of decision nodes (IF-THEN-ELSE and DO-WHILE nodes). For all classes of structured flowcharts considered, the number of charts is approximately, $\textit{cn}-3/2\textit{γn},$ for large $\textit{n},$ where $\textit{c}>and$ $\textit{γ}$ are parameters that depend on the class. It is also shown that most large flowcharts consist of a short sequence of basic charts (IF-THEN-ELSE and DO-WHILE charts). The average length of such sequences is 2.5. ISSN 00045411 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 1985-07-01 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 32 Issue Number 3 Page Count 12 Starting Page 537 Ending Page 548

#### Open content in new tab

Source: ACM Digital Library