The case structure expressed as a flowchartįlowcharts and the repetition control structure Simple algorithms that use the selection control structure Simple algorithms that use the sequence control structureįlowcharts and the selection control structure Algorithms that use a combination of sequence, selection and repetition are developed in some detail. Introduces flowcharts for those students who prefer a more graphic approach to program design.
Discusses the relationship between classes, including aggregation, composition and generalisation, and lists the steps required to create an object-oriented design to a problem with multiple classes.ġ2.1 Object-oriented design with multiple classesġ2.2 Programming example with multiple classesĪ revision of the steps involved in good top-down program design. Introduces the concept of multiple classes, relationships between classes and polymorphism in object-oriented design. The steps required to create an object-oriented solution to a problem are provided and solution algorithms developed.ġ1.1 Introduction to object-oriented designġ1.2 Steps in creating an object-oriented solutionġ1.3 Programming example using object-oriented designġ2 Simple object-oriented design for multiple classes Introduces object-oriented design, classes and objects, attributes, responsibilities, operations, accessors and mutators, and information hiding.
#Simple program design a step by step approach update
The topics covered include report generation with page break, a single-level control break, a multiple-level control break and a sequential file update program. All problems are defined a hierarchy chart is established and a pseudocode algorithm is developed, using a mainline and several subordinate modules. Module cohesion and coupling are introduced, several levels of cohesion and coupling are described, and pseudocode examples of each level are provided.ġ0 General algorithms for common business problemsĭevelops a general pseudocode algorithm for four common business applications. Hierarchy charts and parameter passing are introduced, and several algorithms that use a modular structure are developed.ĩ Further modularisation, cohesion and couplingĭevelops modularisation further, using a more complex problem. Introduces modularisation as a means of dividing a problem into subtasks. Algorithms for single and two-dimensional arrays, which initialise the elements of an array, search an array and write out the contents of an array, are presented.ħ.2 Initialising the elements of an array Introduces arrays, operations on arrays, and algorithms that manipulate arrays. Each problem is properly defined the control structures required are established a pseudocoele algorithm is developed and the solution is manually checked for logic errors. UNTIL, and counted repetition loops.ĥ.1 Repetition using the DOWHILE structureĥ.2 Repetition using the REPEAT.UNTIL structureĦ Pseudocoele algorithms using sequence, selection and repetitionĭevelops algorithms to solve eight simple programming problems using combinations of sequence, selection and repetition constructs. Several algorithms, using variations of the select/on control structure, are developed.ĭevelops algorithms that use the repetition control structure in the form of DOWHILE, REPEAT. Simple algorithms that use the sequence control structure are developed, and methods of manually checking the algorithm are determined.Įxpands the selection control structure by introducing multiple selection, nested selection and the case construct in pseudocoele. Introduces methods of analysing a problem and developing a solution. Pseudocode is used to represent each control structure. The Structure Theorem is introduced, and the three basic control structures are established. Introduces common words, keywords and meaningful names when writing pseudocoele. Describes the steps in the program development process, and introduces current program design methodologies, procedural and object-oriented programming, algorithms, pseudocoele and program data.ġ.3 Procedural versus object-oriented programmingġ.4 An introduction to algorithms and pseudocoele