Dry Runs, Tracing & Logic Control: Partial Credit Strategy In Tracing Questions (Copy)
Partial Credit Strategy In Tracing Questions (Cambridge Standard – O Level 2210 + IGCSE 0478)
Why Partial Credit Matters More Than Full Accuracy In Tracing Questions
- Tracing questions are:
- Method-mark heavy
- Designed so that:
- Very few students get everything 100% correct
- Cambridge examiners:
- Reward correct logic steps
- Do not apply “all-or-nothing” marking
- A student who understands process:
- Can still score well even with a wrong final value
- A student who guesses the final output:
- Often scores zero, even if lucky
How Cambridge Actually Marks Tracing Questions
Cambridge typically uses:
- Step-based marking
- Independent marks per stage
- Error-carried-forward (ECF) where appropriate
This means:
- One mistake does not automatically cancel all following marks
Typical Mark Breakdown (Hidden But Consistent)
For a 3–5 mark tracing/output question, marks are often split as:
| Component | Typical Marks |
|---|---|
| Correct loop execution | 1 |
| Correct variable update logic | 1 |
| Correct handling of condition(s) | 1 |
| Correct output order | 1 |
| Correct final value | 1 |
You can lose:
- The final-value mark
But still gain: - Most of the logic marks
Golden Rule For Partial Credit
- Show your working clearly
- Cambridge can only award marks for:
- What is visible
- What is traceable
- Mental execution with only a final answer:
- Gives examiners nothing to credit
Strategy 1: Always Draw A Trace Table (Even If Not Asked)
- Even when the question says:
- “State the output”
- You should still:
- Construct a trace table on paper
- This helps:
- You avoid skipping steps
- The examiner see your logic if values are written clearly
Examiner Reality
- Examiners often:
- See partial trace working
- And award method marks
- Blank answers or single guessed outputs:
- Get zero
Written and Compiled By Sir Hunain Zia (AYLOTI), World Record Holder With 154 Total A Grades, 7 Distinctions and 11 World Records For Educate A Change O Level And IGCSE Computer Science Full Scale Course
Strategy 2: Prioritise Correct Loop Execution Over Arithmetic Accuracy
- Loop structure marks are:
- More valuable than arithmetic precision
- Common situation:
- Student makes a small arithmetic slip
- But loop iterations are correct
Cambridge often awards:
- Loop mark ✔
- Condition mark ✔
- Arithmetic mark ✘
Example
Algorithm:
- total ← 0
- FOR i ← 1 TO 4
- total ← total + values[i]
- ENDFOR
If student:
- Uses correct i values (1,2,3,4)
- But adds one value incorrectly
Result:
- Partial credit still awarded
Strategy 3: Respect Output Order Even If Values Are Wrong
- Output order is:
- A separate marking point
- If outputs are:
- In correct order
- But one value is wrong
- You still gain:
- Order mark(s)
Example
Expected output:
- 2, 4, 6, 8
Student writes:
- 2, 5, 6, 8
Marks:
- Order ✔
- Three correct values ✔✔✔
- One value ✘
Result:
- High partial credit
Written and Compiled By Sir Hunain Zia (AYLOTI), World Record Holder With 154 Total A Grades, 7 Distinctions and 11 World Records For Educate A Change O Level And IGCSE Computer Science Full Scale Course
Strategy 4: Never Skip Iterations After A Mistake (ECF Principle)
- Error-carried-forward (ECF) means:
- If you make a mistake
- But then consistently apply your own wrong value
- You can still earn marks
Example
- total ← total + values[i]
If student:
- Starts with total = 5 instead of 0
- Then correctly updates total using loop logic
Examiner logic:
- Initial value mark ✘
- Loop execution ✔
- Update logic ✔
- Output order ✔
Strategy 5: Write Values At Every Assignment Point
- Partial credit depends on:
- Seeing where values change
- Best practice:
- Write updated variable values immediately after assignment
Bad:
- Only writing values at the end
Good:
- Showing progression:
- Before assignment
- After assignment
Strategy 6: Show Condition Results Explicitly (TRUE / FALSE)
- Conditions are:
- Separate logic marks
- Writing:
- TRUE / FALSE
- Or ticking branches
- Helps examiners see:
- Correct decision-making
Example
| i | value | value > 10 | count |
|---|---|---|---|
| 1 | 8 | FALSE | 0 |
| 2 | 12 | TRUE | 1 |
Even if:
- count later goes wrong
You still earn: - Condition-evaluation marks
Written and Compiled By Sir Hunain Zia (AYLOTI), World Record Holder With 154 Total A Grades, 7 Distinctions and 11 World Records For Educate A Change O Level And IGCSE Computer Science Full Scale Course
Strategy 7: Do Not Erase Working Unless It Is Completely Wrong
- Crossing out working:
- Removes examiner’s ability to award method marks
- If you realise a mistake:
- Strike through lightly
- Continue with corrected values
- Let the examiner see:
- Both attempts
Strategy 8: Separate Each Output Clearly
- When multiple outputs exist:
- Write them on separate lines
- Or clearly separated by commas
- Messy outputs:
- Often lose marks even if values are correct
Strategy 9: When Short On Time, Trace Only Critical Variables
- If time is limited:
- Do not abandon the question
- Focus on:
- Loop index
- One key variable (total / count / found)
- Even partial tracing:
- Can earn marks
Strategy 10: Avoid “Final Answer Only” Responses
- Writing only:
- “The output is 12”
- Without working:
- Is high risk
- If that value is wrong:
- Zero marks
Better:
- Show trace
- Even if final value is uncertain
Written and Compiled By Sir Hunain Zia (AYLOTI), World Record Holder With 154 Total A Grades, 7 Distinctions and 11 World Records For Educate A Change O Level And IGCSE Computer Science Full Scale Course
Common Situations Where Partial Credit Is Awarded
- Correct loop bounds, wrong arithmetic
- Correct condition logic, wrong initial value
- Correct output order, one incorrect value
- Correct trace method, final transcription error
- Correct updates, incorrect stopping point
Situations Where Partial Credit Is NOT Awarded
- Random guessed outputs
- Skipped working entirely
- Completely incorrect loop execution
- Confusing WHILE with REPEAT logic
- No visible understanding of algorithm flow
Examiner Mindset (Understand This)
Examiners ask:
- “Does this student understand how the algorithm runs?”
If yes:
- Marks are awarded generously
If no:
- Even a lucky final answer may score zero
Fast Exam Checklist For Partial Credit Maximisation
- Did I show variable updates?
- Did I trace every loop iteration?
- Did I mark TRUE/FALSE conditions?
- Did I list outputs in order?
- Did I continue after mistakes?
- Did I avoid guessing?
Best-Practice Strategy Summary
- Always trace, never guess
- Show logic, not just results
- Continue after errors
- Respect execution order
- Write clearly and sequentially
Final Quality Checklist
- Visible trace table
- Clear variable updates
- Correct loop structure shown
- Outputs clearly separated
- No skipped logic steps
Final Lock-In Rules
- Partial credit rewards understanding, not perfection
- Method marks are your safety net
- One mistake does not kill the question
- Showing work is non-negotiable
- Smart tracing = maximum Paper 2 marks