📩 Quick Enquiry
Send us a message — we reply within minutes. [fluentform id=”1″]IB Computer Science Tutor
1-on-1 tutoring from IBO certified Computer Science examiners. Core theory, algorithm design, object-oriented programming, abstract data structures (HL), and IA project support — for both SL and HL.
IB Computer Science Assessment Breakdown
Every mark allocation, command term, and grade boundary — from examiners who’ve sat on the marking committees.
Short-answer and extended response questions on Topics 1–4 plus HL extension topics. Covers system fundamentals, computer organisation, networks, computational thinking, and programming. Pseudocode questions are common at HL. No programming environment required. 2h SL / 2h30m HL.
Structured questions on algorithm design, object-oriented programming concepts, and data structures. Students trace algorithms, identify errors, and write pseudocode or code fragments. A pre-released case study shapes Section B (HL). 1h30m SL / 1h30m HL.
Structured essay questions on HL-only topics: abstract data structures (linked lists, binary trees, stacks, queues), resource management (operating systems, memory), and control systems (robotics, autonomous agents). Requires trace tables, pseudocode, and conceptual explanation. 1h HL.
A complete software solution to a real client’s problem. Includes: client description, design documentation (UML, flow charts), development evidence (annotated code), testing plan and evidence, and product evaluation. Any programming language. Approx 2,000 words + code + appendices.
⚡ Our examiners have marked real IB Computer Science papers — they know exactly what earns full marks vs. partial marks.
Book a Session →What We Cover in IB Computer Science
Every topic taught by IBO certified examiners who know exactly how marks are awarded.
Topic 1 — System Fundamentals: computer systems, hardware components, operating system roles, abstraction layers
Topic 2 — Computer Organisation: binary, hexadecimal, ASCII/Unicode, logic gates, Boolean algebra, CPU architecture
Topic 3 — Networks: LAN/WAN, TCP/IP stack, HTTP/HTTPS, DNS, packet switching, network security protocols
Topic 4 — Computational Thinking: algorithm design, trace tables, pseudocode (IB notation), flowcharts, top-down decomposition
Programming fundamentals: variables, data types, selection (if/else), iteration (for/while/do-while), recursion
Arrays and collection classes: 1D and 2D arrays; ArrayList; searching (linear, binary); sorting (bubble, selection, insertion, merge)
Object-oriented programming: classes, objects, constructors, methods, encapsulation, inheritance, polymorphism
HL — Abstract data structures: linked lists (singly, doubly, circular); stacks (LIFO); queues (FIFO); binary trees; tree traversal
HL — Resource management: process scheduling; memory management; virtual memory; interprocess communication
HL — Binary tree traversal: pre-order, in-order, post-order — applications and pseudocode
IA project: client identification; solution design using UML class diagrams; development with commented code; testing strategies
Pseudocode proficiency: IB notation — output, input, assignment, loops, conditionals, method calls — essential for Paper 2
How Our 1-on-1 Sessions Work
IBO Certified Examiners
Every tutor has marked real IB papers and knows exactly how marks are awarded.
1-on-1 Personalised
Sessions built around your specific syllabus gaps, predicted grade, and timeline.
Past Paper Practice
Systematic paper practice with full mark-scheme annotation and command-term coaching.
Flexible Scheduling
Morning, evening, weekend — book across 20+ time zones.
Progress Tracking
We track improvements session by session and adjust the plan when needed.
IA / Portfolio Support
Dedicated support for Internal Assessment from first draft to final submission.