Find Computer Science tutors

Computer Science includes designing programs and understanding the systems that run them. The right starting point depends on what the learner is studying and what they can already do. A language name alone, such as Python, does not describe the whole course.

For a school qualification, send the country, board, course code and exam year. The examples below show why those details matter; they are not a single UK syllabus.

Check the AQA GCSE Computer Science course overview if you are choosing resources around its specification change; the exam year identifies the relevant edition.

For a beginner or GCSE learner, tracing means following a program one instruction at a time. In this constructed practice example, the task is to count scores of at least 50:

count = 0
for score in [49, 50, 72]:
    if score >= 50:
        count = count + 1
print(count)

count starts at zero. The loop visits each score in turn. At 49, the condition is false, so the count stays 0. At 50, it is true and the count becomes 1. At 72, it becomes 2. The final line prints 2, once the loop has finished.

The common mistake here is to write score > 50. That counts only 72 and prints 1: it has left out the boundary value 50. The symbol >= means “greater than or equal to”. A clear explanation is: “50 must count because the task says at least 50, so the condition must include equality.”

Try the list [50, 50] next. The answer should be 2, because the program counts entries, including repeated values. Predict the result before running it. Being able to explain a changed input is a more useful check of understanding than copying the original code.

Writing code is only part of Computer Science. Data representation also asks how information is stored and interpreted. For school-level practice, take the eight-bit unsigned binary value 00001101. Here “unsigned” means it represents a non-negative whole number.

The place values, from left to right, are 128, 64, 32, 16, 8, 4, 2 and 1. Add only the places containing a 1: 8 + 4 + 1 = 13. A common error is to add every place value or to read 1101 as a decimal number. A clearer response identifies the active places and shows the addition.

Try 00001110 next: the active places are 8, 4 and 2, so the value is 14. The improvement to look for is an explanation of which places changed and why the total changed, rather than a remembered answer.

An A-level or university task may ask why an algorithm is appropriate, as well as whether it works. Consider searching the sorted list [3, 8, 12, 17, 25, 31, 40] for 31.

A linear search starting at the left checks six entries before it finds 31. Binary search checks the middle entry, 17, first. Since 31 is larger, it discards the lower half and searches [25, 31, 40]. The middle of that remaining range is 31, so it finds the target after inspecting two entries.

The essential condition is that the list is sorted. “Binary search is faster” is an incomplete explanation. A stronger answer is: “Binary search can discard half the remaining candidates because the values are ordered; on an unsorted list that decision could discard the target.”

At a level where efficiency notation is required, repeated halving gives binary search logarithmic search time, written O(log n), compared with linear search’s O(n) worst case. Here n is the number of entries. This compares the searching work on a sorted array; sorting an unsorted input is additional work. It does not mean this small example measures a program’s speed.

For a follow-up, search the same list for 26. The learner should explain how the search ends without finding it, rather than returning a nearby value.

For a programming project, begin with a problem that has a clear purpose and testable requirements. On a separate practice task, a learner might turn “check the scores” into “count each score of at least 50”, then choose test cases below, at and above the boundary. That links a requirement to code and evidence that the code behaves as intended.

Before discussing live assessed work, check the school or college’s rules on outside help. For qualifications covered by JCQ’s non-examination assessment guidance, submitted work must be the learner’s own and outside help must be disclosed to the teacher. A tutor should not write the assessed program or project report for the learner. Practise the underlying technique on a different problem, then let the learner apply it within their course’s rules. For university assignments, follow the module’s own assessment guidance.