01// STAGE 102Num1 ← 1203Index ← 104FOR i ← 2 TO Num1 DIV 205   IF Num1 MOD i = 0 THEN06      Data[Index] ← i07      Index ← Index + 108   ENDIF09NEXT i10Index ← Index - 111OUTPUT Index, " values were found"

Complete the trace table for STAGE 1

Num1	Index	i	Data[1]	Data[2]	Data[3]	Data[4]
Table answer r1_Num1	Table answer r1_Index	Table answer r1_i	Table answer r1_Data[1]
	Table answer r2_Index	Table answer r2_i		Table answer r2_Data[2]
	Table answer r3_Index	Table answer r3_i			Table answer r3_Data[3]
	Table answer r4_Index	Table answer r4_i
	Table answer r5_Index	Table answer r5_i				Table answer r5_Data[4]
	Table answer r6_Index

7(a)(ii)Algorithms Pseudocode FlowchartsEasy1 mark

State how the numbers in the Data array are related.

7(b)(i)Algorithms Pseudocode FlowchartsMedium3 marks

The complete algorithm has a second stage.

pseudocode

01// STAGE 202Num2 ← 803Match ← FALSE0405REPEAT06   IF Num2 MOD Data[Index] = 0 THEN07      Match ← TRUE08   ELSE09      Index ← Index - 110   ENDIF11UNTIL Match = TRUE OR Index = 01213IF Match = TRUE THEN14   OUTPUT Data[Index]15ELSE16   OUTPUT "Nothing found"17ENDIF

One line of the STAGE 1 code is changed:

pseudocode

01Num1 ← 20

The programmer creates a final program with the STAGE 1 code followed immediately by the STAGE 2 code. The STAGE 1 trace table shows the relevant final variable values after the completion of STAGE 1:

Num1	Index	Data[1]	Data[2]	Data[3]	Data[4]
20	4	2	4	5	10

This is followed by running of the STAGE 2 code. Complete the trace table for STAGE 2

Num1	Num2	Index	Match	Data[1]	Data[2]	Data[3]	Data[4]
20	Table answer r1_Num2	4	Table answer r1_Match	2	4	5	10
		Table answer r2_Index	Table answer r2_Match
		Table answer r3_Index	Table answer r3_Match

7(b)(ii)Algorithms Pseudocode FlowchartsEasy1 mark

State the purpose of the STAGE 2 algorithm.