| 1. | Basic blocks form the vertices or nodes in a control flow graph.
|
| 2. | Signal flow graph of a circuit containing a two port.
|
| 3. | An edge in a control flow graph represents possible transfer of control.
|
| 4. | The equations represented by the resulting signal flow graph are as follows:
|
| 5. | Signal flow graphs can be used to solve sets of simultaneous linear equations.
|
| 6. | Signal-flow graphs are weighted, directed graphs.
|
| 7. | Shannon is credited with the invention of signal-flow graphs, in 1942.
|
| 8. | If the control flow graph does contain cycles, a more advanced algorithm is required.
|
| 9. | True dynamic reactive programming however could use imperative programming to reconstruct the data flow graph.
|
| 10. | The two flow graph representations are equivalent.
|
