Reading...
Play button
Play button
Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
12 Cards in this Set
- Front
- Back
|
reliability |
the probability of software operating without failure under given conditions for a given time interval T |
|
|
availability |
the probability of software operating without failure at agiven moment in time |
|
|
Maintainability: |
the probability of successful software maintenance operation being performed within astated interval of time. |
|
|
program length (HALSTEAD’S COMPLEXITY) |
N = N1+ N2
|
|
|
Program vocabulary: (HALSTEAD’S COMPLEXITY)
|
n = n1+ n2
|
|
|
volume (HALSTEAD’S COMPLEXITY) |
V = N log2n
|
|
|
difficulty (HALSTEAD’S COMPLEXITY) |
D = (n1/2) * (N2/n2)
|
|
|
(HALSTEAD’S COMPLEXITY) Effort: |
E = V * D |
|
|
(HALSTEAD’S COMPLEXITY) Time to understand:
|
T = E /18 (seconds)
|
|
|
(HALSTEAD’S COMPLEXITY) Bugs Delivered:
|
E^(2/3)/ 3000
|
|
|
6 Types of performance testing
|
Stress Testing:
•Volume Testing: •Security Testing: •Timing Testing: •Precision Testing: •Recovery Testing: |
|
|
Belady and Lehman model
|
M= p+ Ke^(c-d)
M : total maintenance effort (person-month) p: productive effort caused by analysis, evolution, design, coding, and testing c: complexity caused by lack of structure d: degree of familiarity of the maintenance team with the system K: empirical constant: different for different environments |
