Past questions › fam-q8
2025 3 marks Pseudocode The Software Engineering Project (Year 12) Algorithm design (linear search)
NESA 2025 HSC Software Engineering Familiarisation Questions - Marking Guidelines (official, 12 June 2025)
[Question stem not available as text (it is on the interactive NESA familiarisation site). Task per the NESA mapping grid: modify a search algorithm so it achieves its intended purpose (find SearchItem in ItemArray and display its position, otherwise 'Not found')]
Marking criteria
3: Correctly modifies the algorithm to achieve its intended purpose. 2: Corrects some mistakes. 1: Some understanding of the problem.
Sample answer
BEGIN Search (SearchItem) Set LastIndex to the number of elements in ItemArray Found = FALSE Index = 1 WHILE Found = FALSE AND Index < LastIndex + 1 IF ItemArray(Index) = SearchItem THEN Found = TRUE ENDIF Index = Index + 1 ENDWHILE IF Found = TRUE THEN Display 'Position', Index - 1 ELSE Display 'Not found' ENDIF END Search