Enumeration of Structured Flowcharts

Abstract

An analysis of structured flowcharts is presented, where size is measured by the number, n, of decision nodes (IF-THEN-ELSE and DO-WHILE nodes). For all classes of structured flowcharts considered, the number of charts is approximately, cn(-3/2)gamma(n) for large n, where c and gamma 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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1985
Accession Number
ADA608082

Entities

People

  • Edward A. Bender
  • Jon T. Butler

Organizations

  • Northwestern University

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Computer Programming
  • Computer Science
  • Electrical Engineering
  • Engineering
  • Equations
  • High Level Languages
  • Language
  • Mathematics
  • Numbers
  • Parallel Computing
  • Parallel Processing
  • Power Series
  • Programming Languages
  • Real Numbers
  • Sequences
  • Software Development
  • Structured Programming

Readers

  • Approximation Theory.
  • Computer Programming and Software Development.
  • Computer Science.