Structured Programming

What are the three basic building blocks of a structured program?
1. Sequences, Operators, and Operands.
2. Sequences, Selectctions, Repetitions.
3. while(), for(), and do/while() loops.
4. Functions, Statements, Variables.
A diamond-shoped simple on a flow chart represents what?
1. A decision point.
2. An input/output operation.
3. A key point in the algorithm.
4. An entry/exit point.
How many exit points does a structured program or program component have?
1. None.
2. Exactly one.
3. Two - one for a normal exit and one for an abnormal exit.
4. How ever many necessary to handle all of the exit conditions.
Which of the following is NOT true of arrows on a flowchart.
1. Program flow always proceeds from the tail of an arrow to the head of an arrow.
2. They may converge if multiple paths lead to the same element.
3. They may diverge if multiple paths can be followed from an element.
4. A task block is attached to exactly one arrow head and one arrow tail.
A program element characterized by a set of tasks that are performed in the same order every time that program element is executed describes what?
1. A sequence.
2. A selection.
3. A repetition.
4. A block.
A program element characterized by a set of tasks that may be performed multiple times under the control of some test condition describes what?
1. A sequence.
2. A selection.
3. A repetition.
4. A block.
A program element characterized by a set of tasks which may or may not be executed under the control of some test condition describes what?
1. A sequence.
2. A selection.
3. A repetition.
4. A block.
Which of the following statements is true?
1. The use of repetitions structures in a program is seldom used in practice - selections structures are far more useful.
2. A repetition structure is really just a special case of a selection structure.
3. A decision point on a flow chart must be labeled to indicate whether it is for a selection structure or a repetition structure.
4. Structured programming reflects the way instructions are carried out on an actual processor.
How many arrow tails can leave a decision point?
1. Exactly one (one entry, one exit rule)
2. One or two.
3. Exactly two.
4. As many as necessary, but the conditions under which each is followed must be a clear consequence of the test condition used.
Flow charts often have many exit circles on them. Why doesn't this violate the one entry, one exit rule?
1. If the flow chart is for a lower level in the program structure it is not subject to the one exit rule.
2. If the flow chart is for a top level block, then the program never actually exits and so the number of exit circles is irrelevant.
3. Conceptually they are all the same exit point because the next instruction to get executed will be the same regardless of which exit circle caused the exit.
4. It does violate it - such a flow chart does not represent a structured program.