TK Study
HomeLearn step by stepMemoriseKey termsFlashcardsNotesMaster answersPast questionsMultiple choiceMock examPractice & marker

Software Engineering › Key terms › Code patterns › Linear search pattern

Linear search pattern

Code pattern Code patterns

Definition

Check each item in order until found or the end is reached; set a Found flag, loop through and stop on a match.

Example

found = False; for i in list: if i == target: found = True

Found in: past SDD papers.

Where it is used in the test

Syllabus area: Code patterns.

Question types it can appear in

Where it has appeared in the paper

The Software Engineering Project (Part C). Part letters follow each paper’s own layout.

Related past questions

These are the questions the flashcard set links to this term. Open each one and compare your answer with its marking criteria.

Study links

How to use it in an answer

A model sentence

General advice, built from the definition and example above

Code pattern: “Check each item in order until found or the end is reached; set a Found flag, loop through and stop on a match.” Then apply it: found = False; for i in list: if i == target: found = True

In a short answer, give the definition in your own words first, then tie it to the situation in the question. Do not copy the example above unless it fits the scenario.

Technique for the question types

What the marking guidelines and feedback say

Familiarisation Q8 (3 marks): Algorithm design (linear search)

The original (buggy) algorithm is not available. Note the 'Index - 1' because Index is incremented after the item is found.

Worked answers from the marking guidelines

Familiarisation Q8 (3 marks): Algorithm design (linear search) (3 marks): criteria and sample answer

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

Open the question page

Common mistakes

Marker feedback on other questions of the same type (code and diagram feedback often applies across questions)
  • Pseudocode questions (2025 HSC exam Q17): use pseudocode control structures accurately; iterate an array and sum it; apply relational operators correctly; use the stimulus to choose the right structures.
  • Python questions (2025 HSC exam Q19): process string inputs; use a selection structure; code must execute in the environment; use correct indentation; call functions in the main program after defining them.
  • Python questions (2025 HSC exam Q26): replicate the grid; use the random library; use selection and looping to access the list; include a method of checking the number of values; use meaningful variable names and constants; avoid overly complex structures such as nested IF loops.
General advice
  • Use the term exactly as the syllabus words it, then link it to the scenario in the question; the 2025 feedback repeatedly rewards using the stimulus.
  • Answer the command word: outline gives main points only, explain gives a reason or cause, discuss gives both sides.

Same group in the syllabus: Pseudocode keywords · Sequence · Binary selection (IF THEN ELSE) · Multi-way selection (CASEWHERE) · Nested IF · WHILE loop (pre-test) · REPEAT UNTIL loop (post-test) · FOR / NEXT loop (counted) · Subroutine and function (pseudocode) · Array sum pattern

A to Z
← Global and local variablesIn Code patternsMulti-way selection (CASEWHERE) →