IB COMPUTER SCIENCE | A1 ASSESSMENT
COMPUTER FUNDAMENTALS: END OF TOPIC REVIEW
Test what you can recall, apply and explain across hardware, data, logic and OS topics. Add the labelled HL questions on architecture, control, multitasking and translation.
BEFORE YOU BEGIN
Split this review into two sessions if needed: first the automatic checks and applied tasks, then the written work. As a flexible guide, allow 75–100 minutes for the common review and additional time for the HL extension; adjust to the detail of your written answers.
Sections A and B award one point for each fully correct automatic item, with no partial credit within an item. Section C has separately suggested content marks. These are original practice questions, not an official IB paper, grade boundary or prediction.
Choose your level below. Write calculations, diagrams and Section C answers in your exercise book before revealing guidance. Answers and selections last while the page remains open.
Automatic total: 36 points. Suggested written total: 60 marks, assessed separately.
C | WRITTEN COMMUNICATION AND SUBJECT KNOWLEDGE
Write in your exercise book before revealing the guidance. The table gives practical guidance based on the IB command terms supplied in the guide; it is not the Cambridge command-word table.
In particular, IB compare focuses on similarities, while distinguish asks for differences. If you need to address both, the question can request each separately. All main commands below are highlighted.
| IB command term | What to provide in this review | Writing approach |
|---|---|---|
| Calculate | A numerical result with relevant working stages | Show the calculation and units |
| Describe | A detailed account | Give features or an ordered process, not only a name |
| Explain | A detailed account including reasons or causes | Link ideas with because, therefore, resulting in or leading to |
| Compare | Similarities, referring to both items throughout | Both…; each…; in both approaches… |
| Distinguish | Clear differences between the concepts | Whereas…; unlike…; this holds a value while that holds an address… |
| Construct | Information displayed in diagrammatic or logical form | Supply the requested table, map or connected diagram |
| Deduce | A conclusion reached from the supplied information | Use the map or data as evidence |
| Justify | Valid reasons or evidence for a choice | Connect the choice to the stated requirement |
| Evaluate | An appraisal weighing strengths and limitations | Balance relevant factors and reach a supported judgement |
A connective earns no automatic mark by itself: it must express an accurate relationship. For example, “the task is blocked because it awaits I/O, therefore the scheduler can choose other ready work” explains a cause and consequence. Suggested marks reward subject content, not extra unofficial grammar marks.
C1 | FETCH AND A DATA ACCESS
4 suggested marks | COMMON SL/HL
Describe the register and bus interactions when fetching a fictional LOAD 400 instruction from the address in PC, then reading the data at address 400. Assume one data value is loaded into the accumulator.
The fetch copies the instruction address from PC to MAR. A memory-read control operation transfers the encoded instruction through the data bus into MDR, and it is copied to IR. PC advances under the instruction-length rule. The CU decodes LOAD 400, then a separate access uses MAR = 400 to read the operand value into MDR and then the accumulator.
SUGGESTED MARKING POINTS
- PC instruction address reaches MAR; address bus identifies that location (1).
- Read control and data transfer bring the instruction to MDR and IR (1).
- PC advancement and CU interpretation are described (1).
- A distinct read at address 400 transfers the data value for the accumulator (1).
Writing focus: Give a connected sequence. Distinguish an instruction address, encoded instruction and operand data.
Equivalent accurate wording and methods can be valid. Use the points as self-assessment guidance, not an official IB markscheme.
Revisit related contentC2 | GPU AND WORKING MEMORY
4 suggested marks | COMMON SL/HL
A photo application applies the same calculation to millions of pixels. Explain why a GPU may help. Then distinguish RAM from cache in supporting execution.
Many pixel calculations can expose suitable parallel work, so a GPU can improve throughput if data access and coordination costs allow. RAM provides a larger working store for active programs and data, while cache holds selected copies closer to execution resources to reduce typical access delay.
SUGGESTED MARKING POINTS
- Links repeated pixel calculations to suitable parallelism (1).
- Connects GPU throughput to benefit, with a relevant workload/overhead condition (1).
- RAM as larger active working memory (1).
- Cache as selected copies supporting lower typical access delay (1).
Writing focus: Use because/therefore for the GPU explanation. Make the RAM/cache difference explicit rather than calling both fast.
Equivalent accurate wording and methods can be valid. Use the points as self-assessment guidance, not an official IB markscheme.
Revisit related contentC3 | LOSSLESS COMPRESSION AND CLOUD CONTROL
4 suggested marks | COMMON SL/HL
A team must preserve source files exactly and deploy its own web app without managing the underlying OS. Justify a compression category and a cloud service model for these requirements.
Lossless compression is appropriate because decompression must reproduce the original source exactly. PaaS is suitable because it supports deployment of the team’s application while the provider manages the underlying platform and OS. The team still manages its application, data and appropriate access settings.
SUGGESTED MARKING POINTS
- Lossless selected (1).
- Exact reconstruction linked to preserving source (1).
- PaaS selected (1).
- Own app plus managed underlying platform linked to the requirement (1).
Writing focus: Justify each choice against a stated requirement. Do not simply name two technologies.
Equivalent accurate wording and methods can be valid. Use the points as self-assessment guidance, not an official IB markscheme.
Revisit related contentC4 | BINARY STORAGE WITH WORKING
4 suggested marks | COMMON SL/HL
An uncompressed image is 200 × 100 pixels with 8 bits per pixel. Calculate raw pixel-data size in bytes, showing working. Explain why the final stored file need not have that exact size.
200 × 100 × 8 = 160,000 bits, and 160,000 ÷ 8 = 20,000 bytes. A stored format may include metadata, headers, padding or a palette; compression can also change size. Therefore the raw-pixel calculation is not an exact prediction for every saved image format.
SUGGESTED MARKING POINTS
- Correct width × height × depth calculation in bits (1).
- Correct division by eight and answer 20,000 bytes (1).
- Relevant format overhead or compression identified (1).
- Explains why the raw-data assumption differs from final file size (1).
Writing focus: Show the bit-to-byte conversion and label units. Link the storage-format difference to the conclusion.
Equivalent accurate wording and methods can be valid. Use the points as self-assessment guidance, not an official IB markscheme.
Revisit related contentC5 | CONSTRUCT AND SIMPLIFY LOGIC
6 suggested marks | COMMON SL/HL
X is 1 only for ABC = 101, 110 and 111. Construct its eight-row truth table and a three-input Karnaugh map. Use the map to deduce a simplified expression, then construct a corresponding logic diagram.
| A | B | C | X |
|---|---|---|---|
| 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 0 |
| 0 | 1 | 0 | 0 |
| 0 | 1 | 1 | 0 |
| 1 | 0 | 0 | 0 |
| 1 | 0 | 1 | 1 |
| 1 | 1 | 0 | 1 |
| 1 | 1 | 1 | 1 |
| A \ BC | 00 | 01 | 11 | 10 |
|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 1 | 1 | 1 |
Group bottom-row columns 01 and 11 to obtain A·C. Group 11 and 10 to obtain A·B; overlap at 11 is valid. X = A·C + A·B = A AND (B OR C). Draw OR on B,C and feed its output together with A into AND, labelling final output X.
SUGGESTED MARKING POINTS
- Eight distinct input rows with the specified three 1 outputs (1).
- K-map correctly placed using Gray order 00,01,11,10 (1).
- Group 01/11 gives A·C (1).
- Group 11/10 gives A·B, with valid overlap (1).
- Equivalent simplified expression A·(B+C) or A·B+A·C (1).
- Connected correct gate diagram with labelled A,B,C and X (1).
Writing focus: Provide the actual table, map groups and drawing. Describe grouping evidence rather than guessing an expression.
Equivalent accurate wording and methods can be valid. Use the points as self-assessment guidance, not an official IB markscheme.
Revisit related contentC6 | OS SERVICES AND PROTECTION
4 suggested marks | COMMON SL/HL
A student edits a report while a download runs. Explain how memory management and file services support the work. Then distinguish authentication from authorisation.
Memory management supplies and protects working address spaces and manages allocations for the active processes. File services provide organised read/write access to saved data, subject to relevant rules, so each application need not implement the whole storage system. Authentication establishes identity; authorisation determines permitted actions, so a logged-in student may still be denied a write.
SUGGESTED MARKING POINTS
- Memory allocation/protection linked to running processes (1).
- Managed persistent file access linked to application use (1).
- Authentication establishes identity (1).
- Authorisation determines permitted actions, explicitly distinguished (1).
Writing focus: Connect each service to the situation, then separate identity from permission.
Equivalent accurate wording and methods can be valid. Use the points as self-assessment guidance, not an official IB markscheme.
Revisit related contentC7 | SCHEDULING RESULTS AND SIMILARITIES
4 suggested marks | COMMON SL/HL
Use A = 6, B = 2, C = 1, all ready at 0 in A,B,C order, one core, no I/O and no switching delay. Calculate C’s first-start and completion times for FCFS and RR with quantum 2. Then compare the approaches in their common purpose and resource constraints.
FCFS runs A 0–6, B 6–8, C 8–9, so C starts 8 and completes 9. RR runs A 0–2, B 2–4, C 4–5, A 5–7, A 7–9, so C starts 4 and completes 5. Both select among ready work for the same finite core, and neither reduces the nine units of useful CPU work required by this workload.
SUGGESTED MARKING POINTS
- FCFS C start 8 and completion 9 with a valid trace (1).
- RR C start 4 and completion 5 with a valid trace (1).
- Both coordinate/select ready work for CPU execution (1).
- Both operate under the same finite CPU capacity and useful-work demand (1).
Writing focus: The IB compare command focuses on similarities. The numerical calculation separately establishes the different outcomes.
Equivalent accurate wording and methods can be valid. Use the points as self-assessment guidance, not an official IB markscheme.
Revisit related contentC8 | EVALUATE EVENT HANDLING
6 suggested marks | COMMON SL/HL
A battery-powered monitoring device receives rare unpredictable alarm events, but occasionally uploads a burst of data. Evaluate polling, interrupts and a hybrid arrangement for these conditions. Include latency and security.
Wake-capable interrupts can avoid repeated empty checks and permit sleep during quiet periods, favouring the rare-alarm case. However, entry/wakeup cost, masking and competing handlers affect response, so an interrupt alone does not guarantee a deadline. Busy polling can reduce detection gaps in a chosen path but uses resources when idle; periodic polling trades interval against delay. During a data burst, notification followed by budgeted polling or batching can reduce per-item overhead. Event floods and faulty data require limits, validation and adequate buffering. A suitable judgement favours event-driven wakeup for the rare alarm and a controlled hybrid for burst transfer, subject to measured timing and fault behaviour.
SUGGESTED MARKING POINTS
- Relevant benefit of interrupt-driven quiet-period handling (1).
- Polling tradeoff linked to checking frequency, CPU or power (1).
- Distinguishes handler-start latency from a guaranteed completed response (1).
- Hybrid/batching benefit linked to the burst (1).
- Relevant event-flood, validation or buffer/security consideration (1).
- Supported contextual judgement with stated conditions (1).
Writing focus: Weigh strengths and limitations, then reach a conclusion. Use because, however and therefore to connect the tradeoffs.
Equivalent accurate wording and methods can be valid. Use the points as self-assessment guidance, not an official IB markscheme.
Revisit related contentC9 | HL: CPU/GPU AND PIPELINING
6 suggested marks | HL ONLY
Distinguish CPU and GPU design aims for serial and parallel workloads. An ideal four-stage pipeline starts empty and executes five instructions with equal stage intervals and no stalls. Calculate its completion interval, then explain why real throughput can be lower.
CPUs emphasise flexible control and low latency on varied or serial instruction flows; GPUs emphasise high throughput on suitable parallel work. In the ideal pipeline, completion takes 4 + 5 − 1 = 8 intervals, rather than 20 without overlap. Dependencies, branches or resource conflicts can insert stalls or corrective work, so the ideal completion rate is not guaranteed.
SUGGESTED MARKING POINTS
- CPU aim linked to varied/serial control (1).
- GPU aim linked to parallel throughput, explicitly distinguished (1).
- Correct formula or staged reasoning (1).
- Eight intervals (1).
- Relevant hazard or conflict identified (1).
- Cause linked to stalls/reduced throughput (1).
Writing focus: Separate design difference, calculation and causal explanation. More cores alone do not remove every dependency.
Equivalent accurate wording and methods can be valid. Use the points as self-assessment guidance, not an official IB markscheme.
Revisit related contentC10 | HL: DEADLOCK AND RESOURCE ALLOCATION
6 suggested marks | HL ONLY
A and B each need single-instance exclusive resources R1 and R2. A holds R1 and requests R2; B holds R2 and requests R1. Explain the deadlock, why CPU preemption alone does not solve it, and how consistent acquisition order could prevent it.
Each task waits for a resource held by the other while retaining its own. Neither can reach the release step, so the affected set cannot progress without intervention. Preempting a CPU turn saves execution state but does not safely take away an arbitrary protected resource. If both tasks must acquire R1 before R2, a task blocked on R1 does not first hold R2, so the demonstrated circular wait cannot form. Ordinary contention and waiting can still occur.
SUGGESTED MARKING POINTS
- Correct ownership and waiting dependencies identified (1).
- Explains why neither reaches release/progress (1).
- CPU preemption does not automatically release the resource (1).
- Taking protected resources may be unsafe during partial work (1).
- Consistent order R1 then R2 proposed for both (1).
- Explains how that prevents circular wait, while allowing ordinary waiting (1).
Writing focus: Use a chain of reasons. Do not replace a dependency explanation with “the computer is frozen”.
Equivalent accurate wording and methods can be valid. Use the points as self-assessment guidance, not an official IB markscheme.
Revisit related contentC11 | HL: ELEVATOR AND DOOR CONTROL
6 suggested marks | HL ONLY
Explain how an elevator controller uses a floor request, position feedback, a drive actuator and door-lock confirmation. Distinguish a command from a confirmed outcome, and explain why feedback does not remove all physical or sensing limitations.
The requested floor supplies a target. Position information reports progress and is used by the control rule to manage movement and stopping. A drive actuator causes motion. Lock confirmation is an interlock permitting travel only when the required condition is established; a close command alone does not prove it. Sensor faults, delay or insufficient actuator capability can prevent the intended result despite feedback. Real systems require additional engineered protection.
SUGGESTED MARKING POINTS
- Floor request identified as objective/target (1).
- Position feedback used to determine motion progress/stopping (1).
- Controller rule and drive actuator linked to physical action (1).
- Door-lock confirmation explained as a travel interlock (1).
- Command versus verified physical outcome distinguished (1).
- A relevant feedback limitation linked to a consequence (1).
Writing focus: Give each input its purpose; do not call every sensor the same feedback signal.
Equivalent accurate wording and methods can be valid. Use the points as self-assessment guidance, not an official IB markscheme.
Revisit related contentC12 | HL: EVALUATE TRANSLATION
6 suggested marks | HL ONLY
A team develops a cross-platform application through frequent tests; the deployed application runs for long periods and repeatedly performs expensive calculations. Evaluate ahead-of-time native compilation and a bytecode/runtime approach that can use JIT compilation.
An ahead-of-time native build can perform optimisation before execution and avoid runtime compilation for that code, but target builds and dependencies affect cross-platform distribution and changes may need a rebuild. Bytecode can run on compatible runtimes and support a convenient development cycle, but portability still depends on libraries and platform features. Interpretation may add execution cost, while a JIT can optimise frequently executed work during a long run at a cost of warm-up, compilation and memory. A reasoned recommendation can favour a mature bytecode/JIT environment if compatible runtimes exist and measured sustained performance meets needs, or native builds if predictable startup or target-specific optimisation dominates.
SUGGESTED MARKING POINTS
- A relevant AOT strength tied to execution/startup or optimisation (1).
- A relevant AOT target-build/development limitation (1).
- Bytecode portability linked to a compatible runtime (1).
- JIT benefit tied to repeated long-running work (1).
- Warm-up/runtime cost or dependency limitation explained (1).
- Balanced context-based conclusion, supported by the tradeoffs (1).
Writing focus: Do not label a language inherently compiled or interpreted. Weigh preparation, startup and sustained execution separately.
Equivalent accurate wording and methods can be valid. Use the points as self-assessment guidance, not an official IB markscheme.
Revisit related contentCHECK THE QUALITY OF YOUR WRITING
Did you answer the command? For explain, check the reason or cause; for compare, address both items through similarities; for distinguish, make the differences explicit; for evaluate, weigh strengths and limitations and support your conclusion.
For construct, check labels, connections and completeness. For calculate, show enough working to follow your method and label units. Select two weak responses and rewrite them after revising. Keep the written total separate from your automatic result.
YOUR NEXT REVISION STEP
Submit the automatic sections for targeted revision links.
Record your own written marks using the suggested points. Choose two weaknesses and attempt new examples after revising. Use the A1 revision page for worked content and a personal flashcard list, or return to the IB course index.