Representing algorithms

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48

Question 27

Easy

A student is writing an algorithm for a grid-based treasure hunt game. The algorithm searches a 4x4 grid to find the coordinates of the target cell containing the "Treasure".

Figure 1: Code Algorithm

row_found = -1
col_found = -1
for r = 0 to 3
    for c = 0 to 3
        if getCell(r, c) == "Treasure" then
            row_found = r
            col_found = c
        endif
    next c
next r

Figure 2: The Grid State

	Column 0	Column 1	Column 2	Column 3
Row 0	Safe	Safe	Safe	Safe
Row 1	Safe	Safe	Treasure	Safe
Row 2	Safe	Safe	Safe	Safe
Row 3	Safe	Safe	Safe	Safe

Explain the purpose of the inner iteration structure (the loop using the variable c) in the algorithm in Figure 1.

[1]

Representing algorithms

Question 27

Figure 1: Code Algorithm

Figure 2: The Grid State

Representing algorithms Questions

Representing algorithms

Question 27

Figure 1: Code Algorithm

Figure 2: The Grid State

Representing algorithms Questions