Updated:
Computing worksheets are most useful when they make an invisible process visible. A binary number represents a value through place positions. An algorithm changes a stored value one instruction at a time. A Boolean expression combines conditions according to precise rules. When learners write down those intermediate steps, a teacher can see why an answer is right or where the reasoning changed direction.
This guide covers three selected computing foundations: unsigned binary conversion, tracing simple repeated updates and evaluating Boolean expressions. It includes original classroom examples, diagnostic questions and an assessment with explained answers. The practice is suitable for learners meeting these ideas in lower or middle secondary education, but grade labels are only a starting point. Check local course expectations and prerequisite knowledge before assigning a level.
Try binary practice, algorithm tracing or Boolean logic practice after working through the relevant example. These tools cover defined skills; they are not a complete programming course, a substitute for writing programs or official examination papers.
1. Establish the language of a computing problem
Distinguish a value from its representation
The decimal numeral 13 and the binary numeral 1101 can represent the same quantity. They look different because they use different place-value systems. In decimal, moving one position left multiplies the place value by ten. In binary, moving one position left multiplies it by two. Neither representation changes the quantity being described.
Say “one one zero one in binary” when reading 1101 to beginners, rather than “one thousand one hundred and one.” The latter pronunciation silently applies decimal place values. Label the base in examples, particularly when the same digits could be interpreted in more than one way. In this guide, binary strings are explicitly described as binary; ordinary quantities are decimal unless stated otherwise.
Agree on conventions before tracing
A trace is a record of execution, not a prediction based on the appearance of the code. State the initial value, the update instruction, the number of repetitions and where output occurs. Use an assignment arrow, such as x ← x + 2, to mean “replace the stored value of x with its previous value plus two.” This is not an algebraic equation claiming that a number equals itself plus two.
For Boolean work here, 1 means true and 0 means false. AND requires both inputs to be true; inclusive OR requires at least one true input; NOT reverses one truth value. Explain these conventions explicitly. A learner should not have to guess whether the word “or” has its everyday exclusive meaning or the inclusive meaning used in the worksheet.
2. Read binary using place value
Build the columns from the right
Start with the rightmost place value of 1. Moving left gives 2, 4, 8, 16, 32 and so on. A five-digit binary number therefore uses the columns 16, 8, 4, 2 and 1 from left to right. A digit of 1 includes that column's value in the total. A digit of 0 contributes nothing, while preserving the position of the other digits.
For binary 10110, align the digits with 16, 8, 4, 2 and 1. The included values are 16, 4 and 2. Add them: 16 + 4 + 2 = 22 in decimal. The zero in the eight column does not cause later digits to move left. Writing the headings first is a reliable way to prevent that mistake.
Check with a smaller example
Binary 1000 represents eight, while binary 100 represents four. Counting the number of ones is not enough: both strings contain one 1, but its place differs. Ask learners to compare these two values before providing longer strings. If they answer that both represent one, return to place value rather than increasing the number of questions.
Leading zeros do not change the value in this unsigned interpretation. Binary 001101 and binary 1101 both represent thirteen. However, the width can matter when a question asks for a fixed number of bits. “Write thirteen in eight bits” requires 00001101. The additional zeros satisfy the representation requirement while leaving the value unchanged.
3. Convert decimal values into binary
Select powers of two
To convert decimal 13, find the largest power of two that does not exceed it: eight. Include eight and subtract it, leaving five. Include four, leaving one. Do not include two because only one remains. Include one, leaving zero. Across the 8, 4, 2 and 1 columns, the choices are 1, 1, 0 and 1, so the binary representation is 1101.
Reverse the conversion as a check: 8 + 4 + 1 = 13. The checking step should reconstruct the original decimal value. Merely looking at the binary string and deciding that it “looks right” supplies no independent evidence. For a learner who gets 111, the reverse sum 4 + 2 + 1 = 7 reveals a missing place-value position.
Use repeated division as a second method
Another method divides by two repeatedly and records the remainders. For thirteen, the sequence is 13 ÷ 2 = 6 remainder 1; 6 ÷ 2 = 3 remainder 0; 3 ÷ 2 = 1 remainder 1; and 1 ÷ 2 = 0 remainder 1. Read the recorded remainders from last to first to obtain 1101.
Explain why the order reverses. The first remainder describes whether the original value has a one in the units column. The next remainder describes the twos column, and later remainders describe successively larger places. Reading downward treats the smallest place as if it were the largest. Learners do not need a formal proof immediately, but they should connect the procedure to place value.
Define the range before adding complexity
An unsigned four-bit representation covers decimal zero through fifteen. Its maximum is 8 + 4 + 2 + 1 = 15. Decimal sixteen needs five bits in this representation. This does not mean that four bits can never be interpreted differently; it means the stated unsigned model has a defined range. Signed numbers, fractions, overflow rules and text encodings require additional conventions and are outside these introductory conversion questions.
4. Trace repeated updates one step at a time
Consider the following language-neutral instructions:
x ← 2
REPEAT 3 TIMES
x ← x + 2
END REPEAT
OUTPUT x
The initial value is two. The update runs three times, producing four, six and eight. The output is therefore 8. The trace contains four recorded states if the initial state is included, but only three executions of the update. Confusing those counts is a frequent source of mistakes.
Give each row a clear meaning
Use headings “completed updates” and “value of x.” The rows are 0 → 2, 1 → 4, 2 → 6 and 3 → 8. The zero row is not an extra loop iteration; it records the value before the loop begins. Consistent row meanings matter more than a particular table style. If a course records only post-update states, explain that convention before comparing answers.
Follow the sign of the update
Now start at eleven and subtract three on each of four repetitions. The states are 11, 8, 5, 2 and −1. The final answer is negative one. A learner who stops at two may have counted the initial state as the first repetition. A learner who writes fourteen after the first update may have lost the minus sign.
For a constant additive update, the final value can also be checked using start + step × repetitions. Here, 11 + (−3 × 4) = −1. This formula checks this particular pattern; it does not replace tracing arbitrary algorithms with changing steps, branches or multiple variables. State that limitation so students do not apply it to every loop they encounter.
5. Separate a stored value from displayed output
Move the output instruction and compare
In the first algorithm, output happens once after the loop, so the displayed result is eight. If OUTPUT x moves inside the loop after the update, the displayed sequence becomes four, six, eight. The final stored value is still eight, but the requested output is now a sequence of three values. A correct trace should answer the question actually asked.
If output occurs inside the loop before the update, the sequence becomes two, four, six, while the final stored value after all updates remains eight. This small change is a powerful discussion example. Ask students to place a finger on the next instruction before writing an output. That physical pause helps distinguish “what is stored now” from “what will be stored after the next line.”
Use a trace to explain, not just calculate
A trace table provides evidence for an answer. It lets another learner inspect whether each update used the previous state correctly. Pair students and ask one to execute the instructions while the other checks the record. Switch roles with new values. Avoid giving one learner the permanent role of calculator operator, because both need to practice reading the process.
The WorksheetWise tracing generator uses repeated additions or subtractions with a stated start and repetition count. The output-placement examples in this guide are teacher-led extensions. They should not be described as a feature of every generated worksheet. For loops with decisions, arrays or input validation, choose an additional resource matched to those concepts.
6. Evaluate AND, OR and NOT precisely
Read the truth table by rows
For two inputs A and B, there are four possible true/false combinations. When A = 0 and B = 0, both AND and OR give 0. When the inputs are 0 and 1, AND gives 0 and OR gives 1. The same outputs apply to inputs 1 and 0. When both inputs are 1, AND and OR both give 1.
The key difference is what happens when exactly one input is true. AND gives false because both conditions were required. OR gives true because at least one condition is enough. A learner who makes OR false when both inputs are true is using exclusive OR, which is a different operation. Name the distinction rather than marking the response wrong without explanation.
Apply NOT to the stated expression
NOT 1 gives 0, and NOT 0 gives 1. In NOT (1 OR 0), evaluate the expression inside the parentheses first. Since 1 OR 0 is 1, the outer NOT makes the final result 0. In NOT (1 AND 0), the inner result is 0, so the final result is 1.
Do not move NOT onto only the first input. NOT (A OR B) is not the same expression as (NOT A) OR B. With A = 0 and B = 1, the first expression gives 0 and the second gives 1. A single counterexample is enough to show they are not interchangeable. Parentheses define which result is being reversed.
Make the conditions concrete without hiding assumptions
A fictional classroom rule might say that a resource is available when a task is complete AND a teacher has checked it. Both conditions must hold. Another rule might say that a learner may choose a written OR spoken explanation, allowing either or both formats. Keep these as invented learning examples; real access-control systems can involve much more than a single Boolean expression.
7. Diagnose errors before assigning more practice
Ask students to show a place-value row, a trace row or an intermediate Boolean result. Those short records reveal different misconceptions. Binary 10110 interpreted as eleven may reflect decimal reading, missing columns or an arithmetic slip; the answer alone cannot identify which. A written decomposition reveals the actual choice.
Match the correction to the cause
If binary columns run 1, 2, 3, 4 instead of powers of two, rebuild the doubling pattern. If remainders are read in the wrong direction, label the first remainder as the units bit. If a loop answer is one update short, separate the initial row from the repeated rows. If NOT affects only one input, draw a box around the parenthesized expression before reversing its value.
Feedback should include a next action and a new opportunity to apply it. After correcting 10110, use a different binary number such as 10011. After fixing the loop count, change both the starting value and number of repetitions. Success on a fresh item is stronger evidence than copying the corrected working from the first one.
Avoid unnecessary reading barriers
Use a monospaced font for binary strings and pseudocode, enough space between columns and clear indentation. Do not rely only on red and green to distinguish false and true; retain the written labels or digits. Read long instructions aloud when reading fluency is not the objective, but preserve the exact order and number of steps.
For multilingual learners, introduce a small glossary linking the local terms for value, digit, variable, repeat and output. Keep variable names stable while explaining the instructions in the learner's preferred language. Translating a sentence should not silently change an inclusive condition into an exclusive one or turn “repeat three times” into “repeat until three.”
8. Build a lesson around visible reasoning
Begin with a quick prerequisite check: can learners double one repeatedly, add selected small values and interpret a negative update? Use the result to decide whether the first lesson should focus on place value or can move directly into conversion. Do not use grade alone as evidence that the prerequisites are secure.
Model one binary conversion while explicitly rejecting an incorrect column. Follow with a partially completed table, then an independent conversion. Ask learners to reverse their answers into decimal. In a later lesson, introduce the trace table using a familiar repeated addition before adding a negative step. Boolean logic can begin with all four input combinations rather than a long expression.
For a mixed review, present one problem from each skill without a heading naming the method. Ask students to identify the representation or process first, then solve it. The explanation “I need a trace because each instruction changes the stored value” shows method selection. The statement “I used the formula from the previous page” may indicate dependence on surface layout.
End with a short reflection: which record helped you check your answer, and what would change if one instruction moved? This invites transfer without requiring a lengthy written essay. Preserve a few anonymized error patterns for planning the next lesson, rather than reducing every response to a total score.
9. Original computing assessment and answers
These six questions form a short teacher-reviewed check. They are original educational practice. Suggested marking gives credit for correct intermediate representation as well as the final result; adapt the marks and timing to the group rather than claiming equivalence to an external examination.
- Convert binary 10011 into decimal. Show the selected place values.
- Write decimal 26 in binary and check it by addition.
- Start with x = 5. Repeat
x ← x + 3four times, then output x. Give the trace and final output. - Use question three but place output after each update inside the loop. Give the displayed sequence.
- Evaluate NOT (1 AND 0), showing the inner result.
- A learner claims that 1 OR 1 equals 0. Explain the error under inclusive OR.
Explained answers
For question one, the columns are 16, 8, 4, 2 and 1. The selected values are 16 + 2 + 1, giving 19. For question two, 26 = 16 + 8 + 2, so the binary representation is 11010. The zero in the units column matters because the value is even; omitting it changes the representation.
For question three, the states are 5, 8, 11, 14, 17. There are four updates after the initial value, and the single final output is 17. For question four, the output sequence is 8, 11, 14, 17 because each output follows its update. Do not include five unless the instructions explicitly output the initial value.
For question five, 1 AND 0 gives 0, and NOT 0 gives 1. For question six, inclusive OR is true when at least one input is true, including when both are true. Therefore 1 OR 1 = 1. The proposed result belongs to a different operation, exclusive OR, and does not follow the stated rule.
10. Select resources and plan the next step
Use binary practice for conversions with increasing ranges, algorithm tracing for the supported repeated updates and Boolean logic practice for small expressions. Boolean practice deliberately has a smaller question limit because the supported combinations are limited. More rows do not necessarily create more meaningful variety.
The original computing assessment combines the supported skills. Review the questions and answer key before class. For additional explanations or teacher-written extensions, use the test designer. Try the free resources first and compare free and Plus if regular saving and preparation fit your workflow. A subscription should support a real teaching task, not be a prerequisite for understanding the examples here.
Does this replace practical programming?
No. Paper tracing helps learners reason about execution, but writing, running and revising programs introduces further decisions and feedback. Use these worksheets alongside a programming environment appropriate to your course. The guide does not claim to cover functions, data structures, networks, cybersecurity or the whole computing curriculum.
Can I change the pseudocode language?
Yes, provided you preserve assignment, repetition count, update order and output placement. Explain the chosen notation before assessment. Syntax familiarity should not become an accidental barrier when the intended objective is tracing a simple process. If a qualification specifies its own pseudocode conventions, use those in qualification-specific preparation.
Where can teachers read further?
CS Unplugged's explanation of how binary digits work provides further place-value reading. For planning feedback after an error analysis, see the Education Endowment Foundation's teacher feedback guidance. The examples, trace exercises and assessment on this page were independently written for WorksheetWise.