| 85 |
where you explain how one could use the structural measures |
where you explain how one could use the structural measures |
| 86 |
(specify which structural measure) to ensure the quality of the |
(specify which structural measure) to ensure the quality of the |
| 87 |
software product.} |
software product.} |
| 88 |
svar |
%http://sern.ucalgary.ca/~kliewerc/SENG/623/summaries.htm#sum02 var lite halvbra... det bästa jag kunde hitta dock, + F4... |
| 89 |
|
Control flow is a diagram with nodes, connected via the |
| 90 |
|
directed connections showing the possible routs the |
| 91 |
|
program (or actually the flow of data in the program) may |
| 92 |
|
take. This could be broken down to several diagrams if it |
| 93 |
|
gets to large and complex. This diagram can be used to |
| 94 |
|
decide how many test cases is needed to test the program |
| 95 |
|
completely. |
| 96 |
|
|
| 97 |
|
The data flow structure could be shown in a module-call |
| 98 |
|
graph. The module-call graph shows what modules calls what |
| 99 |
|
other modules, and thereby showing more the flow of |
| 100 |
|
information within the program. This may also be used to |
| 101 |
|
show coupling and cohesion in the program. |
| 102 |
|
|
| 103 |
|
The data structure can be measured both locally and |
| 104 |
|
globally. Locally it is interesting how much data |
| 105 |
|
structure each data item has, and globally it is the |
| 106 |
|
amount of data for the system. For the local data |
| 107 |
|
structures very little research has been done, but for the |
| 108 |
|
global there are more. |
| 109 |
\subsection{Draw the flow graph for the program, which |
\subsection{Draw the flow graph for the program, which |
| 110 |
based on the data provided by everyday measurements of the air |
based on the data provided by everyday measurements of the air |
| 111 |
temperature will calculate the maximum, minimum and the most |
temperature will calculate the maximum, minimum and the most |
Parent Directory
| 
Revision Log
| 
Patch