Ch. 1: Software Development
(Read)
5 Phases of Software Life Cycle:
•
•
•
•
•
Problem Analysis and Specification
Design
Implementation (Coding)
Testing, Execution and Debugging
Maintenance
Lab 1
1
Problem Analysis and Specification
Easy in CS courses, not always in the real world.
CPSC 185 - Assignment 4
Due : Wednesday, March 11
The sum-of-the-years digits method of calculating depreciation is illustrated below.
$15,000 is to be depreciated over five years.
First calculate the “sum-of-the-years digits,” 1 + 2 + 3 + 4 + 5 = 15.
Then depreciate 5/15 of $15,000 ($5,000) over the first year,
4/15 of $15,000 ($4,000) over the second year,
3/15 ($3,000) the third year, and so on.
Write a program that reads the amount to be depreciated and the number of years over which it is to be
depreciated. Then for each year from 1 through the specified number of years, print the year number and the
amount of depreciation for that year under appropriate headings. Execute the program with the following
data: $15,000 for 3 years; $7,000 for 10 years; $500 for 20 years; $100 for 1year.
Computer Science programming assignment -
specific statement of problem
quantitative description
clearly defined requirements:
input, output, calculations, test data
2
Problem Analysis and Specification
To:
Bob Byte, Director of Computer Center
From: Chuck Cash, V.P. of Scholarships
and Financial Aid
Date: Wednesday, March 11
Because of new government regulations,we must keep more accurate records of
all students currently receiving financial aid and submit regular reports to FFAO
(Federal Financial Aid Office). Could we get the computer to do this for us?
CC
“Real World” request general statement of problem
qualitative not quantitative
P. 3
precision missing for
input, output, processing
3
Statement of specifications
 the formal statement of the problem’s requirements
 the major reference document
 a benchmark used to evaluate the final system
The program should display on the screen a prompt for an amount to be depreciated and the
number of years over which it is to be depreciated. If should then read these two values
from the keyboard. Once it has the amount and the number of years, it should compute the
sum of the integers 1, 2, . . . up to the number of years. It should then display on the screen
a table with appropriate headings that shows the year number and the number and the
depreciation for that year, for the specified number of years.
Sometimes stated precisely using a formal method.
4
Design
• CS courses
– small systems
• few hundred lines of code
• simple, straightforward
• self-contained
• “Real” world
– large systems
• thousands of lines of code
• complex
• many components
5
P. 4
OCD: Object-Centered Design
(OOD: Object-Oriented Design)
• 1. Identify the objects in the problem's specification and
their types.
• 2. Identify the operations needed to solve the problem.
• 3. Arrange the operations in a sequence of steps, called an
algorithm, which, when applied to the objects, will solve
the problem.
6
Data Types
P. 5
• Simple
• Structured — data structures
— containers
Algorithm
• May be written in pseudocode
• Characteristics of steps (instructions), see pg 9:
– Definite and unambiguous
– Simple
– Finite
• Difference between correctness and efficiency, see pp 7-8
– O(n) — grows linearly with size (n) of the input
– O(1) — is constant , i.e. independent of size of input
• Should be well-structured
Can't separate data structures and algorithms
Algorithms + Data Structures = Programs
7
Compare with
unstructured version
Algorithm (Structured Version)
/* Algorithm to read and count several triples of distinct
numbers and print the largest number in each triple. */
1. Initialize count to 0.
2. Read the first triple of numbers x, y, z.
3. While x is not the end-of-data-flag do the following:
a. Increment count by 1.
b. If x > y and x > z then display x.
Else if y > x and y > z then display y
Else display z.
c. Read the next triple x, y, z.
4. Display count.
8
Implementation (Coding)
• Select language of implementation
• Encode the design
• Verify integration
– combining program units into a complete software system.
• Insure quality
– programs must be correct, readable, and understandable
– well-structured, documented, stylistic (see guidelines on
pp. 15-18)
Why? See p. 15
9
Testing, Execution, and Debugging
– Validation: "Are we building the right product?"
• check that documents, program modules, etc. match
the customer's requirements.
– Verification: : "Are we building the product right?"
• check that products are correct, complete, consistent
with each other and with those of the preceding
phases.
10
Errors may occur in any of the phases
– Specifications don't accurately reflect given
information or the user's needs/requests
– Logic errors in algorithms
– Incorrect coding or integration
– Failure to handle boundary data or test values
11
Different kinds of tests required
– Unit tests:
• Each individual program unit works?
– Program components tested in isolation
– Integration tests :
• Units combined correctly?
– Component interface and information flow tested
– System tests:
• Overall system works correctly?
12
The "V" Life Cycle Model
Dorothy (Dot) Hoekema Graham -- Grove Consultants (www.grove.co.uk)
13
Unit testing
– probably the most rigorous and time-intensive
– surely the most fundamental and important
– kinds of errors tested:
•
•
•
•
syntax
linking
run-time
logic
14
Black box or functional test
• Outputs produced for various inputs
are checked for correctness without
considering the structure of the
program component itself.
• Program unit is viewed as a black box that
accepts inputs and produces outputs, but the
inner workings of the box are not visible.
15
White box or structural test
• Performance is tested by examining
code’s internal structure.
• Test data is carefully selected
so that specific parts of the program unit
are exercised.
16
Example: Binary search (pp. 19-23)
/* INCORRECT IMPLEMENTATION OF FUNCTION
BinarySearch() performs a binary search of array a for item.
Receive:
item, array a of n items, sorted in ascending order
Pass back: found (true if search successful) and
mid ( the position of item in a)
---------------------------------------------------*/
void BinarySearch(NumberArray a, int n, ElementType item,
bool & found, int & mid)
{
int first = 0,
// first and last positions in sublist
last = n - 1; // currently being searched *)
found = false;
while (first <= last && !found)
{
mid = (first + last ) / 2;
if (item < a[mid])
last = mid;
else if (item > a[mid])
first = mid;
else
found = true
}
}
17
Black box test
Use n = 7 and sample array a of integers
a[0]=45 a[1]=64 a[2]=68 a[3]=77 a[4]=84 a[5]=90 a[6]=96
Test with item = 77
returns found = true, mid = 3
Test with item = 90
returns found = true, mid = 5
Test with item = 64
returns found = true, mid = 1
Test with item = 76
returns found = false
Hey, it seems to work ok! Are we done yet?
18
Boundary Testing
Must consider special cases:
Boundary values -- at bounds of data structures
(not tested above)
item = 45: found = true and mid = 0
OK
item = 96: doesn’t terminate; must “break” program.
ERROR!!
Non-member values
Fails – infinite loop
19
Techniques to locate error
Debugger (GNU gdb -- Lab 1C)
Debug statements (p. 21)
cerr << "DEBUG: At top of while loop in BinarySearch()\n"
<< "first = " << first << ", last = " << last
<< ", mid = " << mid << endl;
Output:
DEBUG:
first =
DEBUG:
first =
DEBUG:
first =
DEBUG:
first =
DEBUG:
first =
DEBUG:
first =
At
0,
At
3,
At
4,
At
5,
At
5,
At
5,
top of
last =
top of
last =
top of
last =
top of
last =
top of
last =
top of
last =
while loop
6, mid = 3
while loop
6, mid = 4
while loop
6, mid = 5
while loop
6, mid = 5
while loop
6, mid = 5
while loop
6, mid = 5
. . .
Trace Tables (Lab 1A) — See p. 22
in BinarySearch()
in BinarySearch()
in BinarySearch()
in BinarySearch()
in BinarySearch()
in BinarySearch()
20
White-box test
Use knowledge of control flow of program to devise test data.
Exercise the different paths of execution to find errors.
e.g., Use item < 45 to test a path in which the first
condition item < a[mid] is always true so first alternative
last = mid; is always selected.
OK!
Use item > 96 to test a path in which the second condition
item > a[mid] is always true so second alternative
first = mid; is always selected.
ERROR! Infinite loop
21
Maintenance
– Large % of computer center budgets
– Large % of programmer's time
– Largest % of software development cost
• Why?
– Includes modifications and enhancements
– Poor structure, poor documentation, poor style
• less likely to catch bugs before release
• make fixing of bugs difficult and time-consuming
• impede implementation of enhancements
22
Algorithm (Unstructured Version)
/* Algorithm to read and count several triples of distinct
numbers and print the largest number in each triple. */
1. Initialize count to 0
2. Read a triple x, y, z.
3. If x is the end-of-data flag then go to step 14.
4. Increment count by 1.
5. If x > y then go to step 9.
6. If y > z then go to step 12.
7. Display z.
8. Go to step 2.
9. If x < z then go to step 7.
10. Display x.
11. Go to step 2.
12. Display y.
13. Go to step 2.
14. Display count.
Note the spaghetti logic!
23