UNIT 1 · LESSON 4 · 60-MINUTE SUGGESTED PLAN

Problem को छोटे steps में बाँटें

Use decomposition and explicit instructions.

Understand

Computational thinking begins with a clear problem, relevant information and a sequence of testable steps. An instruction such as “arrange nicely” is ambiguous. A rule such as “sort by increasing page count; break ties by title” is more reproducible. Test edge cases as well as typical examples.

Original classroom scenario / sample claim
A sample algorithm says: “Sort the books by size. It will always produce exactly the same order.”

Try it and check it

Use six paper book cards with height, page count and title. Include a tie.
Choose one sorting measure and a tie-breaking rule.
Ask a partner to follow the written steps without extra hints.
Correct the algorithm if two people can legitimately produce different orders.

Without a device: Print this lesson, use paper cards or the supplied fictional text, and discuss the checks in pairs. A student can later enter their own notebook record for teacher review when a device is available.

Notebook: write your corrected or unresolved conclusion, the evidence you actually checked, and a reflection. Do not include passwords, identity documents or private information. Original BrainCheck companion content, BCAI-v1.

QUICK CHECK • PRACTICE FEEDBACK

What most improves an ambiguous sorting algorithm?

More decorative headings

A defined measure and tie-breaking rule

A claim that it is smart

Removing all test examples

Write notebook entry Print worksheet / Save PDF Next lesson →