| Preface |
|
ix | |
|
|
|
|
Steps in program development |
|
|
2 | (2) |
|
|
|
4 | (1) |
|
An introduction to algorithms and pseudocode |
|
|
5 | (1) |
|
|
|
6 | (1) |
|
|
|
7 | (3) |
|
|
|
|
|
|
10 | (3) |
|
|
|
13 | (2) |
|
|
|
15 | (2) |
|
|
|
|
|
|
17 | (4) |
|
Designing a solution algorithm |
|
|
21 | (2) |
|
Checking the solution algorithm |
|
|
23 | (7) |
|
|
|
30 | (1) |
|
|
|
30 | (3) |
|
Selection control structures |
|
|
|
The selection control structure |
|
|
33 | (4) |
|
Algorithms using selection |
|
|
37 | (7) |
|
|
|
44 | (3) |
|
|
|
47 | (1) |
|
|
|
47 | (4) |
|
Repetition control structures |
|
|
|
Repetition using the Dowhile structure |
|
|
51 | (8) |
|
Repetition using the Repeat...Until structure |
|
|
59 | (4) |
|
Counted repetition constructs |
|
|
63 | (3) |
|
|
|
66 | (1) |
|
|
|
66 | (3) |
|
Pseudocode algorithms using sequence, selection and repetition |
|
|
|
Eight solution algorithms |
|
|
69 | (11) |
|
|
|
80 | (1) |
|
|
|
80 | (4) |
|
|
|
|
|
|
84 | (3) |
|
Initialising the elements of an array |
|
|
87 | (2) |
|
|
|
89 | (2) |
|
Writing out the contents of an array |
|
|
91 | (1) |
|
Programming examples using arrays |
|
|
92 | (4) |
|
|
|
96 | (3) |
|
|
|
99 | (1) |
|
|
|
99 | (5) |
|
First steps in modularisation |
|
|
|
|
|
104 | (3) |
|
Hierarchy charts or structure charts |
|
|
107 | (1) |
|
Communication between modules |
|
|
108 | (2) |
|
Using parameters in program design |
|
|
110 | (2) |
|
|
|
112 | (1) |
|
Programming examples using modules |
|
|
113 | (9) |
|
|
|
122 | (1) |
|
|
|
123 | (4) |
|
Further modularisation, cohesion and coupling |
|
|
|
|
|
127 | (6) |
|
|
|
133 | (5) |
|
|
|
138 | (5) |
|
|
|
143 | (1) |
|
|
|
143 | (7) |
|
General algorithms for common business problems |
|
|
|
|
|
150 | (1) |
|
Report generation with page break |
|
|
151 | (2) |
|
Single-level control break |
|
|
153 | (3) |
|
Multiple-level control break |
|
|
156 | (4) |
|
|
|
160 | (7) |
|
|
|
167 | (1) |
|
|
|
167 | (8) |
|
|
|
|
Introduction to object-oriented design |
|
|
175 | (3) |
|
Steps in creating an object-oriented solution |
|
|
178 | (6) |
|
Programming example using object-oriented design |
|
|
184 | (3) |
|
Interface and GUI objects |
|
|
187 | (2) |
|
|
|
189 | (1) |
|
|
|
190 | (3) |
|
More object-oriented design |
|
|
|
Object-oriented design with multiple classes |
|
|
193 | (2) |
|
Programming example with multiple classes |
|
|
195 | (14) |
|
|
|
209 | (1) |
|
|
|
209 | (3) |
|
|
|
|
|
|
212 | (1) |
|
|
|
213 | (2) |
| Appendix 1 Flowcharts |
|
|
The three basic control structures |
|
|
215 | (4) |
|
Simple algorithms that use the sequence control structure |
|
|
219 | (4) |
|
Flowcharts and the selection control structure |
|
|
223 | (2) |
|
Simple algorithms which use the selection control structure |
|
|
225 | (6) |
|
The case structure expressed as a flowchart |
|
|
231 | (2) |
|
Flowcharts and the repetition control structure |
|
|
233 | (1) |
|
Simple algorithms which use the repetition control structure |
|
|
234 | (8) |
|
|
|
242 | (3) |
| Appendix 2 Nassi-Schneiderman diagrams |
|
|
The three basic control structures |
|
|
245 | (2) |
|
Simple algorithms that use the sequence control structure |
|
|
247 | (2) |
|
N-S diagrams and the selection control structure |
|
|
249 | (2) |
|
Simple algorithms which use the selection control structure |
|
|
251 | (4) |
|
The case structure, expressed as a N-S diagram |
|
|
255 | (2) |
|
N-S diagrams and the repetition control structure |
|
|
257 | (1) |
|
Simple algorithms which use the repetition control structure |
|
|
257 | (7) |
| Appendix 3 Special algorithms |
|
|
|
|
264 | (2) |
|
|
|
266 | (5) |
| Glossary |
|
271 | (6) |
| Index |
|
277 | |