Dale - Computer Science Illuminated 182

Dale - Computer Science Illuminated 182 - 6.2 Top-Down...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
6.2 Top-Down Design 155 To summarize, the main module specifies the names of tasks. Each name of a task needs to be expanded at a lower level unless the task is completely specified. This is true of each level. There are as many modules at level 1 as there are names of tasks at level 0 that are not completely specified, and so on for each successive level. A Computer Example Let’s leave the social analogy now and look at the process applied to a problem whose solution can be implemented in a computer. We can use English sentences or pseudocode to express our algorithms. The algorithm format that we have used is an example of pseudocode. As we go along we introduce certain English words that have special meaning in our pseudocode. For example, we used the words While and Repeat to express that certain statements were to be repeated. We use the word If to indicate that we are asking a question and only one of two statements or groups of statements will be used. We said previously that the computer could be used to help with an
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/13/2011 for the course CSE 1550 taught by Professor Marianakant during the Fall '10 term at York University.

Ask a homework question - tutors are online