Check the starting point
- Add consistent edge weights
- Distinguish a feasible candidate from an optimum
Show the idea
Search a constrained family
For rectangles of perimeter 24, width x and length 12 − x give area x(12 − x). Whole-number candidates from 1 to 6 reach maximum 36 at 6 × 6.
Work through an example
Search a constrained family — explain the representation.
- For rectangles of perimeter 24, width x and length 12 − x give area x(12 − x). Whole-number candidates from 1 to 6 reach maximum 36 at 6 × 6.
- Connect the labels to the calculation or rule. The first feasible route or the locally cheapest next step is not automatically the best complete solution.
Answer: For rectangles of perimeter 24, width x and length 12 − x give area x(12 − x). Whole-number candidates from 1 to 6 reach maximum 36 at 6 × 6.
Teach in small steps
- Begin with a short oral check: ask your child to add consistent edge weights. Then check that they can distinguish a feasible candidate from an optimum. Revisit either skill before adding a new procedure.
- Explore “Search a constrained family” together. For rectangles of perimeter 24, width x and length 12 − x give area x(12 − x). Whole-number candidates from 1 to 6 reach maximum 36 at 6 × 6. Ask your child to point to the quantities or features used at each step.
- Model the example: An undirected network has edges AB=4, AC=2, CB=1, BD=3 and CD=7. Find a shortest route from A to D. Pause before each step and invite a prediction. A–B–D has length 7. A–C–D has length 9. A–C–B–D has length 2+1+3=6. With all edge lengths positive, a shortest route needs no repeated vertex; these and A–B–C–D exhaust the simple routes.
- Work together on the first new practice question: An undirected network has AB = 4, BC = 3 and AC = 9. Find the shortest route from A to C. Have your child attempt the remaining learn questions with less help, then move to apply. Use the checkpoint on a later attempt to see which ideas are retained.
Ask and listen
- On an unobstructed square grid, move one unit horizontally or vertically per step. Find the shortest route length from (−2,1) to (3,5).
- A program returns a shortest route of weight 12 but another has the same weight. Must it reject one as incorrect?
Adapt the practice
More support
Return to “Search a constrained family” and explain one label or step at a time. The first feasible route or the locally cheapest next step is not automatically the best complete solution. Let your child show a calculation, drawing or spoken explanation before requiring a polished written answer.
More challenge
Try this application after the core method is secure: A route algorithm chooses AB = 1 rather than AC = 4. The remaining edges to D are BD = 20 and CD = 3. Compare its result with the best route. Then ask which assumption or input could be changed and what would need to be recalculated.
Look for understanding
- The learner can complete and explain this checkpoint task: A rectangle search allows zero or negative widths. What input constraint should be added for perimeter P > 0?
- The learner can address the reasoning or error-checking question: A program returns a shortest route of weight 12 but another has the same weight. Must it reject one as incorrect? Accept a correct alternative method, but ask for the mathematical reason.
Choose the next step
If both checks can be explained without prompting, continue to Standard deviation and measures of spread. If a method is still uncertain, repeat the visual example with fresh numbers before progressing.
Put the idea into practice
The matching topic collection includes learn-and-practise, application and checkpoint PDFs with worked answers. Download the free preview to see representative pages.
Explore this topic’s worksheets