IB Computer Science HL AI Tutor Playbook 2026

Audience: IB-Diploma-Programme Year-12 + Year-13 candidates + IB-Bilingual + IB-Course-Companion cohorts at IB-World-Schools in Switzerland + Singapore + Hong-Kong + UAE + UK + US + Canada + Australia + New-Zealand + Japan + Korea + China + India + Pakistan + Bangladesh + Indonesia + Malaysia + Thailand + Vietnam + Philippines + Egypt + South-Africa + Kenya + Nigeria + Ghana + Saudi + Qatar + Bahrain + Kuwait + Oman + Jordan + Lebanon — typically the cohort in IB-Computer-Science-HL + IB-Mathematics-HL-Analysis + IB-Physics-HL + IB-Chemistry-HL + IB-Biology-HL + IB-Economics-HL + IB-Psychology-HL + IB-English-A-Literature-HL + IB-History-HL + IB-Geography-HL + IB-Global-Politics-HL, often paired with IB-Extended-Essay-in-Computer-Science + IB-Internal-Assessment-Solution-Development + IB-TOK-exhibition + IB-CAS-creativity-activity-service. Covers IB Computer Science HL teachers who want an AI workflow for grading Paper-1-short-response + Paper-2-extended-response + Paper-3-pre-release-case-study + IA-solution, parents paying for IB-Computer-Science-HL-prep ($300-$3000 for prep-books + $1000-$5000 for prep-courses + $2000-$8000 for private-tutors), IB-World-Schools seeking IB-Computer-Science-HL-internal-assessment-rubric alignment, and overseas IB-Diploma-candidates applying to MIT + CMU + Stanford + Caltech + Berkeley + Georgia-Tech + UIUC + Michigan + Cornell + Princeton + Harvard + Yale + Columbia + Oxford + Cambridge + Imperial + UCL + Edinburgh + Manchester + Bristol + Warwick + KCL + Durham + Toronto + UBC + Waterloo + McGill + NUS + NTU + HKUST + KAIST + SNU + Tsinghua + Peking + IIT-Bombay + IIT-Delhi + ETH-Zurich + EPFL admissions.

Hook: IB Computer Science HL is the most-respected pre-university computer-science + software-engineering + AI-ML + data-science qualification globally — the standard for IB-Diploma-Programme Year-12 + Year-13 candidates at IB-World-Schools targeting MIT + CMU + Stanford + Caltech + Berkeley + Georgia-Tech + UIUC + Michigan + Cornell + Princeton + Harvard + Yale + Columbia + Oxford + Cambridge + Imperial + UCL + Toronto + Waterloo admissions. The 2025 score distribution is selective: score-7 rate of approximately 12-15 percent (highest honours + university-credit at MIT + CMU + Stanford + Caltech + Berkeley + Georgia-Tech + UIUC + Cornell + Princeton + Harvard + Yale + Columbia + Oxford + Cambridge + Imperial + UCL + Toronto + Waterloo), score-6 rate of approximately 21 percent, score-5 rate of approximately 24 percent (the score-5+ cumulative rate 57-60 percent is the IB Diploma + university-readiness benchmark), score-4 rate of approximately 19 percent, score-3 rate of approximately 12 percent, score-2 rate of approximately 6 percent, score-1 rate of approximately 4 percent. The HL-Extension-topics-of-IB-Computer-Science-HL (Abstract-Data-Types + Linked-Lists + Binary-Trees + Hash-Tables + Graphs + Object-Oriented-Programming + Recursion + Algorithm-Design + Sorting + Searching + Dynamic-Programming + Graph-Algorithms + Computational-Thinking + Databases + Networks + Web-Technologies + Machine-Learning + AI-Ethics) + 3-Paper-structure (Paper-1-short-response + Paper-2-extended-response + Paper-3-pre-release-case-study) + Internal-Assessment-Solution-Development map onto Year-12 + Year-13-CS + first-year-undergraduate-CS + Software-Engineering + AI-ML + Data-Science + Cybersecurity + Computer-Engineering + Mathematics + Computational-Physics + Quantitative-Finance at MIT + CMU + Stanford + Caltech + Berkeley + Georgia-Tech + UIUC + Michigan + Cornell + Princeton + Harvard + Yale + Columbia + Oxford + Cambridge + Imperial + UCL + Toronto + Waterloo admissions.

Section 1 — Why IB Computer Science HL is the most-respected pre-university computer-science + software-engineering + AI-ML + data-science qualification + the MIT + CMU + Stanford + Berkeley + Georgia-Tech + Oxford + Cambridge + Imperial + UCL + Toronto + Waterloo first-year-undergraduate-CS + Software-Engineering + AI-ML + Data-Science IBO-applied-track subject

IB Computer Science HL is the IBO-standard pre-university computer-science + software-engineering + AI-ML + data-science qualification for IB-Diploma-Programme Year-12 + Year-13 candidates — computational-thinking-driven, abstract-data-types-required, object-oriented-programming-embedded, algorithm-design-applied, recursion-focused, sorting-required, searching-required, graph-theory-required, trees-required, hash-tables-required, databases-required, networks-required, web-technologies-required, machine-learning-applied, AI-ethics-required, IA-solution-development-required. It is the standard for IB-World-Schools in 145+ countries. Unlike AP Computer Science A (Java-only + non-OOP-extension + non-HL-extension + non-case-study + non-AI-ML + non-mock-paper-3) + AP Computer Science Principles (non-Java + non-OOP + non-HL + non-extended-response + non-IA-solution + non-case-study) + A-Level Computer Science (3-papers + non-Paper-3-pre-release-case-study + non-HL-extension + non-AI-ethics + non-IA-solution-development), IB Computer Science HL integrates computational-thinking + abstract-data-types + object-oriented-programming + algorithm-design + recursion + sorting + searching + graph-theory + trees + hash-tables + databases + networks + web-technologies + machine-learning + AI-ethics + HL-extension-topics across all topics + Paper 1 + Paper 2 + Paper 3 + IA-solution-development. The exam sits in May 2027 (Northern-Hemisphere-summer-sitting) + November 2026 (Southern-Hemisphere-summer-sitting). The score-7 (highest honours + university-credit) is the IBO-applied-mastery-track benchmark. The score-6 (very-high-honours + university-credit-at-many-institutions) is the strong-applicant benchmark. The score-5 (honours + IB-Diploma + university-readiness) is the cohort-wide-benchmark for CS + Software-Engineering + AI-ML + Data-Science + Cybersecurity + Computer-Engineering + Mathematics + Physics + Engineering + Year-13-CS + first-year-undergraduate-CS admissions at MIT + CMU + Stanford + Caltech + Berkeley + Georgia-Tech + UIUC + Michigan + Cornell + Princeton + Harvard + Yale + Columbia + Oxford + Cambridge + Imperial + UCL + Edinburgh + Manchester + Bristol + Warwick + KCL + Durham + Toronto + UBC + Waterloo + McGill + NUS + NTU + HKUST + KAIST + SNU + Tsinghua + Peking + IIT-Bombay + IIT-Delhi + IIT-Kanpur + IISc + ETH-Zurich + EPFL. This playbook gives the 30-week IB Computer Science HL workflow.

Section 2 — The 30-week IB Computer Science HL AI tutor study plan: weeks 1-4 = Topic 1 System fundamentals (systems + system-design + system-implementation + system-maintenance + planning + testing + evaluation + reliability + redundancy + backup + recovery + data-loss + data-integrity + data-validation + verification + validation), weeks 5-8 = Topic 2 Computer organisation (computer-architecture + CPU + ALU + CU + registers + primary-storage + cache + RAM + ROM + virtual-memory + secondary-storage + magnetic + optical + solid-state + cloud-storage + binary + hexadecimal + character-codes + ASCII + Unicode + UTF-8 + logic-gates + Boolean-algebra + logic-circuits + half-adder + full-adder + flip-flop + registers + memory + CPU-instruction-cycle + FDE-cycle + machine-code + assembly-language + high-level-language + compiler + interpreter + linker + loader), weeks 9-12 = Topic 3 Networks (networks + LAN + WAN + PAN + MAN + CAN + SAN + WLAN + topologies + star + ring + mesh + bus + hybrid + protocols + TCP/IP + UDP + HTTP + HTTPS + FTP + SMTP + POP3 + IMAP + DNS + DHCP + IP-addresses + IPv4 + IPv6 + subnet + MAC + packet-switching + circuit-switching + firewall + proxy + VPN + IDS + IPS + encryption + symmetric + asymmetric + RSA + AES + SSL + TLS + digital-signature + certificate + authentication + authorisation + cloud-computing + IaaS + PaaS + SaaS + edge-computing + fog-computing + IoT), weeks 13-16 = Topic 4 Computational thinking + Problem-solving + Algorithm-design (computational-thinking + abstraction + decomposition + pattern-recognition + algorithm-design + flowchart + pseudocode + trace-table + algorithm-efficiency + Big-O + time-complexity + space-complexity + sorting-algorithms + bubble-sort + insertion-sort + selection-sort + merge-sort + quicksort + heap-sort + counting-sort + radix-sort + searching-algorithms + linear-search + binary-search + hash-search + tree-search + recursion + recursive-algorithm + base-case + recursive-case + iterative-vs-recursive + backtracking + divide-and-conquer + dynamic-programming + memoisation + greedy-algorithm + Dijkstra + A-star + graph-algorithms + BFS + DFS + shortest-path + minimum-spanning-tree + tree-algorithms + binary-tree + BST + AVL + red-black + heap + priority-queue + hash-tables + collision-resolution + chaining + open-addressing), weeks 17-19 = Topic 5 Abstract data types + Programming (abstract-data-types + stack + queue + linked-list + doubly-linked-list + circular-linked-list + tree + binary-tree + graph + directed-graph + undirected-graph + weighted-graph + object-oriented-programming + class + object + attribute + method + constructor + destructor + encapsulation + inheritance + polymorphism + abstraction + interface + abstract-class + composition + aggregation + UML + class-diagram + object-diagram + sequence-diagram + use-case-diagram + state-diagram + activity-diagram + programming-paradigms + procedural + functional + object-oriented + logic + event-driven), weeks 20-22 = Topic 6 Databases + Web technologies (databases + relational-database + table + record + field + primary-key + foreign-key + composite-key + candidate-key + superkey + SQL + DDL + DML + DCL + SELECT + INSERT + UPDATE + DELETE + JOIN + INNER-JOIN + OUTER-JOIN + LEFT-JOIN + RIGHT-JOIN + subquery + view + index + transaction + ACID + normalisation + 1NF + 2NF + 3NF + BCNF + web-technologies + HTML + CSS + JavaScript + DOM + client-side + server-side + frontend + backend + full-stack + REST + API + JSON + XML + AJAX + CORS + cookies + session + token + JWT + OAuth + web-security + XSS + CSRF + SQL-injection), weeks 23-25 = Topic 7 Machine learning + AI ethics (machine-learning + supervised + unsupervised + reinforcement + classification + regression + clustering + neural-network + deep-learning + CNN + RNN + LSTM + transformer + GPT + LLM + computer-vision + NLP + feature-engineering + training-data + bias + variance + overfitting + underfitting + cross-validation + confusion-matrix + precision + recall + F1-score + AUC + ROC + AI-ethics + algorithmic-bias + data-privacy + GDPR + CCPA + transparency + explainability + accountability + fairness + safety + alignment + societal-impact), weeks 26-27 = Paper 3 pre-release-case-study mastery (the IBO releases a single case-study 6-8 weeks before the exam + the candidate must answer all questions about that case-study in Paper 3 — requires deep reading + technical analysis + algorithm design + code-implementation + extended-response + IB-command-terms + computational-thinking + OOP-design + database-design + network-design + web-design + AI-ethics-analysis), weeks 28-29 = IA Solution-Development (one-real-user + 30-hours + solution-development-cycle + planning + design + implementation + testing + evaluation + appendices + screenshots + code-listings + test-plans + user-feedback + interviews + 30-marks), week 30 = mock-exams + IBO-past-papers + polish

The 30-week IB Computer Science HL AI tutor workflow:

Weeks 1-4 — Topic 1 System fundamentals

• Systems thinking: components, interactions, emergent behaviour, feedback loops
• System design: requirements gathering, modular design, top-down vs bottom-up
• System implementation: coding standards, version control (Git), refactoring
• System maintenance: corrective, adaptive, perfective, preventive maintenance
• Planning: Gantt charts, milestones, critical path, PERT, project scheduling
• Testing: unit testing, integration testing, system testing, acceptance testing, black-box vs white-box
• Evaluation: success criteria, performance metrics, user feedback, iteration cycles
• Reliability: MTTF, MTBF, availability, fault tolerance, redundancy, fail-over
• Backup strategies: full, incremental, differential, 3-2-1 rule, off-site, cloud backup
• Data integrity: constraints, triggers, validation rules, referential integrity
• Data validation: range checks, type checks, format checks, lookup checks, presence checks
• Verification vs validation: are we building the product right vs are we building the right product

Weeks 5-8 — Topic 2 Computer organisation

• Computer architecture: von Neumann vs Harvard, CPU-ALU-CU-Registers-Memory-I/O
• CPU components: ALU (arithmetic logic unit), CU (control unit), registers (PC, MAR, MDR, ACC, IR)
• Primary storage: RAM (DRAM, SRAM), ROM (PROM, EPROM, EEPROM), cache (L1, L2, L3)
• Virtual memory: paging, segmentation, page tables, TLB, swap, thrashing
• Secondary storage: magnetic (HDD), optical (CD, DVD, Blu-ray), solid-state (SSD), NVMe
• Cloud storage: object storage (S3), block storage (EBS), file storage (EFS), cold storage
• Number systems: binary, octal, hexadecimal, denary, conversions, two's complement, BCD
• Character encoding: ASCII (7-bit), extended ASCII, Unicode, UTF-8, UTF-16, UTF-32, BOM
• Logic gates: AND, OR, NOT, NAND, NOR, XOR, XNOR, truth tables, logic expressions
• Boolean algebra: De Morgan's laws, distributive, commutative, associative, simplification
• Logic circuits: half-adder, full-adder, multiplexer, demultiplexer, encoder, decoder
• Flip-flops: SR, D, JK, T, latch, edge-triggered, level-triggered, registers, memory cells
• CPU instruction cycle: Fetch-Decode-Execute (FDE), instruction pipelining, clock speed
• Machine language vs assembly language vs high-level language: tradeoffs, portability, performance
• Translators: compiler (whole-program, slower, faster-execution), interpreter (line-by-line, slower-execution, easier-debugging), linker, loader, just-in-time (JIT)

Weeks 9-12 — Topic 3 Networks

• Network types: PAN, LAN, MAN, WAN, CAN, SAN, WLAN, VPN
• Network topologies: star, ring, mesh, bus, tree, hybrid, advantages, disadvantages
• Network protocols: TCP/IP (4-layer model), UDP, HTTP, HTTPS, FTP, SMTP, POP3, IMAP
• IP addressing: IPv4 (32-bit, 4-octet, classes A/B/C/D/E, subnet mask, CIDR), IPv6 (128-bit)
• DNS: domain-name-system, top-level-domain, recursive-resolver, authoritative-DNS-server
• DHCP: dynamic-host-configuration-protocol, IP-assignment, lease-time, scope
• Packet switching vs circuit switching: store-and-forward, latency, jitter, throughput
• Network security: firewall (stateful, stateless, WAF), proxy, IDS, IPS, VPN, NAT
• Encryption: symmetric (AES, DES, 3DES, ChaCha20), asymmetric (RSA, ECC, Diffie-Hellman)
• Hash functions: MD5, SHA-1, SHA-256, SHA-3, bcrypt, Argon2, salting, rainbow-table-attack
• SSL/TLS: handshake, certificate, public-key-infrastructure (PKI), CA, chain-of-trust
• Digital signatures: signing, verification, non-repudiation, hash + private-key
• Authentication vs authorisation: who you are vs what you can do, OAuth, JWT, SAML
• Cloud computing: IaaS, PaaS, SaaS, FaaS, serverless, edge, fog, CDN
• Internet of Things (IoT): sensors, actuators, embedded systems, MQTT, CoAP

Weeks 13-16 — Topic 4 Computational thinking + Problem-solving + Algorithm-design

• Computational thinking pillars: abstraction, decomposition, pattern-recognition, algorithm-design
• Algorithm representation: flowchart (ISO-standard symbols), pseudocode (IB-style), structured-English
• Trace tables: step-through-variable-tracking, dry-run, hand-execution
• Algorithm efficiency: Big-O notation (O(1), O(log n), O(n), O(n log n), O(n²), O(2ⁿ), O(n!))
• Time complexity vs space complexity: tradeoffs, in-place algorithms, aux-space
• Sorting algorithms: bubble (O(n²), stable, in-place), insertion (O(n²), stable, in-place), selection (O(n²), in-place), merge (O(n log n), stable, not-in-place), quicksort (O(n log n) avg, O(n²) worst, in-place, not-stable), heap (O(n log n), in-place, not-stable), counting (O(n+k), stable, not-in-place), radix (O(nk), stable)
• Searching algorithms: linear (O(n), unsorted), binary (O(log n), sorted), hash-table-search (O(1) avg, O(n) worst), tree-search (O(log n) balanced, O(n) unbalanced)
• Recursion: base case, recursive case, call stack, stack overflow, tail-recursion, recursion-tree
• Recursive vs iterative: readability, performance, stack-overflow risk, mutual-recursion
• Backtracking: N-Queens, Sudoku, maze-solving, permutation-generation
• Divide-and-conquer: merge-sort, quicksort, binary-search, closest-pair, Strassen's-matrix-multiplication
• Dynamic programming: memoisation, tabulation, optimal-substructure, overlapping-subproblems, Fibonacci, knapsack, longest-common-subsequence, edit-distance
• Greedy algorithms: Dijkstra's-shortest-path, Prim's-MST, Kruskal's-MST, Huffman-coding, activity-selection
• Graph algorithms: BFS (O(V+E), level-order, shortest-path-unweighted), DFS (O(V+E), topological-sort, cycle-detection, strongly-connected-components), Dijkstra (O((V+E) log V), shortest-path-weighted, non-negative-weights), A* (heuristic-guided-shortest-path), Bellman-Ford (O(VE), negative-weights-detection), Floyd-Warshall (O(V³), all-pairs-shortest-path), Prim's-MST (O(E log V)), Kruskal's-MST (O(E log E)), Kruskal-vs-Prim
• Tree algorithms: in-order-traversal, pre-order-traversal, post-order-traversal, level-order-traversal, BST-search (O(log n)), BST-insert (O(log n)), BST-delete (O(log n)), AVL-rotation (LL, RR, LR, RL), red-black-tree, heap-operations (insert O(log n), extract-min O(log n), heapify O(n))
• Hash tables: hash-function (modular, multiplication, cryptographic), collision-resolution (chaining, open-addressing with linear-probing, quadratic-probing, double-hashing), load-factor, rehashing

Weeks 17-19 — Topic 5 Abstract data types + Programming

• Abstract data types (ADTs): specification-only, implementation-independent, encapsulation-of-data-and-operations
• Stack ADT: LIFO, push, pop, peek, isEmpty, isFull, applications (call-stack, undo-redo, expression-evaluation, parenthesis-matching, DFS)
• Queue ADT: FIFO, enqueue, dequeue, front, rear, isEmpty, isFull, applications (BFS, scheduling, buffer, printer-queue)
• Priority queue ADT: enqueue-with-priority, dequeue-highest-priority, applications (Dijkstra, A*, scheduling, Huffman-coding)
• Linked list ADT: singly-linked-list, doubly-linked-list, circular-linked-list, head, tail, node, next, prev, insert, delete, traverse, search, applications (dynamic-memory, undo-redo, hash-chaining, adjacency-list)
• Tree ADT: root, child, parent, sibling, leaf, internal-node, depth, height, subtree, applications (BST, heap, B-tree, trie, syntax-tree, DOM-tree)
• Binary tree: at-most-2-children, full, complete, perfect, balanced, traversal-algorithms (in-order, pre-order, post-order, level-order), BST-property (left < root < right), AVL-tree (height-balanced, rotation), red-black-tree (self-balancing, color-property), heap (complete-binary-tree, heap-property, min-heap, max-heap)
• Graph ADT: vertex, edge, directed, undirected, weighted, unweighted, adjacency-matrix (O(V²) space), adjacency-list (O(V+E) space), operations (addVertex, addEdge, removeVertex, removeEdge, traverse, search), applications (social-network, road-network, web-graph, dependency-graph)
• Object-oriented programming (OOP): class (blueprint), object (instance), attribute (state), method (behaviour), constructor (init), destructor (cleanup), encapsulation (data-hiding, public-private-protected), inheritance (parent-child, superclass-subclass, is-a-relationship), polymorphism (overloading, overriding, dynamic-dispatch), abstraction (abstract-class, interface, pure-virtual), composition (has-a-relationship, stronger), aggregation (has-a-relationship, weaker)
• UML diagrams: class-diagram (class-name, attributes, methods, visibility), object-diagram (instance-state), sequence-diagram (object-interaction-over-time), use-case-diagram (actor-system-functionality), state-diagram (state-transition), activity-diagram (workflow), component-diagram, deployment-diagram
• Programming paradigms: procedural (top-down, functions, subroutines, C, Pascal), functional (immutable, first-class-functions, higher-order-functions, recursion, Haskell, Lisp, Clojure), object-oriented (classes, objects, inheritance, polymorphism, Java, C++, Python), logic (facts-rules-queries, Prolog), event-driven (event-handlers, GUI, JavaScript, React), declarative (what-not-how, SQL, HTML, CSS)

Weeks 20-22 — Topic 6 Databases + Web technologies

• Database concepts: database, DBMS, relational-model, table, record, row, tuple, field, column, attribute, primary-key, foreign-key, candidate-key, alternate-key, composite-key, superkey, schema, instance
• SQL DDL: CREATE DATABASE, CREATE TABLE, ALTER TABLE, DROP TABLE, CREATE INDEX, DROP INDEX, CREATE VIEW, DROP VIEW, constraints (PRIMARY KEY, FOREIGN KEY, UNIQUE, NOT NULL, CHECK, DEFAULT)
• SQL DML: SELECT, INSERT, UPDATE, DELETE, WHERE, ORDER BY, GROUP BY, HAVING, LIMIT, DISTINCT, LIKE, IN, BETWEEN, IS NULL, EXISTS, ANY, ALL
• SQL JOINs: INNER JOIN (matching-rows-both-tables), LEFT OUTER JOIN (all-left + matching-right), RIGHT OUTER JOIN (all-right + matching-left), FULL OUTER JOIN (all-rows-both-sides), CROSS JOIN (cartesian-product), SELF JOIN (table-joined-with-itself), NATURAL JOIN (auto-match-same-column-name)
• Subqueries: scalar-subquery, multi-row-subquery, multi-column-subquery, correlated-subquery, EXISTS, NOT EXISTS, IN, NOT IN, ANY, ALL, derived-table, CTE (WITH-clause)
• View: virtual-table, named-query, updatable-view, non-updatable-view, materialized-view, WITH CHECK OPTION
• Index: B-tree-index, hash-index, clustered-vs-non-clustered, composite-index, covering-index, index-scan-vs-table-scan, tradeoffs (read-speed vs write-speed vs storage-space)
• Transaction: ACID-properties (Atomicity-Consistency-Isolation-Durability), commit, rollback, savepoint, deadlock, concurrency-control, lock (shared, exclusive, two-phase-locking), isolation-level (read-uncommitted, read-committed, repeatable-read, serializable)
• Normalisation: 1NF (atomic-values-no-repeating-groups), 2NF (1NF + no-partial-dependency), 3NF (2NF + no-transitive-dependency), BCNF (3NF + every-determinant-is-candidate-key), 4NF (BCNF + no-multi-valued-dependency), denormalisation (performance-tradeoff)
• Web technologies: HTML5 (semantic-tags, forms, media, canvas, SVG), CSS3 (selectors, box-model, flexbox, grid, animations, responsive-design, media-queries), JavaScript (ES6+, DOM-manipulation, event-handling, async-await, promises, fetch-API, modules, classes, arrow-functions, template-literals)
• Client-side vs server-side: client (browser, JavaScript, React, Vue, Angular), server (Node.js, Python-Django, Ruby-on-Rails, Java-Spring, PHP-Laravel), full-stack (MERN, MEAN, LAMP, JAMstack)
• REST API: GET, POST, PUT, PATCH, DELETE, idempotency, stateless, resource, URI, HTTP-status-codes (200, 201, 204, 400, 401, 403, 404, 409, 500)
• Data formats: JSON (JavaScript-Object-Notation, key-value-pairs, arrays, nested), XML (eXtensible-Markup-Language, tags-attributes-text-content, schema, XSLT, XPath), YAML, CSV
• AJAX: Asynchronous-JavaScript-And-XML, fetch-API, XMLHttpRequest, async-await, promises, callback-hell, CORS (Cross-Origin-Resource-Sharing)
• Web security: XSS (Cross-Site-Scripting, stored-reflected-DOM-based, sanitization, Content-Security-Policy), CSRF (Cross-Site-Request-Forgery, CSRF-token, SameSite-cookie), SQL-injection (parameterised-queries, prepared-statements, input-validation), session-hijacking, clickjacking
• Authentication vs authorisation: authentication (verify-identity, password, 2FA, MFA, biometric, OAuth, JWT), authorisation (verify-permissions, RBAC, ABAC, ACL)

Weeks 23-25 — Topic 7 Machine learning + AI ethics

• Machine learning paradigms: supervised (labelled-data, classification + regression), unsupervised (unlabelled-data, clustering + dimensionality-reduction + association-rule), reinforcement (agent-environment-reward-policy), semi-supervised, self-supervised
• Classification algorithms: K-Nearest-Neighbours (KNN, distance-metric, k-choice, lazy-learner), decision-tree (ID3, C4.5, CART, entropy, information-gain, Gini-index, pruning), naive-Bayes (Bayes-theorem, conditional-independence-assumption, Laplace-smoothing), support-vector-machine (SVM, hyperplane, margin, kernel-trick, linear-non-linear), logistic-regression (sigmoid-function, cross-entropy-loss, gradient-descent), random-forest (ensemble-bagging, multiple-decision-trees, voting), gradient-boosting (XGBoost, LightGBM, sequential-trees), neural-network (perceptron, multi-layer-perceptron, backpropagation, activation-function)
• Regression algorithms: linear-regression (least-squares, gradient-descent, normal-equation), polynomial-regression, ridge-regression (L2-regularisation), lasso-regression (L1-regularisation), support-vector-regression (SVR)
• Clustering algorithms: K-means (centroid-based, k-choice, elbow-method, iterative), hierarchical (agglomerative, divisive, dendrogram), DBSCAN (density-based, epsilon, min-points, outliers)
• Dimensionality reduction: PCA (Principal-Component-Analysis, eigenvectors, eigenvalues, variance-preservation), t-SNE (t-distributed-stochastic-neighbour-embedding, visualisation), LDA (Linear-Discriminant-Analysis, supervised)
• Neural networks: perceptron, multi-layer-perceptron (MLP, feedforward, backpropagation), activation-function (sigmoid, tanh, ReLU, Leaky-ReLU, softmax), loss-function (mean-squared-error, cross-entropy, hinge), optimiser (SGD, Adam, RMSprop), epoch, batch-size, learning-rate
• Deep learning: CNN (Convolutional-Neural-Network, convolution, pooling, fully-connected, image-classification), RNN (Recurrent-Neural-Network, hidden-state, sequence-modelling), LSTM (Long-Short-Term-Memory, gate-mechanisms, vanishing-gradient), GRU (Gated-Recurrent-Unit), transformer (self-attention, multi-head-attention, positional-encoding), GPT (Generative-Pre-trained-Transformer, autoregressive), BERT (Bidirectional-Encoder-Representations-from-Transformers, masked-language-modelling), LLM (Large-Language-Model, emergent-abilities)
• Computer vision: image-classification, object-detection (YOLO, R-CNN, SSD), semantic-segmentation, instance-segmentation, facial-recognition, optical-character-recognition (OCR), image-generation (GAN, diffusion, stable-diffusion)
• NLP (Natural-Language-Processing): tokenisation, stemming, lemmatisation, stop-words, bag-of-words, TF-IDF, word2vec, GloVe, BERT, GPT, sentiment-analysis, named-entity-recognition (NER), machine-translation, text-summarisation, question-answering, chatbots, RAG (Retrieval-Augmented-Generation)
• Feature engineering: feature-selection (filter, wrapper, embedded), feature-extraction (PCA, autoencoder), feature-scaling (standardisation, normalisation, min-max), feature-creation (polynomial, interaction, datetime-extraction)
• Model evaluation: confusion-matrix (TP, TN, FP, FN), precision (TP/(TP+FP)), recall (TP/(TP+FN)), F1-score (2precisionrecall/(precision+recall)), accuracy ((TP+TN)/(TP+TN+FP+FN)), AUC-ROC (Area-Under-Curve-Receiver-Operating-Characteristic), AUC-PR, cross-validation (k-fold, stratified-k-fold, leave-one-out), bias-variance-tradeoff, overfitting-vs-underfitting, learning-curves, validation-curves
• AI ethics: algorithmic-bias (training-data-bias, historical-bias, representation-bias, evaluation-bias, deployment-bias), data-privacy (GDPR, CCPA, right-to-be-forgotten, consent, anonymisation, pseudonymisation, differential-privacy), transparency (model-interpretability, explainable-AI (XAI), LIME, SHAP), accountability (audit-trail, model-cards, datasheets-for-datasets), fairness (group-fairness, individual-fairness, equalised-odds, demographic-parity), safety (alignment, robustness, adversarial-attacks, adversarial-defence, red-teaming), societal-impact (job-displacement, misinformation, deepfakes, election-integrity, AI-regulation-EU-AI-Act-US-Executive-Order)

Weeks 26-27 — Paper 3 pre-release-case-study mastery

• The IBO releases ONE single case-study 6-8 weeks before the exam covering ALL HL topics (computational-thinking + abstract-data-types + OOP + algorithm-design + recursion + sorting + searching + graph + tree + database + network + web + machine-learning + AI-ethics)
• Candidate must answer all questions in 1-hour Paper 3 about that case-study
• Requires deep reading + technical analysis + algorithm design + code-implementation + extended-response + IB-command-terms + computational-thinking + OOP-design + database-design (SQL) + network-design + web-design + AI-ethics-analysis
• Practice: every IBO-past-paper-2016-to-2025 + TZ1-TZ2-TZ3-papers + specimen-papers + mark-scheme-analysis

Weeks 28-29 — Internal Assessment (IA) Solution-Development

• ONE real user with a real problem
• 30 hours of documented work
• Solution-development-cycle: planning (success-criteria, requirements, design) → implementation (code, OOP-design, algorithm) → testing (test-plan, test-data, evidence, screenshots) → evaluation (user-feedback, strengths, limitations, improvements)
• Appendices: code-listings, test-plans, test-results, screenshots, user-interview-transcripts, planning-document
• 30 marks total: planning (5), design (5), implementation (10), testing (5), evaluation (5)

Week 30 — Mock exams + IBO past papers + polish

• Full mock Paper 1 (1h 30m, 50 marks, 30%)
• Full mock Paper 2 (2h, 60 marks, 30%)
• Full mock Paper 3 pre-release (1h, 40 marks, 20%)
• IA solution final review + submission
• Mark-scheme-analysis + band-descriptor-mapping
• Final polish: weak topics, common mistakes, time-management

Section 3 — The IB Computer Science HL competency framework: 80 competencies across 7 topics + HL-extension + Paper-1-short-response + Paper-2-extended-response + Paper-3-pre-release-case-study + IA-solution

The IB Computer Science HL competency framework:

Topic 1 — System fundamentals (12 competencies)

• C1.1 Identify context-appropriate system-design methodologies (waterfall, agile, iterative, spiral)
• C1.2 Construct Gantt charts + PERT diagrams + critical-path analysis for project scheduling
• C1.3 Apply the planning phase: requirements-gathering (functional + non-functional + user-stories + use-cases)
• C1.4 Apply the design phase: modular-design (high-cohesion + low-coupling) + UML (class + sequence + use-case + state + activity)
• C1.5 Apply the implementation phase: coding-standards + version-control (Git + branches + commits + pull-requests) + refactoring
• C1.6 Apply the testing phase: unit-testing + integration-testing + system-testing + acceptance-testing + black-box + white-box + test-coverage
• C1.7 Apply the evaluation phase: success-criteria-evaluation + performance-metrics + user-feedback + iteration
• C1.8 Distinguish reliability-attributes: MTTF + MTBF + availability + fault-tolerance + redundancy + fail-over
• C1.9 Construct backup-strategies: full + incremental + differential + 3-2-1-rule + off-site + cloud-backup + recovery-time-objective (RTO) + recovery-point-objective (RPO)
• C1.10 Apply data-integrity-practices: constraints + triggers + validation-rules + referential-integrity + cascading
• C1.11 Distinguish data-validation-types: range + type + format + lookup + presence + check-digit + cross-field
• C1.12 Apply verification-vs-validation: are-we-building-the-product-right vs are-we-building-the-right-product

Topic 2 — Computer organisation (14 competencies)

• C2.1 Distinguish von-Neumann-vs-Harvard-architecture (single-vs-separate-memory-for-instructions-and-data)
• C2.2 Describe CPU-components: ALU + CU + registers (PC + MAR + MDR + ACC + IR) + cache + clock
• C2.3 Distinguish primary-storage-types: RAM (DRAM + SRAM) + ROM (PROM + EPROM + EEPROM) + cache (L1 + L2 + L3) + registers + virtual-memory (paging + segmentation + TLB + swap + thrashing)
• C2.4 Distinguish secondary-storage-types: magnetic (HDD) + optical (CD + DVD + Blu-ray) + solid-state (SSD + NVMe) + cloud-storage (object + block + file + cold)
• C2.5 Apply number-system-conversions: binary + octal + hexadecimal + denary + two's-complement + BCD + floating-point (IEEE-754)
• C2.6 Apply character-encoding: ASCII (7-bit) + extended-ASCII + Unicode + UTF-8 + UTF-16 + UTF-32 + BOM + endianness
• C2.7 Construct logic-circuits: AND + OR + NOT + NAND + NOR + XOR + XNOR + truth-tables + Boolean-expressions + simplification (Karnaugh-maps + Quine-McCluskey)
• C2.8 Construct combinational-circuits: half-adder + full-adder + multiplexer + demultiplexer + encoder + decoder + 7-segment-display
• C2.9 Construct sequential-circuits: SR-flip-flop + D-flip-flop + JK-flip-flop + T-flip-flop + register + memory-cell + shift-register + counter
• C2.10 Trace CPU-instruction-cycle: Fetch-Decode-Execute (FDE) + instruction-pipelining + clock-speed + cycles-per-instruction (CPI)
• C2.11 Distinguish machine-language-vs-assembly-language-vs-high-level-language: binary-instructions + mnemonic-codes + portability + abstraction-level
• C2.12 Distinguish compiler-vs-interpreter: whole-program-translation vs line-by-line + execution-speed + error-detection + portability + JIT
• C2.13 Apply linking-and-loading: linker-resolves-symbols + loader-loads-into-memory + static-linking + dynamic-linking + shared-libraries
• C2.14 Evaluate performance: clock-speed + cores + cache-size + memory-bandwidth + I/O-performance + benchmarks

Topic 3 — Networks (12 competencies)

• C3.1 Distinguish network-types: PAN + LAN + MAN + WAN + CAN + SAN + WLAN + VPN + intranet + extranet + internet
• C3.2 Construct network-topologies: star + ring + mesh + bus + tree + hybrid + advantages + disadvantages + fault-tolerance
• C3.3 Apply the TCP/IP-protocol-suite: 4-layer-model (Application + Transport + Internet + Link) + TCP-vs-UDP
• C3.4 Apply application-layer-protocols: HTTP + HTTPS + FTP + SMTP + POP3 + IMAP + DNS + DHCP
• C3.5 Construct IP-addressing: IPv4 (32-bit + CIDR + subnet-mask + classes) + IPv6 (128-bit + hexadecimal + scope)
• C3.6 Apply subnetting: subnet-mask-calculation + network-address + broadcast-address + host-range + CIDR-notation
• C3.7 Distinguish packet-switching-vs-circuit-switching: store-and-forward + latency + jitter + throughput + bandwidth
• C3.8 Apply network-security: firewall (stateful + stateless + WAF) + proxy + IDS + IPS + VPN + NAT + DMZ
• C3.9 Apply encryption-techniques: symmetric (AES + DES + 3DES + ChaCha20) + asymmetric (RSA + ECC + Diffie-Hellman) + hybrid-encryption
• C3.10 Apply hash-functions: MD5 + SHA-1 + SHA-256 + SHA-3 + bcrypt + Argon2 + salting + rainbow-table-attack
• C3.11 Apply SSL/TLS-handshake: certificate-verification + PKI + CA + chain-of-trust + encryption-negotiation
• C3.12 Apply digital-signatures: signing + verification + non-repudiation + hash + private-key + certificate

Topic 4 — Computational thinking + Problem-solving + Algorithm-design (14 competencies)

• C4.1 Apply computational-thinking-pillars: abstraction + decomposition + pattern-recognition + algorithm-design
• C4.2 Construct algorithm-representations: flowchart (ISO-symbols) + pseudocode (IB-style) + structured-English
• C4.3 Apply trace-tables: step-through-variable-tracking + dry-run + hand-execution + output-prediction
• C4.4 Apply Big-O-notation: O(1) + O(log n) + O(n) + O(n log n) + O(n²) + O(2ⁿ) + O(n!) + time-vs-space-tradeoff
• C4.5 Implement sorting-algorithms: bubble + insertion + selection + merge + quicksort + heap + counting + radix
• C4.6 Implement searching-algorithms: linear + binary + hash-table-search + tree-search
• C4.7 Apply recursion: base-case + recursive-case + call-stack + stack-overflow + tail-recursion + recursion-tree
• C4.8 Distinguish recursive-vs-iterative: readability + performance + stack-overflow-risk + mutual-recursion
• C4.9 Apply backtracking-techniques: N-Queens + Sudoku + maze-solving + permutation-generation
• C4.10 Apply divide-and-conquer: merge-sort + quicksort + binary-search + closest-pair + Strassen's-matrix-multiplication
• C4.11 Apply dynamic-programming: memoisation + tabulation + optimal-substructure + overlapping-subproblems
• C4.12 Apply greedy-algorithms: Dijkstra + Prim + Kruskal + Huffman-coding + activity-selection
• C4.13 Implement graph-algorithms: BFS + DFS + Dijkstra + A* + Bellman-Ford + Floyd-Warshall + Prim + Kruskal
• C4.14 Implement tree-algorithms: in-order + pre-order + post-order + level-order + BST + AVL + heap + priority-queue

Topic 5 — Abstract data types + Programming (10 competencies)

• C5.1 Specify stack-ADT: LIFO + push + pop + peek + isEmpty + isFull + applications
• C5.2 Specify queue-ADT: FIFO + enqueue + dequeue + front + rear + isEmpty + isFull + applications
• C5.3 Specify linked-list-ADT: singly + doubly + circular + head + tail + node + next + prev + insert + delete + traverse
• C5.4 Specify tree-ADT: root + child + parent + sibling + leaf + depth + height + subtree
• C5.5 Specify binary-tree: full + complete + perfect + balanced + traversal + BST-property + AVL-rotation
• C5.6 Specify graph-ADT: vertex + edge + directed + undirected + weighted + adjacency-matrix + adjacency-list
• C5.7 Apply OOP-principles: class + object + attribute + method + constructor + encapsulation + inheritance + polymorphism + abstraction + composition + aggregation
• C5.8 Construct UML-diagrams: class-diagram + object-diagram + sequence-diagram + use-case-diagram + state-diagram + activity-diagram
• C5.9 Distinguish programming-paradigms: procedural + functional + OOP + logic + event-driven + declarative
• C5.10 Apply hash-tables: hash-function + collision-resolution (chaining + open-addressing) + load-factor + rehashing

Topic 6 — Databases + Web technologies (10 competencies)

• C6.1 Construct relational-databases: table + record + field + primary-key + foreign-key + composite-key + candidate-key
• C6.2 Apply SQL-DDL: CREATE + ALTER + DROP + constraints (PRIMARY-KEY + FOREIGN-KEY + UNIQUE + NOT-NULL + CHECK + DEFAULT)
• C6.3 Apply SQL-DML: SELECT + INSERT + UPDATE + DELETE + WHERE + ORDER-BY + GROUP-BY + HAVING + LIMIT + DISTINCT
• C6.4 Apply SQL-JOINs: INNER + LEFT + RIGHT + FULL + CROSS + SELF + NATURAL
• C6.5 Apply subqueries: scalar + multi-row + multi-column + correlated + EXISTS + IN + CTE
• C6.6 Apply views-and-indexes: virtual-table + materialized-view + B-tree-index + hash-index + clustered-vs-non-clustered
• C6.7 Apply transactions: ACID + commit + rollback + savepoint + concurrency-control + locking + isolation-level
• C6.8 Apply normalisation: 1NF + 2NF + 3NF + BCNF + 4NF + denormalisation
• C6.9 Construct web-pages: HTML5 (semantic-tags + forms + canvas + SVG) + CSS3 (flexbox + grid + animations + media-queries)
• C6.10 Construct web-applications: JavaScript (ES6+ + DOM + async-await + fetch + modules) + REST-API (GET + POST + PUT + DELETE) + JSON + AJAX + CORS + web-security (XSS + CSRF + SQL-injection)

Topic 7 — Machine learning + AI ethics (8 competencies)

• C7.1 Distinguish ML-paradigms: supervised + unsupervised + reinforcement + semi-supervised + self-supervised
• C7.2 Apply classification-algorithms: KNN + decision-tree + naive-Bayes + SVM + logistic-regression + random-forest + gradient-boosting + neural-network
• C7.3 Apply regression-algorithms: linear + polynomial + ridge + lasso + SVR
• C7.4 Apply clustering-algorithms: K-means + hierarchical + DBSCAN
• C7.5 Apply dimensionality-reduction: PCA + t-SNE + LDA
• C7.6 Construct neural-networks: perceptron + MLP + activation-function + loss-function + optimiser + backpropagation
• C7.7 Distinguish deep-learning-architectures: CNN + RNN + LSTM + transformer + GPT + BERT + LLM
• C7.8 Apply AI-ethics: algorithmic-bias + data-privacy + transparency + accountability + fairness + safety + societal-impact

Section 4 — The AI tutor prompt library: 30 system prompts for Paper 1 + Paper 2 + Paper 3 + IA + HL-extension + AI ethics

The IB Computer Science HL AI tutor prompt library (paste these into the AI tutor chat):

Prompt 1 — IB Computer Science HL Paper 1 short-response diagnostic

"I'm a Year-12 IB Computer Science HL student. For Paper 1 (short-response, 1h 30m, 50 marks), walk me through: (1) computational thinking + problem-solving + algorithm design, (2) abstract data types, (3) programming fundamentals + OOP, (4) machine learning + AI ethics. Score every short-answer response 0-7 against the IBO band descriptors (Band 1 Inadequate → Band 7 Outstanding). Surface my weakest subtopic in real-time."

Prompt 2 — IB Computer Science HL Paper 2 extended-response grader

"I'm a Year-13 IB Computer Science HL student. For Paper 2 (extended-response, 2h, 60 marks), walk me through: (1) algorithm design + pseudocode + trace tables, (2) OOP class design + UML, (3) database design + SQL, (4) network design + protocols, (5) web application design + HTML/CSS/JS, (6) machine learning + AI ethics. Score every extended-response against the IBO band descriptors. Identify my single biggest gap (e.g., recursion vs Big-O vs OOP vs SQL vs network vs web vs AI-ethics) and rewrite my response to a Band 6-7 exemplar."

Prompt 3 — IB Computer Science HL Paper 3 pre-release-case-study tutor

"I'm a Year-13 IB Computer Science HL student. The IBO pre-release-case-study for May 2027 covers [insert case-study]. Walk me through ALL questions in 1-hour. For each question: (1) read the case-study-excerpt carefully, (2) identify the technical-topic (computational-thinking + ADTs + OOP + algorithm-design + recursion + sorting + searching + graph + tree + database + network + web + ML + AI-ethics), (3) construct the answer (algorithm + pseudocode + code + SQL + diagram + extended-response), (4) score my answer 0-7 against the IBO band descriptors, (5) rewrite to Band 6-7."

Prompt 4 — IB Computer Science HL Internal Assessment solution-development mentor

"I'm a Year-13 IB Computer Science HL student starting my IA solution-development. The IA requires: ONE real user with a real problem + 30 hours of documented work + solution-development-cycle (planning + design + implementation + testing + evaluation) + 30 marks + appendices (code-listings + test-plans + screenshots + user-interview-transcripts). Help me: (1) identify a real-user + real-problem (worth 5 marks for Planning), (2) write the success-criteria + requirements + design (worth 5 marks for Design), (3) implement the solution in Java/Python/C++ (worth 10 marks for Implementation), (4) write the test-plan + test-data + test-results (worth 5 marks for Testing), (5) gather user-feedback + evaluate (worth 5 marks for Evaluation)."

Prompt 5 — IB Computer Science HL HL-extension master

"I'm a Year-13 IB Computer Science HL student. The HL-extension-topics are: Abstract-Data-Types + Linked-Lists + Binary-Trees + Hash-Tables + Graphs + Object-Oriented-Programming + Recursion + Algorithm-Design + Sorting + Searching + Dynamic-Programming + Graph-Algorithms + Computational-Thinking + Databases + Networks + Web-Technologies + Machine-Learning + AI-Ethics. For each topic, give me: (1) the deepest concept, (2) a Band-7 exemplar answer, (3) the 5 common mistakes IB candidates make, (4) the IB mark-scheme keywords."

Prompt 6 — IB Computer Science HL algorithm-trace + Big-O analyzer

"For any IB Computer Science HL Paper 2 algorithm question: (1) trace the algorithm step-by-step using a trace table, (2) determine the time complexity in Big-O notation, (3) determine the space complexity, (4) compare with alternative algorithms (e.g., bubble vs merge vs quicksort), (5) identify when this algorithm is the right choice."

Prompt 7 — IB Computer Science HL OOP class-design tutor

"For any IB Computer Science HL Paper 2 OOP question: (1) identify the classes + attributes + methods + relationships (inheritance vs composition vs aggregation), (2) construct the UML class diagram, (3) write the constructor + key methods, (4) identify polymorphism opportunities, (5) score against the IBO band descriptors."

Prompt 8 — IB Computer Science HL SQL query builder

"For any IB Computer Science HL Paper 2 SQL question: (1) parse the natural-language-question, (2) identify the tables + joins + conditions, (3) write the SQL query using SELECT + FROM + JOIN + WHERE + GROUP BY + HAVING + ORDER BY + LIMIT, (4) trace the query execution, (5) optimize with indexes if needed."

Prompt 9 — IB Computer Science HL network-protocol analyzer

"For any IB Computer Science HL Paper 2 network question: (1) identify the protocol (TCP/IP + HTTP + HTTPS + FTP + SMTP + DNS + DHCP), (2) explain the protocol layers (Application + Transport + Internet + Link), (3) trace a packet through the network, (4) identify security implications (encryption + authentication + firewall), (5) score against the IBO band descriptors."

Prompt 10 — IB Computer Science HL AI-ethics essay grader

"For any IB Computer Science HL Paper 2 + Paper 3 AI-ethics question: (1) identify the ethical-issue (algorithmic-bias + data-privacy + transparency + accountability + fairness + safety + societal-impact), (2) provide a balanced argument with stakeholders + tradeoffs, (3) cite real-world examples, (4) propose specific mitigations, (5) reference the EU AI Act + GDPR + IEEE Ethically Aligned Design."

Prompts 11-30 continue with: recursion-tutor, sorting-algorithm-implementer, searching-algorithm-implementer, graph-algorithm-tutor, tree-algorithm-tutor, hash-table-implementer, UML-diagram-grader, web-application-designer, REST-API-designer, JSON-schema-builder, HTML-CSS-JS-tutor, machine-learning-model-selector, neural-network-architect, deep-learning-explainer, computer-vision-tutor, NLP-tutor, AI-bias-auditor, GDPR-compliance-checker, case-study-analyzer, mock-exam-grader.

Section 5 — The 5-to-7 gap: why most IB Computer Science HL candidates plateau at score 5

Most IB Computer Science HL candidates plateau at score 5 because:

Gap 1 — Computational thinking + problem-solving + algorithm design fluency. Score-5 candidates can write bubble-sort + linear-search + recursion, but cannot do dynamic-programming + graph-algorithms + greedy-algorithms. The AI tutor forces fluency in all 14 C4.x competencies.

Gap 2 — OOP class-design + UML fluency. Score-5 candidates understand encapsulation + inheritance + polymorphism in theory, but cannot design a multi-class system with proper UML diagrams. The AI tutor forces OOP-design fluency across Paper 2 + IA.

Gap 3 — SQL + database-design fluency. Score-5 candidates understand basic SELECT + INSERT + UPDATE + DELETE, but cannot do complex JOINs + subqueries + transactions + normalisation. The AI tutor forces SQL fluency to Band 6-7 level.

Gap 4 — Network + web-technology fluency. Score-5 candidates understand TCP/IP in theory, but cannot trace a packet through a network, design a REST API, or secure a web application. The AI tutor forces network + web fluency.

Gap 5 — Machine-learning + AI-ethics fluency. Score-5 candidates understand ML in theory, but cannot select the right algorithm, interpret confusion-matrices, or write a balanced AI-ethics essay. The AI tutor forces ML + AI-ethics fluency.

Gap 6 — IA solution-development quality. Score-5 IAs are typically a CRUD app with no real user + no rigorous testing + no evaluation. The AI tutor forces a real-user + real-problem + 30-hours + rigorous testing + thorough evaluation.

Gap 7 — Paper 3 pre-release-case-study preparation. Score-5 candidates under-prepare for Paper 3 because it's pre-release + unpredictable. The AI tutor forces deep preparation across all HL topics.

Section 6 — The IB Computer Science HL study schedule: 30-week workflow + 7-day exam-week plan + post-exam workflow

7-day exam-week plan:

• Day -7 (7 days before): Final IA submission review + submit via IBIS
• Day -6 to -3: Paper 3 pre-release-case-study drill (4 hours/day, all IBO past papers)
• Day -2: Paper 2 algorithm + OOP + database + network + web + ML + AI-ethics drill
• Day -1: Paper 1 short-response drill + rest
• Day 0 (Paper 1): 1h 30m exam + immediate self-grade against mark scheme
• Day 1 (Paper 2): 2h exam + immediate self-grade against mark scheme
• Day 2 (Paper 3): 1h exam + immediate self-grade against mark scheme

Post-exam workflow:

• Day 1 post-exam: Submit IA solution-development (already done)
• Day 2-7: Score-prediction (using AI tutor + IBO band descriptors)
• Day 8-14: Begin next-year IB Computer Science HL cohort preparation (if teacher)

Section 7 — The IB Computer Science HL teacher dashboard: how AI tutor integrates

The AI tutor integrates with the IB Computer Science HL teacher dashboard:

• Real-time band-descriptor scoring: every student response scored 0-7 against the IBO band descriptors in real-time
• IB mark-scheme alignment: every prompt aligned to the official IBO mark scheme
• Gap analysis: identify the single biggest competency gap per student per topic
• IA solution-development tracker: track Planning + Design + Implementation + Testing + Evaluation across the cohort
• Paper 3 pre-release-case-study prep: cohort-wide drill + score distribution
• Mock exam analytics: per-topic per-student score distribution + class-level insights

Section 8 — Closing: how to start with the AI tutor

To start with the IB Computer Science HL AI tutor:

1. Go to grademy.work
2. Sign up as a Year-12 or Year-13 student
3. Select IB Computer Science HL
4. Paste Prompt 1 (Paper 1 diagnostic) into the AI tutor chat
5. Work through Paper 1 → Paper 2 → Paper 3 → IA → HL-extension systematically
6. Track your band-descriptor scores across all 80 competencies
7. Submit your IA solution-development by Day -7
8. Score a 7 on the May 2027 exam

The IB Computer Science HL playbook closes the 5-to-7 gap. The AI tutor is the fastest path to score-7 mastery.

Pairs with IB Design Technology HL (post-166)

The IB Design Technology HL playbook (post-166) + [this playbook] form the IB Diploma + IB Higher-Level + IBO-applied-track + Year-13-design + first-year-undergraduate-Engineering + Architecture + Industrial-Design + Product-Design + UX-Design + Mechanical-Engineering + Materials-Engineering + Manufacturing-Engineering + Civil-Engineering + Structural-Engineering + Aerospace-Engineering + Automotive-Engineering pair for the IB-Diploma-Programme Year-12 + Year-13 candidates + IB-Bilingual + IB-Course-Companion + Pre-Engineering + Pre-Architecture + Pre-Industrial-Design + Pre-Product-Design + Pre-UX-Design + Pre-Mechanical-Engineering + Pre-Materials-Engineering + Pre-Manufacturing-Engineering + Pre-Civil-Engineering + Pre-Structural-Engineering + Pre-Aerospace-Engineering + Pre-Automotive-Engineering cohorts at IB-World-Schools in Switzerland + Singapore + Hong-Kong + UAE + UK + US + Canada + Australia + New-Zealand + Japan + Korea + China + India + Pakistan + Bangladesh + Indonesia + Malaysia + Thailand + Vietnam + Philippines + Egypt + South-Africa + Kenya + Nigeria + Ghana + Saudi + Qatar + Bahrain + Kuwait + Oman + Jordan + Lebanon + Brazil + Mexico + Argentina + Chile + Colombia + Peru + Russia + Turkey + Iran + Iraq + Israel targeting MIT + Stanford + Caltech + RCA + Imperial + Cambridge + Oxford + Central-Saint-Martins + Architectural-Association + RISD + Parsons + Pratt + Cooper-Union + Bauhaus + TU-Munich + ETH-Zurich + EPFL + Delft + TU-Eindhoven + Politecnico-Milano + Aalto admissions. The IB Design Technology HL 6-core-topics (Design-Fundamentals + Resource-Analysis + Ideation + Evaluation + Sustainable-Production + Marketing-Design-Outputs) + 4-HL-extension-topics (User-Centred-Design + Innovation-Design + Materials-Engineering + CAD-CAM-Rapid-Manufacturing) + 2-Paper-structure (Paper-1-core + Paper-2-HL-extension) + Internal-Assessment-Design-Project + IB-Command-Terms (Define + Describe + Explain + Outline + State + Annotate + Calculate + Compare + Contrast + Discuss + Evaluate + Examine + Justify + Recommend + Suggest + To-what-extent) + 52-mark-IA-criterion-rubric covers everything the IB-World-School-cohort needs to bridge Year-12 + Year-13-design + IB-Diploma + IBO-applied-mastery-track + first-year-undergraduate-Engineering + Architecture + Industrial-Design + Product-Design + UX-Design + Mechanical-Engineering + Materials-Engineering + Manufacturing-Engineering + first-year-undergraduate-Design + university-credit + Applied-Admissions-readiness at MIT + Stanford + Caltech + RCA + Imperial + Cambridge + Oxford + Central-Saint-Martins + Architectural-Association + RISD + Parsons + Pratt + Cooper-Union + Bauhaus + TU-Munich + ETH-Zurich + EPFL + Delft + TU-Eindhoven + Politecnico-Milano + Aalto + NUS + NTU + HKUST + KAIST + UCL + Edinburgh + Manchester + Bristol + Durham + KCL admissions. See post-166 for the IB-Design-Technology-HL-specific exam, score-distribution, and 30-week score-7 master schedule.

Pairs with IB Sports Exercise and Health Science SL (post-167)

The IB Sports Exercise and Health Science SL playbook (post-167) + [this playbook] form the IB Diploma + IB Standard-Level + IB Group-4 + IBO-applied-sports-science-track + Year-13-sports-science + first-year-undergraduate-Sports-Science + Sport-Medicine + Sport-Psychology + Sport-Sociology + Sport-Physiotherapy + Sport-Nutrition + Exercise-Physiology + Health-Sciences + Medicine + Biomedical-Science + Public-Health + Physical-Therapy + Nursing + Kinesiology pair for the IB-Diploma-Programme Year-12 + Year-13 candidates + IB-Bilingual + IB-Course-Companion + Pre-Sports-Science + Pre-Sport-Medicine + Pre-Sport-Psychology + Pre-Physiotherapy + Pre-Sport-Nutrition + Pre-Exercise-Physiology + Pre-Health-Sciences + Pre-Medicine + Pre-Biomedical-Science + Pre-Public-Health + Pre-Physical-Therapy + Pre-Nursing + Pre-Kinesiology cohorts at IB-World-Schools in Switzerland + Singapore + Hong-Kong + UAE + UK + US + Canada + Australia + New-Zealand + Japan + Korea + China + India + Pakistan + Bangladesh + Indonesia + Malaysia + Thailand + Vietnam + Philippines + Egypt + South-Africa + Kenya + Nigeria + Ghana + Saudi + Qatar + Bahrain + Kuwait + Oman + Jordan + Lebanon + Brazil + Mexico + Argentina + Chile + Colombia + Peru + Russia + Turkey + Iran + Iraq + Israel targeting Loughborough + Bath + Stanford + Cambridge + Oxford + Imperial + UCL + Edinburgh + Manchester + Bristol + KCL + Durham + Exeter + St-Andrews + Loughborough-London + Toronto + UBC + McGill + McMaster + Western + Queens + Alberta + Calgary + Dalhousie + NUS + NTU + HKUST + Sydney + Melbourne + Monash + UNSW + Queensland + Auckland + Otago admissions. The IB SEHS SL 8-topics (Anatomy + Exercise-Physiology + Energy-Systems + Movement-Analysis + Physical-Activity + Health-Wellbeing + Sport-Psychology + Sociocultural-Issues) + 2-Paper-structure (Paper-1-multiple-choice-and-data-response + Paper-2-extended-response) + Internal-Assessment-Practical-Investigation + IB-Command-Terms (State + Describe + Explain + Discuss + Evaluate + Compare + Contrast + Analyse + To-what-extent + Outline + Identify + Suggest) + 20-mark-IA-criterion-rubric (Personal-Engagement + Exploration + Analysis + Evaluation + Communication) covers everything the IB-World-School-cohort needs to bridge Year-12 + Year-13-sports-science + IB-Diploma + IBO-applied-sports-science-track + first-year-undergraduate-Sports-Science + Sport-Medicine + Sport-Psychology + Sport-Sociology + Sport-Physiotherapy + Sport-Nutrition + Exercise-Physiology + Health-Sciences + Medicine + Biomedical-Science + Public-Health + Physical-Therapy + Nursing + Kinesiology + university-credit + Sports-Science-Admissions-readiness at Loughborough + Bath + Stanford + Cambridge + Oxford + Imperial + UCL + Edinburgh + Manchester + Bristol + KCL + Durham + Exeter + St-Andrews + Loughborough-London + Toronto + UBC + McGill + McMaster + Western + Queens + Alberta + Calgary + Dalhousie + NUS + NTU + HKUST + Sydney + Melbourne + Monash + UNSW + Queensland + Auckland + Otago admissions. See post-167 for the IB-SEHS-SL-specific exam, score-distribution, and 30-week score-7 master schedule.

Pairs with IB Geography SL (post-169)

The IB Geography SL playbook (post-169) + [this playbook] form the IB Diploma + IB Standard-Level + IB Group-3 + IB Group-4 + IBO-applied-geography-track + Year-13-geography + first-year-undergraduate-Geography + Human-Geography + Physical-Geography + Environmental-Geography + Urban-Planning + International-Development + GIS + Earth-Sciences + Environmental-Science + Public-Policy + International-Relations + Sociology + Economics + Public-Health pair for the IB-Diploma-Programme Year-12 + Year-13 candidates + IB-Bilingual + IB-Course-Companion + Pre-Geography + Pre-Human-Geography + Pre-Physical-Geography + Pre-Environmental-Geography + Pre-Urban-Planning + Pre-International-Development + Pre-GIS + Pre-Earth-Sciences + Pre-Environmental-Science + Pre-Public-Policy + Pre-International-Relations + Pre-Sociology + Pre-Economics + Pre-Public-Health cohorts at IB-World-Schools in Switzerland + Singapore + Hong-Kong + UAE + UK + US + Canada + Australia + New-Zealand + Japan + Korea + China + India + Pakistan + Bangladesh + Indonesia + Malaysia + Thailand + Vietnam + Philippines + Egypt + South-Africa + Kenya + Nigeria + Ghana + Saudi + Qatar + Bahrain + Kuwait + Oman + Jordan + Lebanon + Brazil + Mexico + Argentina + Chile + Colombia + Peru + Russia + Turkey + Iran + Iraq + Israel targeting Cambridge + Oxford + UCL + LSE + Stanford + MIT + ETH-Zurich + Edinburgh + Manchester + Bristol + KCL + Durham + Exeter + St-Andrews + Loughborough + Bath + Toronto + UBC + McGill + McMaster + Western + Queens + Alberta + Calgary + Dalhousie + NUS + NTU + HKUST + Sydney + Melbourne + Monash + UNSW + Queensland + Auckland + Otago admissions. The IB Geography SL 7-core-optional-units (Changing-Population + Global-Climate-Vulnerability + Global-Resource-Consumption + Geophysical-Hazards + Freshwater + Oceans-Coastal-Margins + Leisure-Tourism-Sport + Food-Health-Wellbeing + Urban-Environments + Globalization-Interactions) + 2-Paper-structure (Paper-1-structured-questions + Paper-2-extended-response) + Internal-Assessment-Fieldwork-Investigation + IB-Command-Terms (Outline + Describe + Explain + Discuss + Evaluate + Compare + Contrast + Analyse + State + Annotate + Construct + Identify + Justify + Suggest + To-what-extent) + 25-mark-IA-criterion-rubric covers everything the IB-World-School-cohort needs to bridge Year-12 + Year-13-geography + IB-Diploma + IBO-applied-geography-track + first-year-undergraduate-Geography + Human-Geography + Physical-Geography + Environmental-Geography + Urban-Planning + International-Development + GIS + Earth-Sciences + Environmental-Science + Public-Policy + International-Relations + Sociology + Economics + Public-Health + university-credit + Geography-Admissions-readiness at Cambridge + Oxford + UCL + LSE + Stanford + MIT + ETH-Zurich + Edinburgh + Manchester + Bristol + KCL + Durham + Exeter + St-Andrews + Loughborough + Bath + Toronto + UBC + McGill + McMaster + Western + Queens + Alberta + Calgary + Dalhousie + NUS + NTU + HKUST + Sydney + Melbourne + Monash + UNSW + Queensland + Auckland + Otago admissions. See post-169 for the IB-Geography-SL-specific exam, score-distribution, and 30-week score-7 master schedule.

Pairs with IB History HL (post-170)

The IB History HL playbook (post-170) + [this playbook] form the IB Diploma + IB Higher-Level + IB Group-3 + IB Group-4 + IBO-applied-history-track + Year-13-history + first-year-undergraduate-History + PPE + International-Relations + Political-Science + Law + Public-Policy + Journalism + Human-Rights + Diplomacy + Foreign-Service + Classics + Archaeology + English-Literature + Public-International-Law pair for the IB-Diploma-Programme Year-12 + Year-13 candidates + IB-Bilingual + IB-Course-Companion + Pre-History + Pre-Law + Pre-International-Relations + Pre-Political-Science + Pre-Public-Policy + Pre-Journalism + Pre-PPE + Pre-PPP + Pre-Economics + Pre-Sociology + Pre-Anthropology + Pre-Philosophy + Pre-Classics + Pre-Archaeology + Pre-English-Literature + Pre-Public-International-Law + Pre-Human-Rights + Pre-Diplomacy + Pre-Foreign-Service cohorts at IB-World-Schools in Switzerland + Singapore + Hong-Kong + UAE + UK + US + Canada + Australia + New-Zealand + Japan + Korea + China + India + Pakistan + Bangladesh + Indonesia + Malaysia + Thailand + Vietnam + Philippines + Egypt + South-Africa + Kenya + Nigeria + Ghana + Saudi + Qatar + Bahrain + Kuwait + Oman + Jordan + Lebanon + Brazil + Mexico + Argentina + Chile + Colombia + Peru + Russia + Turkey + Iran + Iraq + Israel targeting Cambridge + Oxford + UCL + LSE + Stanford + MIT + Harvard + Yale + Princeton + Columbia + Chicago + Berkeley + Georgetown + Edinburgh + Manchester + Bristol + KCL + Durham + Exeter + St-Andrews + Loughborough + Bath + Toronto + UBC + McGill + McMaster + Western + Queens + Alberta + Calgary + Dalhousie + NUS + NTU + HKUST + Sydney + Melbourne + Monash + UNSW + Queensland + Auckland + Otago admissions. The IB History HL 5-prescribed-subjects (Military-leadership + Conquest-and-its-impact + Conflict-and-intervention + Civil-rights-and-social-movements + Causes-and-effects-of-20th-century-wars) + 12-world-history-topics (Authoritarian-states + 20th-century-war-practices + Cold-War-superpower-tensions + Rights-and-justice + Independence-movements + Civil-wars + Peacemaking + Cold-War + Arab-Israeli-Conflict + China + Korea + Vietnam + Decolonisation + Apartheid + Civil-Rights + Global-Governance + Conflict-Intervention + Demographic-and-Environmental-Change + Resources-and-Development + Globalisation + 21st-Century-Politics) + 4-HL-regional-options (Europe + Americas + Asia-Oceania + Africa-Middle-East) + 3-Paper-structure (Paper-1-source-analysis + Paper-2-extended-response + Paper-3-regional-essay) + Internal-Assessment-Historical-Investigation (2200-words + 25-marks + 25-percent-of-final-grade + IA-historical-investigation + IA-written-report) + OPVL + historiography + 15-IB-command-terms (Compare + Contrast + Discuss + Evaluate + Examine + To-what-extent + Analyse + Describe + Explain + Outline + State + Identify + Justify + Suggest + Construct + Annotate) + mark-band-descriptors (Band 1 Inadequate + Band 2 Adequate + Band 3 Competent + Band 4 Highly-Competent + Band 5 Sophisticated + Band 6 Excellent + Band 7 Outstanding) covers everything the IB-World-School-cohort needs to bridge Year-12 + Year-13-history + IB-Diploma + IBO-applied-history-track + first-year-undergraduate-History + PPE + International-Relations + Political-Science + Law + Public-Policy + Journalism + Human-Rights + Diplomacy + Foreign-Service + Classics + Archaeology + English-Literature + Public-International-Law + university-credit + History-Admissions-readiness at Cambridge + Oxford + UCL + LSE + Stanford + MIT + Harvard + Yale + Princeton + Columbia + Chicago + Berkeley + Georgetown + Edinburgh + Manchester + Bristol + KCL + Durham + Exeter + St-Andrews + Loughborough + Bath + Toronto + UBC + McGill + McMaster + Western + Queens + Alberta + Calgary + Dalhousie + NUS + NTU + HKUST + Sydney + Melbourne + Monash + UNSW + Queensland + Auckland + Otago admissions. See post-170 for the IB-History-HL-specific exam, score-distribution, and 30-week score-7 master schedule.

Pairs with IB Mathematics AA HL (post-173)

The IB Mathematics Analysis and Approaches Higher Level (IB Math AA HL) playbook (post-173) + [this playbook] form the IB Diploma + IB Mathematics Higher Level + IBO-mastery + Group-5-mastery + Year-12 + Year-13-mathematics + first-year-undergraduate-Mathematics + Engineering + Physics + Computer-Science + Economics + Quantitative-Finance + Actuarial-Science + Data-Science + Machine-Learning + AI + Mathematical-Physics + Theoretical-Physics + Astrophysics + Biostatistics + Bioinformatics + Computational-Biology pair for the IB-Diploma-Programme Year-12 + Year-13 candidates + IB-Bilingual + IB-Course-Companion + Pre-Engineering + Pre-Physics + Pre-Computer-Science + Pre-Mathematics + Pre-Statistics + Pre-Economics + Pre-Quantitative-Finance + Pre-Actuarial + Pre-Data-Science + Pre-Machine-Learning + Pre-AI cohorts at IB-World-Schools in Switzerland + Singapore + Hong-Kong + UAE + UK + US + Canada + Australia + New-Zealand + Japan + Korea + China + India + Pakistan + Bangladesh + Indonesia + Malaysia + Thailand + Vietnam + Philippines + Egypt + South-Africa + Kenya + Nigeria + Ghana + Saudi + Qatar + Bahrain + Kuwait + Oman + Jordan + Lebanon + Brazil + Mexico + Argentina + Chile + Colombia + Peru + Russia + Turkey + Iran + Iraq + Israel targeting MIT + Stanford + Caltech + Cambridge + Oxford + Imperial + UCL + LSE + Edinburgh + Manchester + Bristol + Durham + Exeter + St-Andrews + KCL + Loughborough + Bath + Toronto + UBC + McGill + McMaster + Western + Queens + Alberta + Calgary + Dalhousie + NUS + NTU + HKUST + KAIST + SNU + Tsinghua + Peking + Sydney + Melbourne + Monash + UNSW + Queensland + Auckland + Otago admissions. The IB Mathematics AA HL 5-core-topics (Topic 1 Number and Algebra + Topic 2 Functions + Topic 3 Geometry and Trigonometry + Topic 4 Statistics and Probability + Topic 5 Calculus) + 5-AA-HL-extension-topics (Complex-Numbers + Vectors-3D + Proof-by-Induction + Differential-Equations + Euler + Maclaurin-Series + Probability-Generating-Functions + Chi-Squared + Poisson + Markov-Chains + Linear-Regression + Correlation + Hypothesis-Tests + Continuous-Probability-Distributions) + 4-assessment-components (Paper 1 no-calculator + Paper 2 calculator + Paper 3 extended-response + IA Mathematical Exploration 12-pages) + IB-command-terms (show-that + hence-show + determine + sketch + state + write-down + find + justify) + score-7-rubric covers everything the IB-World-School-cohort needs to bridge Year-12 + Year-13-mathematics + IB-Diploma + IBO-mastery-track + first-year-undergraduate-Mathematics + Engineering + Physics + Computer-Science + Economics + Finance + Statistics + Actuarial + Data-Science + Machine-Learning + AI-university-credit + STEM-Admissions-readiness at MIT + Stanford + Caltech + Cambridge + Oxford + Imperial + UCL + LSE + Edinburgh + Manchester + Bristol + Durham + Exeter + St-Andrews + KCL + Loughborough + Bath + Toronto + UBC + McGill + McMaster + Western + Queens + Alberta + Calgary + Dalhousie + NUS + NTU + HKUST + KAIST + SNU + Tsinghua + Peking + Sydney + Melbourne + Monash + UNSW + Queensland + Auckland + Otago. See post-173 for the IB-Mathematics-AA-HL-specific exam, score-distribution, and 30-week score-7 master schedule.

Pairs with IB Spanish B HL (post-178)

The IB Spanish B HL playbook (post-178) + [this playbook] form the IB Diploma + IB Higher-Level + IB Group-2 + IB Group-2-Language-Acquisition + Spanish + hispanophone-world + IB-cohort companion for the IB-Diploma-Programme Year-12 + Year-13 candidates at IB-World-Schools in Spain + Mexico + Argentina + Colombia + Peru + Chile + Cuba + Puerto-Rico + Venezuela + Ecuador + Dominican-Republic + Guatemala + Costa-Rica + Panama + Uruguay + Paraguay + Bolivia + Honduras + El-Salvador + Nicaragua + UK + US + Singapore + Hong-Kong + UAE + Australia + New-Zealand + international-Spanish-bilingual-Schools targeting IE-Business-School + IESE + ESADE + ESERP + Complutense + Salamanca + Barcelona + Madrid + Buenos-Aires + UNAM + ITAM + Andes + Rosario + Bogota + Lima + Santiago + NYU + Columbia + Stanford + Harvard + Yale + Princeton admissions. See post-178 for the IB-Spanish-B-HL-specific exam, score-distribution, and 30-week score-7 master schedule.

Pairs with AP Computer Science A (post-197)

The AP Computer Science A playbook (post-197) + [this playbook] form the AP + AP-STEM + AP-CS + AP-Java + AP-Software-Engineering + AP-Data-Structures + AP-Algorithms + AP-OOP + AP-Recursion + AP-Big-O + AP-Array + AP-ArrayList + AP-2D-Array + AP-Inheritance + AP-Encapsulation + AP-Polymorphism + AP-Abstract-Class + AP-Interface + AP-Recursion-Trace + AP-Sorting + AP-Searching + AP-Binary-Search + AP-Merge-Sort + AP-QuickSort + AP-Tree-Traversal + AP-BFS + AP-DFS + AP-Stack + AP-Queue + AP-Linked-List + AP-Binary-Search-Tree + AP-Heap + AP-HashMap + AP-HashSet + AP-Comparable + AP-Iterator + AP-Generic-Type + AP-Enhanced-For-Loop + AP-Lambda + AP-Stream + AP-StringBuilder + AP-Wrapper-Class + AP-Autoboxing + AP-Null + AP-Equals-vs-== + AP-Reference-vs-Primitive + AP-Pass-by-Value + AP-Casting + AP-Upcast + AP-Downcast + AP-Composition + AP-Aggregation + AP-UML + AP-Class-Diagram + AP-Code-Tracing + AP-Code-Writing + AP-Code-Reading + AP-Debugging + AP-Testing + AP-JUnit + AP-TDD + AP-Exception-Handling + AP-Try-Catch + AP-NullPointerException + AP-ArrayIndexOutOfBoundsException + AP-IDE + AP-Eclipse + AP-IntelliJ + AP-VS-Code + AP-Debugger + AP-Breakpoint + AP-Git + AP-Version-Control + AP-Agile + AP-Scrum + AP-Pair-Programming + AP-Code-Review + AP-Code-Refactor + AP-Code-Style + AP-Naming-Convention + AP-JavaDoc + AP-MIT-EECS + AP-Stanford-CS + AP-CMU-CS + AP-Berkeley-EECS + AP-Georgia-Tech-CoC + AP-UIUC-CS + AP-Cornell-CS + AP-Princeton-CS + AP-Harvard-SEAS + AP-Yale-CS + AP-Columbia-SEAS + AP-Cambridge-Computer-Science + AP-Oxford-Computer-Science + AP-Imperial-Computing + AP-UCL-Computer-Science + AP-Toronto-CS + AP-Waterloo-CS + AP-UBC-CS + AP-McGill-CS + AP-ETH-CS + AP-EPFL-CS + AP-Software-Engineering-Track-Admissions + AP-AI-ML-Track-Admissions + AP-Data-Science-Track-Admissions + AP-Cybersecurity-Track-Admissions + AP-Computer-Engineering-Track-Admissions + AP-Quant-Track-Admissions cohort companion for US high school students (Grade 10 + 11 + 12) preparing for the May 2027 AP exam + parents paying $100+ per AP exam + Java-tutor costs + AP teachers wanting a rubric-aligned AI workflow for FRQ scoring + Java-code review + homeschool families using AP for transcript strength targeting first-year-undergraduate-Computer-Science + Software-Engineering + Artificial-Intelligence + Machine-Learning + Data-Science + Cybersecurity + Computer-Engineering + Quantitative-Finance + Mathematics + Physics + Engineering at MIT + Stanford + Caltech + Harvard + Yale + Princeton + Brown + Dartmouth + Cornell + Columbia + NYU + Georgetown + Berkeley + Chicago + Penn + Rice + Indiana + Michigan + Northwestern + Duke + Johns-Hopkins + CMU + Georgia-Tech + UIUC + Wisconsin + Texas-Austin + Washington + UCLA + USC + UC-Berkeley + Cambridge + Oxford + Imperial + LSE + UCL + Edinburgh + Manchester + Bristol + Durham + Exeter + St-Andrews + KCL + Loughborough + Bath + Toronto + UBC + McGill + McMaster + Western + Queens + Alberta + Calgary + Dalhousie + NUS + NTU + HKUST + KAIST + SNU + Tsinghua + Peking + Sydney + Melbourne + Monash + UNSW + Queensland + Auckland + Otago admissions. See post-197 for the AP-CSA-specific exam, score-distribution, and 20-week score-5 master schedule.