We teach Cambridge IGCSE Computer Science online, one to one, to students anywhere in Malaysia. After your WhatsApp enquiry we assign an experienced teacher to you, and you begin with a paid one-hour trial at that teacher’s confirmed rate, starting from RM80. The rate is confirmed with you before the lesson.
Everything after the trial, including further lessons, schedule and fees, is arranged directly between you and the teacher. The trial is a taught class where your own questions, code and working are the material.
Who is this Computer Science tuition for?
It suits the student who can follow a program in class but loses marks when the question asks for reasoning. You may write code that runs and still be unable to explain why a loop stops where it does, or what a variable holds on the third pass.
You might recognise yourself in one of these situations:
- Your loop runs forever, or it misses the last item. The guide on loops that run forever or miss the last item describes the habit behind it.
- Your program works on the sample data and fails on a boundary case such as an empty list or the largest allowed value. See boundary cases.
- You mix up validation and verification, or an SQL query returns too many rows because the conditions were combined wrongly.
- You can write the code but not describe the algorithm in words, so explanation questions lose marks.
- You are reading Python-only advice online while your own exam route asks for something different.
- A parent sees long hours at the computer and wants to know whether that time is aimed at the right gap.
This page is written for both of you. The student does the thinking in the lesson, and the parent decides whether the trial is worth trying.
Is this the actual exam syllabus?
The most common question we hear is whether this is the real Cambridge syllabus, or ICT, or a generic coding course. The answer is that lessons follow the Cambridge IGCSE Computer Science syllabus code you are entered for, and Computer Science is kept separate from ICT.
Two codes appear in Cambridge’s catalogue for this subject area: 0478 and 0265. We treat them as separate routes that need checking, not as one interchangeable thing. Your school or exam centre confirms which one you are entered for, and the Cambridge pages show the current syllabus and notices.
Use the syllabus and exam-year navigator to make a checking list, then read the 0478 code and exam-year guide and the 0265 guide. The page on distinguishing 2026 to 2028 from the 2029 changes helps if an online tip seems to come from a different exam year.
What can individual teaching do that notes cannot?
A teacher watching you trace an algorithm can see the exact line where your picture of the program and the real program part ways. In Computer Science that is rarely “I did not know the keyword”. It is usually an assumption about what a variable holds, or which value the loop tests first.
Here is an original example of how that looks in a lesson.
The task. An array holds five scores: 6, 11, 4, 11, 9. The algorithm should output the highest score and the position of the first place it appears. Positions are numbered from 1 in this example.
A student’s first attempt.
Max ← 0
Pos ← 0
FOR i ← 1 TO 5
IF Data[i] >= Max THEN
Max ← Data[i]
Pos ← i
ENDIF
NEXT i
OUTPUT Max, PosThe student says, “It finds the maximum, so it works.” The teacher does not say “wrong”. They ask the student to fill in a trace table one pass at a time.
| i | Data[i] | Data[i] >= Max? | Max | Pos |
|---|---|---|---|---|
| start | 0 | 0 | ||
| 1 | 6 | yes (6 >= 0) | 6 | 1 |
| 2 | 11 | yes (11 >= 6) | 11 | 2 |
| 3 | 4 | no | 11 | 2 |
| 4 | 11 | yes (11 >= 11) | 11 | 4 |
| 5 | 9 | no | 11 | 4 |
The output is 11 and 4. The maximum is right, but the first position of 11 is 2, not 4. The table shows the cause on row 4: >= lets an equal value overwrite the stored position.
The fix and the check. Change the comparison to >. Row 4 becomes “no (11 > 11 is false)”, so Pos stays 2, and the output is 11 and 2. The student then asks a second question: what if every score were negative? Starting Max at 0 would never be replaced, so a safer start is Max ← Data[1] and Pos ← 1.
The lesson is the habit. Trace first, predict what the table will say, then compare with what the code does.
The same move works on counting loops, running totals and search. You can practise the pieces in algorithm design, repetition and arrays and validation, verification and testing. The restricted pseudocode trace trainer lets you try the same skill on your own.
Which parts of Computer Science do students bring most?
There is no fixed list, because the teacher follows your marked work and your questions. Some patterns return often, and each has a place to read first.
- Algorithms and loops: trace tables, flowcharts, stopping conditions. Start with algorithm design.
- Programming structure: selection, procedures, functions and variables. See programming structure.
- Searching, sorting and files: following an algorithm step by step. See searching, sorting and files.
- Boolean logic: truth tables and logic statements. See Boolean logic.
- Databases: reading a table and combining SQL conditions. See databases and query reasoning.
- Data representation: binary, hexadecimal and storage sizes. See representing numbers and text.
Tell the teacher your exam year and route, so the work stays in the scope your school or exam centre has entered you for.
Where does tuition reach its limits?
A teacher cannot sit your paper, and cannot type the practice you do between lessons. Progress depends on you trying questions alone, then bringing the stuck points to the lesson.
Some practical boundaries:
- We are not an exam centre. Registration, entry, results and access arrangements belong to your school or exam centre and to Cambridge.
- Assessed or coursework-style work must remain yours. A teacher can teach the method and how to test your own code, not produce your work.
- Syllabus scope depends on your code and exam year. Check the Cambridge page before lessons begin.
- Self-study may be enough if your errors are occasional slips. A few original practice sets and a careful read of your marked papers can fix those.
How does it work, from enquiry to trial?
- Enquire on WhatsApp. Tell us you want Computer Science, your year and the topics or question types that trouble you. You do not need to send marks or code.
- We assign a teacher. An experienced Computer Science teacher is assigned to you, and we confirm that teacher’s rate for the paid one-hour trial, starting from RM80.
- Prepare a short agenda. The one-hour trial agenda builder helps you pick two sticking points, so the hour goes on your real difficulty.
- Take the trial. It is taught, one to one, online. Bring a question or a program you could not finish.
- Reflect, then decide. The post-trial reflection guide separates understanding, communication and clarity about next steps. Further arrangements are discussed directly with the teacher.
The full process is on the trial page and in how tuition works.
Can the teacher build your reasoning, not just your code?
This is the question Computer Science students and parents ask most, and it is the right one. Reasoning is visible. Ask the teacher to work through an algorithm aloud, and listen for three things.
- Do they predict the output before running or tracing the program?
- Do they test boundary values, such as an empty list, one item, or equal values, as in the example above?
- Can they explain the algorithm in plain words without showing finished code? The guide on explaining an algorithm without the finished code covers this skill.
In the trial, bring a short program and watch whether the teacher asks you to explain your choices. Marks in this subject go to reasoning you can show.
Over 9,000 students have been helped through our service across all subjects. That figure is service-wide, not a Computer Science result, so judge fit by the trial itself.
Where to go next
Start with the Computer Science learning guide for the full topic map and a study order. Then pick the module that matches your gap: programming structure for code that runs but fails, validation, verification and testing for test-data questions, or problem-solving explanations for writing out an algorithm.
If you are still weighing things up, read considering Computer Science tuition for a fair look at self-study, group classes and one-to-one. When you are ready to try a session, choosing a useful lesson focus will help you plan the first hour.