Software Engineering › Learn step by step › Y11 Programming Fundamentals
Item 78 of 426 · Year 11: Programming Fundamentals, 32 of 69
Linear search
Term Check
Jump to a topic
- Exam format, question types and command words (46)
- Year 11: Programming Fundamentals (69)
- Year 11: The Object-Oriented Paradigm (33)
- Year 11: Programming Mechatronics (29)
- Year 12: Secure Software Architecture (57)
- Year 12: Programming for the Web (59)
- Year 12: Software Automation (35)
- Year 12: The Software Engineering Project (47)
- Diagrams and modelling tools (18)
- Python, SQL, pseudocode and CSS patterns (33)
Definition
A search that checks each item in order until the target is found or the list ends. Works on unsorted data; slow for large lists.
Example: FOR i = 0 TO length-1: IF list[i] == target THEN found.
Check this one: Not named in the syllabus; it appears in past questions and the school notes.
Found in: past SDD papers.
Where you'll use it in the test
Syllabus area: Y11 Programming Fundamentals.
Question types it can appear in
- Pseudocode: Search an array for a value
- Python: Write or complete it in the online Python tool.
- Multiple choice: Pick the option that matches the definition or example.
- Code reading: Code or algorithm reading: interpret a fragment and state its output or purpose.
Where it has appeared in the paper
The Software Engineering Project (Part C, D). Part letters follow each paper’s own layout.
Related past questions
- Familiarisation Q8 (3 marks): Algorithm design (linear search) The Software Engineering Project (Part C) · 3 marks
- 2021 Software Design and Development HSC Q29 (3 marks): Tracing an algorithm (linear search) The Software Engineering Project (Part D) · 3 marks · old syllabus
How to use it
A model sentence
“A search that checks each item in order until the target is found or the list ends.” Then apply it: FOR i = 0 TO length-1: IF list[i] == target THEN found.
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
- Identify: Recognise and name. (2021 Software Design and Development HSC Q29 (3 marks): Tracing an algorithm (linear search))
Official worked answer
Familiarisation Q8 (3 marks): Algorithm design (linear search) (3 marks): official 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
Go deeper
- Flashcard: Linear search in Programming Fundamentals (Year 11) · study that set
- Memorise: Software development steps and algorithm design
- Notes: Part 3. Where this has been examined (see ../../question_bank.md) (The Software Engineering Project (Year 12))
- Master answer: sdd2021-q29 (3 marks, short answer / extended) (Master model answers: The Software Engineering Project (written answers))
- Notes: Part 3. Where this has been examined (see ../../question_bank.md) (Year 11 content (Programming fundamentals, OOP, Mechatronics))
- Notes: Common coding patterns (Python and SQL you must be able to write)
- Full term page: every question, note and marking comment for Linear search
Check yourself
Explain “Linear search” in one sentence, give an example, and name a question type that could test it.
Reveal the answer
A search that checks each item in order until the target is found or the list ends. Works on unsorted data; slow for large lists.
Example: FOR i = 0 TO length-1: IF list[i] == target THEN found.
Could be tested as: Pseudocode, Python, Multiple choice, Code reading.