Preface 1 Program Design 1.1 Steps in program development 1.2 Structured programming 1.3 An introduction to algorithms and pseudocode 1.4 Program data 1.5 Chapter summary 2 Pseudocode 2.1 How to write pseudocode 2.2 The Structure Theorem 2.3 Chapter summary 3 Developing an algorithm 3.1 Defining the problem 3.2 Designing a solution algorithm 3.3 Checking the solution algorithm 3.4 Chapter summary 3.5 Programming problems 4 Selection control structures 4.1 The selection control structure 4.2 Algorithms using selection 4.3 The case structure 4.4 Chapter summary 4.5 Programming problems 5 Repetition control structure 5.1 Repetition using DOWHILE structure 5.2 Repetition using the REPEAT…UNTIL structure 5.3 Counted summary 5.4 Chapter summary 5.5 Programming problems 6 Pseudocode algorithms using sequence, selection and repetition 6.1 Eight solution algorithms 6.2 Chapter summary 6.3 Programming problems 7 Array processing 7.1 Array processing 7.2 Initializing the elements of an array 7.3 searching an array 7.4 Writing out the contents of an array 7.5 Programming examples using arrays 7.6 Two-dimension array 7.7 Chapter summary 7.8 Programming problems 8 First steps in modularization 8.1 Modularization 8.2 Hierarchy charts or structure charts 8.3 Communication between modules 8.4 Using parameters in program design 8.5 Steps in modularization 8.6 Programming examples using modules 8.7 Chapter summary 8.8 Programming problems 9 Further modularization, cohesion and coupling 9.1 Steps in modularization 9.2 Module cohesion 9.3 Module coupling 9.4 Chapter summary 9.5 Programming problems 10 General algorithms for common business problems 10.1 Program structure 10.2 Report generation with page break 10.3 Single-level control break 10.4 Multiple-level control break 10.5 Sequential file update 10.6 Chapter summary 10.7 Programming problems 11 Object-oriented design 11.1 Introduction to object-oriented design 11.2 Steps in creating an object-oriented solution 11.3 Programming example using object-oriented design 11.4 Interface and GUI objects 11.5 Chapter summary 12 More object-oriented design 12.1 Object-oriented design with multiple classes 12.2 Programming example with multiple classed 12.3 Chapter summary 12.4 Programming problems 13 Conclusion 13.1 Simple program design 13.2 Chapter summary Appendix 1 Flowcharts The three basic control structures Simple algorithms that use the sequence control structure Flowcharts and the selection control structure Simple algorithms which use the selection control structure The case structure expressed as a flowchart Flowcharts and the repetition control structure Simple algorithms which use the repetition control structure Flowcharts and modules Appendix 2 Nassi–Schneiderman diagrams The three basic control structures Simple algorithms that use the sequence control structure N-S diagrams and the selection control structure Simple algorithms which use the selection control structure The case structure , expressed as a N-S diagram N-S diagrams and the repetition control structure Simple algorithms which use the repetition control structure Appendix 3 Special algorithms Sorting algorithms Dynamic data structure Glossary Index
鄂公網(wǎng)安備 42010302001612號(hào) 