Creating computer programs, program design through flow-charts and algorithms, the compilation process

Notes for the required material 

• You can find a text-only versions of the notes (no text-formatting or graphics) under the Unix directory: /home/231/notes/programming_process_design
• The process of creating computer programs (Lestma & Nyhoff Chapter 2): [PowerPoint] [pdf]
• Designing programs with flowcharts and pseudo-code: [PowerPoint] [pdf]
• Creating computer programs: [PowerPoint] [pdf]

Optional teaching material

It would be useful to spend time covering examples illustrating how the software design process occurs in an iterative fashion.  This can be done by taking example algorithms that have flaws or weaknesses (such as the ATM example in the flowchart and pseudo-code notes).  There are excellent examples of how this can be done in the notes for the previous year's versions of this course, which can be found under the url:

Background / Sources of additional information

• Computer Science Illuminated by Dale N. and Lewis J (Jones and Bartlett Computer Science).
• Previous year's course notes from CPSC 231 (Fall/Winter 2001 - 2002) by Becker K.  Look under the links for notes/the algorithmic model for an alternative approach to the design process for programs.

Teaching Tips