Chapter 5

Question 1

algorithm

Answer 1

An algorithm is an ordered set of unambiguous, executable steps that defines a terminating process.

Question 2

Primitives

Answer 2

a well-defined set of building blocks from which algorithm representations can be constructed

Question 3

Programming language

Answer 3

a collection of primitives along with a collection of rules stating how the primitives can be combined

Question 4

Pseudo code

Answer 4

a notational system in which algorithms can be expressed (less formal than real programming language code)

Question 5

Loop control

Answer 5

• Initialize – establish an initial state.
• Test – continue only if the current state fulfils the loop condition.
• Modify – change the state towards a termination state.

Question 6

Recursion

Answer 6

• The execution of a procedure leads to another execution of the procedure.
• Multiple activations of the procedure are formed, all but one of which are waiting for other activations to complete.