TK Study

Software Engineering › Key terms › Y11 Programming Fundamentals › Binary search

Binary search

Term Check Y11 Programming Fundamentals

Definition

A search on a SORTED list that checks the middle item and discards half the list each time (a divide and conquer method).

Example: Binary search needs sorted data; each step halves the search space.

Check this one: Not named in the syllabus; it appears in past SDD questions.

Found in: past SDD papers.

Where it is used in the test

Syllabus area: Y11 Programming Fundamentals.

Question types it can appear in

Where it has appeared in the paper

The Software Engineering Project (Part D). 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

“A search on a SORTED list that checks the middle item and discards half the list each time (a divide and conquer method).” Then apply it: Binary search needs sorted data; each step halves the search space.

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.

Command words used with it

General advice

No linked question shows the command word for this term. Across the past pseudocode and short answer questions in this bank the words used most are: Explain, Outline, Describe, Compare, Classify, Analyse. Check the actual word in your question.

Technique for the question types

What the marking guidelines and feedback say

2021 Software Design and Development HSC Q28 (5 marks): Debugging an algorithm (binary search)

Old-syllabus question. Use for practice on the overlapping skill only. The new Software Engineering exam does not use the old SDD terms (e.g. CASE tools, system flowcharts, EBNF, assembly).

Common mistakes

Marker feedback on other questions of the same type (code and diagram feedback often applies across questions)
  • Check the sources: Not named in the syllabus; it appears in past SDD 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.
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: Computational thinking · Algorithm · Sequence · Selection · Iteration (repetition) · Divide and conquer · Backtracking · Top-down design · Bottom-up design · Abstraction · Refinement · Pseudocode · Flowchart · Subroutine (module, subprogram, procedure)

← Binary (base 2)In Y11 Programming FundamentalsBoolean →