Sigma Learn

8(a)Searching AlgorithmsHard4 marks

Global array MyData contains the values shown.

MyData

Index	Value
1	2
2	8
3	9
4	12
5	13
6	15
7	18
8	19
9	20
10	23
11	25
12	26
13	39
14	38
15	40

Study the pseudocode algorithm and array MyData

pseudocode

01FUNCTION MyTrace(Target : INTEGER) RETURNS INTEGER02   DECLARE LeftPointer, RightPointer, MidPointer : INTEGER03   LeftPointer ← 104   RightPointer ← 1505   WHILE LeftPointer <= RightPointer06      MidPointer ← (LeftPointer + RightPointer) DIV 207      IF MyData[MidPointer] = Target THEN08         OUTPUT "Found " & NUM_TO_STR(MidPointer)09         RETURN MidPointer10      ELSE11         IF Target > MyData[MidPointer] THEN12            LeftPointer ← MidPointer + 113         ELSE14            RightPointer ← MidPointer - 115         ENDIF16      ENDIF17   ENDWHILE18   OUTPUT "Not found"19   RETURN -120ENDFUNCTION

Complete the trace table for the function MyTrace when the following pseudocode statement is executed.

pseudocode

01Result ← MyTrace(15)

LeftPointer	RightPointer	MidPointer
Table answer row1_LeftPointer	Table answer row1_RightPointer	Table answer row1_MidPointer
Table answer row2_LeftPointer	Table answer row2_RightPointer	Table answer row2_MidPointer
Table answer row3_LeftPointer	Table answer row3_RightPointer	Table answer row3_MidPointer
Table answer row4_LeftPointer	Table answer row4_RightPointer	Table answer row4_MidPointer
Table answer row5_LeftPointer	Table answer row5_RightPointer	Table answer row5_MidPointer
Table answer row6_LeftPointer	Table answer row6_RightPointer	Table answer row6_MidPointer
Table answer row7_LeftPointer	Table answer row7_RightPointer	Table answer row7_MidPointer

8(b)Searching AlgorithmsEasy1 mark

Give the output.

Answer

8(c)Searching AlgorithmsEasy1 mark

Give the value assigned to Result

Answer

May/June 2026 Paper 21

Questions