Appendix 3 Pseudocode:

Question 1

Pseudocode:

Answer 1

Pseudocode is
an intermediate step between an English language description of the steps of a procedure
and a specification of this procedure using an actual programming language. T

Question 2

Procedure Statements:

Answer 2

The pseudocode for an algorithm begins with a procedure statement that gives the name of
an algorithm, lists the input variables, and describes what kind of variable each input is.

procedure maximum(L: list of integers)

Question 3

Assignment:

and other types of statements:

Answer 3

variable := expression

interchange a and b

Question 4

Comments:

Answer 4

In the pseudocode in this book, statements enclosed in curly braces are not executed. Such
statements serve as comments or reminders that help explain how the procedure works.

{x is the largest element in L}

Question 5

Loop Constructions: for:

Answer 5

for variable := initial value to final value
block of statements

OR

for all elements with a certain property

Question 6

While:

Answer 6

while condition

block of statements

Question 7

Conditional Constructions

Answer 7

if condition 1 then statement 1
else if condition 2 then statement 2
else if condition 3 then statement 3
⋅
⋅
⋅
else if condition n then statement n
else statement n + 1

Question 8

Loops within loops:

Answer 8

Indentation