The most useful trial lesson has a narrow target. Choose two sticking points, bring the work where they showed up, and decide how you will know the hour helped.
This page shows how to find your two points, how to turn them into a plan, and what a good focus looks like for Cambridge IGCSE Computer Science.
Why does a narrow focus work better?
Computer Science habits travel. Forgetting to test a boundary case can cost marks in searching, validation, file handling and databases. An hour spent on that habit repays itself across modules, while an hour skimming five topics gives a pleasant feeling and no change in your answers.
A narrow focus also makes the trial easier to judge. By the end you can tell whether the teacher explained the point clearly, whether you could solve a similar problem yourself, and whether you know what to practise next.
How do I find my two sticking points?
Use your marked work, not your impressions. Here is a worked example with an error log from three returned questions.
| Question | What I wrote | What went wrong |
|---|---|---|
| Convert binary 1101 to denary | 11 | Read the place values as 1, 2, 4, 8 from the left |
| Total the five values in Data | FOR i ← 1 TO 4 | The loop stopped one item early |
| Explain what the algorithm does | “It goes through the list” | Described the loop, not the purpose |
Sorting the causes. Line one is a place-value slip. Line two is a loop boundary. Line three is an explanation that says how the code moves but not what it achieves. Lines two and three look unrelated, yet both come from not asking “what should be true at the end?”.
Checking line one properly. In 1101 the place values from the left are 8, 4, 2 and 1. So 1101 = 8 + 4 + 0 + 1 = 13. The student’s 11 comes from 1 + 2 + 0 + 8, which reverses the place values. That is a small, quick fix you can practise in representing numbers and text.
Checking line two. Five values need FOR i ← 1 TO 5. A quick test with a list of one item and a list of five items would have shown the missing value. See loops that miss the last item.
Two patterns are worth taking to the trial.
- Pattern A: loop boundaries and boundary testing (line two, and the habit behind many others).
- Pattern B: stating the purpose of an algorithm in words (line three). See explaining an algorithm without the finished code.
The binary slip goes into your practice list. Two sticking points are plenty for one hour.
Which focus fits which symptom?
| What you notice | A useful focus | Bring to the lesson |
|---|---|---|
| Loops stop early or never stop | Stopping conditions and tracing with small data | Two questions with loop errors |
| Program works on samples but fails elsewhere | Boundary cases and test data | A program or trace that failed a test |
| Validation and verification mixed up | Purpose of each check, with examples | Marked answers on validation, verification and testing |
| SQL returns too many or too few rows | Combining conditions and reading results | Query questions from databases and query reasoning |
| Explanation answers marked down | Saying what an algorithm achieves | A marked written answer |
| Logic or truth-table errors | Reading a logic statement step by step | Questions from Boolean logic |
| Advice online does not match your paper | Confirming the exam route first | Your syllabus code, exam year and the source of the advice |
What should I bring, and how do I judge the lesson?
Bring your marked work, one program or trace you could not finish, and your error log. Keep paper and pen beside you, because trace tables are easier by hand.
Before the lesson, write down your two sticking points on one line each. The one-hour trial agenda builder helps with this.
Afterwards, judge the trial on three questions.
- Understanding: could I explain the fix in my own words?
- Communication: did the teacher ask about my thinking, or only give answers?
- Next step: do I know what to practise before the next lesson?
The post-trial reflection guide walks you through the same three. Any later arrangement is discussed directly with the teacher.
What if the syllabus route is unclear?
Start there. Confirm your syllabus code and exam year with your school or exam centre, because we do not handle entries. The 0478 guide, the 0265 guide and the page on the 2029 changes list what to check.
A good first-lesson focus can be as simple as “work out which advice belongs to my route”. That saves hours of practising the wrong thing.
What to read next
If you are still deciding, considering Computer Science tuition compares self-study, group classes and one-to-one. For how the assignment and trial work, see online one-to-one Computer Science tuition.
To practise before the lesson, the restricted pseudocode trace trainer and the learning guide are open to you at any time.