Course

BRAINCheck · CT & AI LAB · ORIGINAL COMPANION WORKSHEET

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

Use decomposition and explicit instructions.

Name: ____________________ Class: ______ Date: __________

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.

A sample algorithm says: “Sort the books by size. It will always produce exactly the same order.”
  1. Use six paper book cards with height, page count and title. Include a tie.
  2. Choose one sorting measure and a tie-breaking rule.
  3. Ask a partner to follow the written steps without extra hints.
  4. Correct the algorithm if two people can legitimately produce different orders.

Quick check

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

My correction / justified conclusion

Evidence and reference actually checked

My reasoning, uncertainty and reflection

Use fictional/non-personal examples. Public worksheet; save or submit work only through your own notebook. Suggested 60-minute activity. Not an official NCERT/CBSE assessment or certificate.