Divide and conquer

Term

Jump to a topic

See every item in the sequence

Definition

Breaking a large problem into smaller sub-problems, solving each one and combining the results (for example binary search or splitting a program into subroutines).

Example: Use it to explain why a program is split into subroutines.

Found in: syllabus.

Where you'll use it in the test

Syllabus area: Y11 Programming Fundamentals.

Question types it can appear in

Multiple choice: Pick the option that matches the definition or example.
Fill in the blanks: Choose this term to complete a statement or table.
Short answer: Describe the technique

Where it has appeared in the paper

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

How to use it

A model sentence

General advice, built from the definition and example above

“Breaking a large problem into smaller sub-problems, solving each one and combining the results (for example binary search or splitting a program into subroutines).” Then apply it: Use it to explain why a program is split into subroutines.

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 short answer questions in this bank the words used most are: Explain, Outline, Describe, Compare, Classify, Analyse. Check the actual word in your question.

Go deeper

Flashcard: Divide and conquer in Programming Fundamentals (Year 11) · study that set
Memorise: Software development steps and algorithm design
Notes: Software development steps and algorithm design (Year 11 content (Programming fundamentals, OOP, Mechatronics))
Full term page: every question, note and marking comment for Divide and conquer

Check yourself

Explain “Divide and conquer” in one sentence, give an example, and name a question type that could test it.

Reveal the answer