Loading…

Worked solutions

IB Computer Science HL · Paper 1

Computer Science, Higher Level

Session: November 2018
Marks: 100
Duration: 2 hours 10 min
Calculator: Not allowed
Questions: 12

Keep your copy of the paper open alongside. We don't reproduce the questions: each part below is labelled to match the November 2018 global paper, which your school or the IB can provide.

Practice mode

Hide our working until you've had a go.

Questions 1–7 · 25 marks

Question 1

4 marks

Computer network definition and low bandwidth implications

Networks

(a)

2 marks

Define a computer network:
1) An interconnected collection of autonomous computers, servers, and peripheral hardware devices.
2) Linked via wired or wireless transmission media (cables, optical fiber, radio frequencies) to facilitate data communication and resource sharing among users.

Mentor tip

State that multiple computing devices are connected together via physical or wireless communication channels to share data and hardware resources.

(b)

2 marks

Describe a problem resulting from low bandwidth:
1) Low bandwidth restricts the maximum data volume transmitted per second, leading to elevated network congestion and high transmission latency.
2) Consequently, file transfers take prolonged durations, streaming multimedia experiences buffering or packet dropouts, and real-time interactive business applications become unresponsive.

Mentor tip

Define bandwidth as data capacity over time, and explain how constrained throughput causes delays and degraded service.

Question 2

2 marks

Direct observation advantages and disadvantages in requirements analysis

System fundamentals

(a)

1 mark

Identify an advantage of direct observation:
Allows the systems analyst to observe end-users executing operational workflows in their natural working environment, capturing firsthand, unbiased reality rather than what users claim they do.

Mentor tip

Focus on observing real operational behavior in natural setting without reliance on subjective recollection.

(b)

1 mark

Identify a disadvantage of direct observation:
The Hawthorne effect: Users who are aware of being watched may alter their standard behavior, follow procedures more rigidly, or work unnaturally slowly; additionally, the technique is time-consuming for the analyst.

Mentor tip

Note observer bias or behavioral alteration (Hawthorne effect) when subjects know they are being observed.

Question 3

3 marks

Logic diagram representation of Boolean expression

Computer organisation

(a)

3 marks

Construct logic diagram for Boolean expression: \text{not } A \text{ or } (A \text{ and } B)
1) Connect input line A to a NOT gate (inverter) to produce intermediate signal \neg A.
2) Connect input lines A and B to a 2-input AND gate to produce intermediate signal (A \land B).
3) Connect intermediate outputs \neg A and (A \land B) into a 2-input OR gate to generate final output Z.

Z = \neg A \lor (A \land B) = \neg A \lor B

Mentor tip

Diagram includes 2 inputs (A, B), 3 gates (NOT, AND, OR), and 1 output.

Question 4

6 marks

International data migration compatibility, VPN communication, and social impact

System fundamentals
Networks

(a)

2 marks

Identify two data migration compatibility issues when moving headquarters between Europe and Asia:
1) Character encoding and language differences: Incompatible text standards (e.g., legacy ASCII/ISO vs Unicode/UTF-8 for Asian non-Latin character scripts).
2) Cultural data formatting conventions: Discrepancies in date representations (DD/MM/YYYY vs YYYY/MM/DD), address hierarchy structures, and currency symbol and precision standards.

Mentor tip

Highlight character set / encoding mismatches and differing date, currency, or unit formatting conventions.

(b)

2 marks

Outline how a Virtual Private Network (VPN) enables secure cross-continent communication:
1) Establishes an encrypted point-to-point tunnel over the public internet connecting European branch offices with Asian headquarters.
2) Encrypts all transmitted IP data packets, guaranteeing data confidentiality and integrity while masking internal IP addresses from external interception.

Mentor tip

Explain encrypted tunneling over the public internet providing secure, confidential communication between remote offices.

(c)

2 marks

Outline one social issue associated with relocating corporate headquarters:
Workplace disruption and job redundancy: Employees unable or unwilling to relocate to Asia face job displacement, loss of income, and career disruption. Conversely, relocating staff face cultural adaptation, family relocation stresses, and language barriers.

Mentor tip

Focus on human impact: job loss/redundancy or relocation stress and cultural adjustment.

Question 5

4 marks

Operational mechanism of packet switching across wide area networks

Networks

(a)

4 marks

Describe data transmission via packet switching:
1) Packetization: The source computer breaks the raw message stream into discrete, standardized units called packets, attaching header metadata (source IP, destination IP, packet sequence number, error checksum).
2) Independent routing: Intermediate routers evaluate packet destination addresses dynamically, forwarding individual packets along different optimal pathways across the network based on real-time traffic conditions.
3) Reassembly and error recovery: Upon reaching the destination, packets are reordered into their original sequence using their sequence numbers. If a packet is corrupt or missing according to checksum validation, a retransmission request is triggered.

Mentor tip

Describe breaking data into packets with headers, dynamic routing along independent paths, and destination reassembly with error checking.

Question 6

3 marks

Role and importance of isEmpty() method in stack algorithm design

Abstract data structures

(a)

3 marks

Explain the importance of calling isEmpty() during stack operations:
1) Method behavior: isEmpty() evaluates the internal stack pointer and returns a boolean value (True if the stack contains zero elements, False otherwise).
2) Prevention of stack underflow: Popping an element from an empty stack generates an illegal state exception (stack underflow) that will crash the program.
3) Loop termination: Serves as the mandatory boundary condition in control loops (e.g., 'while not STACK.isEmpty()') to ensure elements are processed until exhaustion without attempting out-of-bounds memory accesses.

Mentor tip

State that it returns boolean empty status, prevents catastrophic stack underflow on pop(), and provides safe loop termination.

Question 7

3 marks

Comparison of time slicing and priority scheduling in operating systems

Resource management

(a)

3 marks

Distinguish between time slicing and priority-based process scheduling:
1) Time slicing (Round Robin): The CPU scheduler assigns each active process a predetermined, equal quantum of processor time (time slice). When the timer expires, the running process is preempted and placed at the back of the ready queue, ensuring fair CPU distribution regardless of process type.
2) Priority scheduling: Each process is assigned an explicit priority weighting (e.g., critical real-time I/O interrupts have higher priority than background compute jobs). The scheduler always grants the CPU to the highest-priority runnable process.
3) Preemption and starvation: Priority scheduling allows urgent tasks to preempt lower tasks immediately, but risks starvation of low-priority processes unless aging mechanisms are applied, unlike democratic time slicing.

Mentor tip

Contrast equal fixed time quanta (round robin) with priority-ranked queues where high-priority jobs execute first.

Questions 8–12 · 75 marks

Question 8

15 marks

Primary memory hierarchy, system bus architecture, and character encodings

Computer organisation

(a)

5 marks

Part (i) Distinguish between RAM and ROM (3 marks):
- Volatility: RAM is volatile (contents are lost upon power interruption), whereas ROM is non-volatile (contents persist permanently without power).
- Read/Write capability: RAM supports both read and write operations at runtime, whereas ROM is strictly read-only in standard operation.
- Contents and purpose: RAM holds running application instructions, operating system kernel modules, and live working data. ROM stores immutable system firmware, such as BIOS/UEFI bootloader routines required to initialize hardware at startup.
Part (ii) Primary memory management role of operating system (2 marks):
- Dynamic address allocation: Allocates contiguous physical memory frames or virtual pages to application processes upon request, and reclaims/de-allocates memory when processes terminate.
- Memory protection and isolation: Enforces boundary checks so processes cannot corrupt adjacent memory segments, utilizing paging to secondary storage when RAM is exhausted.

Mentor tip

Cover volatility, read/write ability, and boot vs runtime roles for RAM/ROM. For OS memory management, detail allocation, deallocation, and virtual memory.

(b)

4 marks

Explain the distinct roles of the address bus and data bus during instruction execution:
1) System bus definition: Parallel electronic communication channels connecting the CPU registers to primary RAM.
2) Address bus: Unidirectional bus driven by the CPU (MAR). Carries the physical memory address specifying the target RAM location to read from or write to.
3) Data bus: Bidirectional bus carrying the actual instruction word or data operand between primary memory and the processor's Memory Data Register (MDR).
4) Execution cycle coordination: During fetch, the CPU places the instruction address on the address bus, signals a memory read, and retrieves the returned opcode across the data bus into the MDR.

Mentor tip

Highlight unidirectional address bus carrying location pointers from MAR vs bidirectional data bus carrying actual content to/from MDR.

(c)

4 marks

Evaluate the binary byte 0101 1110:
Part (i) Convert byte to hexadecimal (1 mark):
Split into two 4-bit nibbles: 0101_2 = 5_{16}, and 1110_2 = E_{16}.
Hexadecimal value = 5E.
Part (ii) State total distinct integers representable in 1 byte (1 mark):
2^8 = 256 distinct integer values (0 to 255 unsigned, or -128 to +127 in two's complement).
Part (iii) Explain why 1 byte cannot encode Chinese characters (2 marks):
A single byte provides at most 2^8 = 256 unique code points, which is sufficient for small alphabetic alphabets (Latin alphabet, punctuation, control codes). Chinese ideographic script contains tens of thousands of unique characters, necessitating multi-byte encodings (such as UTF-8 or UTF-16, requiring at least 2 to 3 bytes per character).

010 1_{2} = 5_{16}, 111 0_{2} = 1 4_{10} = E_{16} ⟹ 5 E_{16} 2^{8} = 256 ≪ Number of Chinese logograms (> 50,000)

Mentor tip

Split into nibbles 0101 (5) and 1110 (E). 1 byte gives 256 combinations, vastly insufficient for thousands of ideographic logograms.

(d)

2 marks

Construct truth table for equivalence condition (Output is True when inputs are equal):
Input A | Input B | Output C (XNOR)
0 | 0 | 1 (True)
0 | 1 | 0 (False)
1 | 0 | 0 (False)
1 | 1 | 1 (True)

C = (A \land B) \lor (\neg A \land \neg B) = \neg (A \oplus B)

Mentor tip

This represents the XNOR equivalence logic gate: output is 1 when both inputs match (0,0 or 1,1).

Question 9

15 marks

High-level languages, modular sub-procedures, and collection interval filtering

Computational thinking, problem-solving and programming
Abstract data structures

(a)

2 marks

Outline the necessity for high-level programming languages:
1) Human abstraction and productivity: High-level languages use human-readable syntax and structured abstractions (loops, conditional logic, complex data structures) rather than cryptic binary opcodes, drastically accelerating developer productivity.
2) Hardware portability and machine independence: High-level source code compiles or interprets across diverse CPU architectures without requiring knowledge of machine-level register sets and instruction encoding.

Mentor tip

Focus on programmer productivity, readability, and machine independence.

(b)

4 marks

Explain two distinct benefits of sub-procedures (methods/functions) in program construction:
Benefit 1: Code Reusability and Maintainability: A procedure written and verified once can be invoked from multiple call sites across the program, reducing redundant code and isolating modifications to a single modular location.
Benefit 2: Problem Decomposition and Team Collaboration: Complex software tasks are broken into manageable sub-tasks (top-down functional decomposition). Individual team members can develop, debug, and unit-test separate modules concurrently without interfering with other modules.

Mentor tip

Explain code reuse/easier maintenance and top-down problem decomposition/collaborative development.

(c)

3 marks

Identify three key characteristics of a collection data structure:
1) Abstract container of elements: Groups discrete data items into a single container entity, dynamically managing element storage.
2) Encapsulated access methods: Provides standardized iterator and mutation methods (e.g., resetNext(), hasNext(), getNext(), addItem(), isEmpty()) hiding underlying memory layout.
3) Dynamic sizing and type flexibility: Can grow and shrink dynamically at runtime, holding primitive values or heterogeneous complex object references.

Mentor tip

Mention encapsulated methods (hasNext, getNext), dynamic container capacity, and abstraction over underlying physical memory structures.

(d)

6 marks

Construct pseudocode to iterate collection NUMBERS and count elements within interval [-1, 1]:
COUNTER = 0
NUMBERS.resetNext()
while NUMBERS.hasNext()
ELEMENT = NUMBERS.getNext()
if ELEMENT >= -1.0 and ELEMENT <= 1.0 then
COUNTER = COUNTER + 1
end if
end while
output COUNTER

- 1 \leq x \leq 1 ⟺ ∣ x ∣ \leq 1

Mentor tip

Remember to call NUMBERS.resetNext() before the loop, fetch each value using getNext(), check interval bounds inclusive, and print the counter.

Question 10

15 marks

Industrial pipeline leak detection control system and flowchart modeling

System fundamentals
Networks
Control systems

(a)

2 marks

Identify security measures for confidential Head Office data:
Part (i) Hardware security measure (1 mark): Biometric access locks (fingerprint/retina scanners), electronic keycard access to server rooms, or physical chassis lock enclosures.
Part (ii) Software security measure (1 mark): Role-Based Access Control (RBAC) permissions, robust user password policies with MFA, or symmetric/asymmetric file-level data encryption.

Mentor tip

Give one physical hardware measure (locked door/biometrics) and one software measure (passwords/encryption/access rights).

(b)

1 mark

Identify one network security measure for remote site communication:
Virtual Private Network (VPN) with end-to-end IPsec encryption (or network firewalls / trusted MAC address filtering).

Mentor tip

Name VPN tunneling, transport encryption, or firewall filtering.

(c)

3 marks

Explain environmental benefits of a computer control system monitoring subsea pipelines:
1) Continuous 24/7 autonomous monitoring: Monitors pressure and flow sensors uninterruptedly without human fatigue, detecting anomalous micro-drops instantly.
2) Rapid automated isolation: Upon detecting leak parameters, the system triggers automated shutoff valves within milliseconds, halting oil flow and minimizing oceanic pollution and ecological damage.
3) Proactive disaster mitigation: Prevents catastrophic pipeline ruptures that would devastate marine wildlife and coastal ecosystems.

Mentor tip

Highlight instant response/automated valve shutoff, continuous 24/7 reliability, and minimizing ecological contamination.

(d)

4 marks

Explain the relationship between sensors, output transducers, and processor in this leak detection system:
1) Sensor input: Subsea flow and pressure sensors continuously measure physical quantities, converting them into continuous analog electrical signals.
2) Analog-to-Digital Conversion (ADC): The analog signals are digitized by an ADC so the digital processor can read them.
3) Processor evaluation: The microprocessor compares the digital readings against baseline operating parameters retrieved from disk.
4) Output transducer actuation: If values fall outside tolerable thresholds, the processor transmits digital signals (converted via DAC/relay switches) to output transducers, sounding audible alarms and activating emergency valve shutoff actuators.

Mentor tip

Explain the flow: physical sensors -> ADC -> processor logic comparison -> output transducers/actuators (audible alarm, shutoff valves).

(e)

5 marks

Construct system flowchart representing the leak monitoring process:
1) Input symbol: Flow and pressure sensor readings received into system.
2) Manual input / storage: System parameters loaded from disk (with staff configuration manual input option).
3) Processing block: Processor compares incoming sensor readings against baseline parameters from storage.
4) Decision symbol (Is sensor value within tolerable parameter limits?):
- YES path: Loop back to continue continuous sensor sampling.
- NO path (Leak condition detected):
5) Output / Action blocks: Trigger error routine -> sound audible alarm on office computer AND dispatch automated emergency email alert to Head Office managers.

Mentor tip

Include sensor input, disk parameter access, comparison decision diamond, normal monitoring loop, and error routine branches (alarm, alert email).

Question 11

15 marks

Alphabetical linked list mutation, head node deletion, and binary tree mapping

Abstract data structures

(a)

3 marks

Compare dynamic linked list with static 1D array for maintaining sorted vegetable names:
1) Dynamic sizing: A linked list allocates nodes on demand from the heap, expanding and contracting without fixed capacity limits or memory wastage, whereas an array has a fixed compile-time size.
2) Insertion and deletion efficiency: Adding or removing an item in a sorted linked list requires only redirecting node pointer references (O(1) pointer updates once located). In an array, inserting or deleting requires shifting all subsequent elements in memory.
3) Memory overhead: Linked list nodes incur additional memory overhead to store pointer references for every data element.

Mentor tip

Contrast dynamic heap allocation with static array limits, and pointer relinking with costly array element shifts.

(b)

2 marks

Sketch singly linked list holding [asparagus, lettuce, potato, radish] in alphabetical order:
1) External head pointer 'First' points to first node: [ 'asparagus' | next ].
2) 'asparagus'.next points to [ 'lettuce' | next ].
3) 'lettuce'.next points to [ 'potato' | next ].
4) 'potato'.next points to [ 'radish' | null ].
5) 'radish' contains a null pointer representing end-of-list.

Mentor tip

Show external Head pointer, alphabetical node chain (asparagus -> lettuce -> potato -> radish), and final null pointer.

(c)

6 marks

Part (i) List steps to insert 'cabbage' into sorted linked list (4 marks):
1) Allocate a new node containing the data value 'cabbage' and set its next pointer to null.
2) Traverse the list from the head pointer, comparing 'cabbage' alphabetically against each node's value.
3) Identify the insertion position between 'asparagus' and 'lettuce' (since 'asparagus' < 'cabbage' < 'lettuce').
4) Set the next pointer of the new 'cabbage' node to point to 'lettuce'.
5) Update the next pointer of 'asparagus' to point to the new 'cabbage' node.
Part (ii) Explain why deleting the first node differs from deleting internal nodes (2 marks):
When deleting an internal node, the previous node's next pointer is redirected to bypass the deleted node. When deleting the first node, there is no previous node; instead, the external head pointer ('First') itself must be updated to point to the second node.

Mentor tip

For insertion, point new node to next node before updating previous node's pointer. For head deletion, note that external head pointer itself must be modified.

(d)

1 mark

State dynamic data structure that enables faster searching than a linear linked list:
Binary Search Tree (BST) / Self-balancing Binary Search Tree (AVL or Red-Black Tree).

Mentor tip

Name Binary Search Tree (BST).

(e)

3 marks

Construct BST by inserting names in order [potato, asparagus, lettuce, radish]:
1) Insert 'potato' -> Root = 'potato'.
2) Insert 'asparagus' -> 'asparagus' < 'potato' -> Left child of 'potato'.
3) Insert 'lettuce' -> 'lettuce' < 'potato', 'lettuce' > 'asparagus' -> Right child of 'asparagus'.
4) Insert 'radish' -> 'radish' > 'potato' -> Right child of 'potato'.
Resulting tree hierarchy:
potato
/ \
asparagus radish
\
lettuce

Mentor tip

Trace insertion: potato is root, asparagus is left, lettuce is right of asparagus, radish is right of potato.

Question 12

15 marks

Variable swapping logic, matrix row exchange, and selection sort algorithmic orchestration

Computational thinking, problem-solving and programming

(a)

3 marks

Analyze buggy variable swap algorithm:
Code given: TEMP = A; B = TEMP; A = B.
Part (i) Trace with A = 3, B = 5 (1 mark):
- TEMP = 3
- B = 3 (Original value of B=5 is overwritten and destroyed!)
- A = 3
Final values: A = 3, B = 3.
Part (ii) Correct algorithm modification (2 marks):
The original value of B must be assigned to A before B is assigned TEMP. Swap lines 2 and 3:
TEMP = A
A = B
B = TEMP

Mentor tip

Notice that overwriting B first loses its original value; assign A = B first, then B = TEMP.

(b)

4 marks

Construct procedure swapRows(MAT, K, L) for 2D array with 4 columns (indices 0 to 3):
procedure swapRows(MAT, K, L)
loop COL from 0 to 3
swap(MAT[K][COL], MAT[L][COL])
end loop
end procedure
Alternative using explicit temporary variable:
procedure swapRows(MAT, K, L)
loop COL from 0 to 3
TEMP = MAT[K][COL]
MAT[K][COL] = MAT[L][COL]
MAT[L][COL] = TEMP
end loop
end procedure

Mentor tip

Loop across columns 0 to 3, swapping elements MAT[K][COL] and MAT[L][COL] either directly or via method swap().

(c)

2 marks

Retrieve data from player array tables:
Part (i) State Paul's total score (1 mark):
Locate 'Paul' in PLAYERS: index 3.
Look up TOTALS[3] -> 105.
Part (ii) Identify location of Hugh's fourth round score (1 mark):
Locate 'Hugh' in PLAYERS: index 2.
Fourth round corresponds to round index 3.
Location in matrix: ROUNDS[2][3] (value is 90).

Mentor tip

Paul is index 3 in TOTALS (105). Hugh is index 2, fourth round is column 3: ROUNDS[2][3].

(d)

6 marks

Construct selection sort algorithm to sort parallel arrays in ascending order of TOTALS:
loop I from 0 to 4
MIN_IDX = I
loop J from I + 1 to 5
if TOTALS[J] < TOTALS[MIN_IDX] then
MIN_IDX = J
end if
end loop
if MIN_IDX != I then
swap(TOTALS[I], TOTALS[MIN_IDX])
swap(PLAYERS[I], PLAYERS[MIN_IDX])
swapRows(ROUNDS, I, MIN_IDX)
end if
end loop

Outer loop: I \in [0, 4], Inner loop: J \in [I + 1, 5]

Mentor tip

Maintain synchronization across all three parallel structures: when swapping TOTALS, simultaneously swap PLAYERS and call swapRows(ROUNDS, I, MIN_IDX).

Our analysis

Where the marks are

Each part sorted by the topic it mostly tests. Computational thinking, problem-solving and programming carries the most marks on this paper.

Computational thinking, problem-solving and programming27 marks · 27%
Q9, Q12
Abstract data structures21 marks · 21%
Q6, Q9, Q11
Computer organisation18 marks · 18%
Q3, Q8
Control systems12 marks · 12%
Q10
Networks11 marks · 11%
Q1, Q4, Q5, Q10
System fundamentals8 marks · 8%
Q2, Q4, Q10
Resource management3 marks · 3%
Q7

Mentor insights

Traps to watch for

01
Stack underflow from missing isEmpty() boundary guard · Q6
Popping from an empty stack triggers a fatal stack underflow error. Every pop operation must be preceded by an isEmpty() validation check.
02
Pointer update order during linked list node insertion · Q11
When inserting 'cabbage' between 'asparagus' and 'lettuce', you must set cabbage.next = asparagus.next (lettuce) BEFORE setting asparagus.next = cabbage. Reversing this sequence breaks the pointer chain and orphans the rest of the list.
03
Accidental variable overwriting in 3-variable swap · Q12
Executing B = TEMP before A = B causes the original value of B to be completely lost. The correct sequence is TEMP = A; A = B; B = TEMP.
04
Parallel array synchronization in selection sort · Q12
When sorting parallel arrays (PLAYERS, TOTALS, ROUNDS), finding the minimum index in TOTALS requires swapping elements across ALL three structures at that exact index to prevent data misalignment.

Solutions and tips are GeorgeTheTutor's own; the questions are not reproduced here. Not affiliated with or endorsed by the International Baccalaureate Organization.

Want someone to go through your paper with you?

Our maths mentors took these exams recently. One-to-one, they'll find where your marks are going and fix it before May.

Find your maths mentor More past papers

Worked solutions

IB Computer Science HL · Paper 1

Computer Science, Higher Level

Session: November 2018
Marks: 100
Duration: 2 hours 10 min
Calculator: Not allowed
Questions: 12

Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12

Keep your copy of the paper open alongside. We don't reproduce the questions: each part below is labelled to match the November 2018 global paper, which your school or the IB can provide.

Practice mode

Hide our working until you've had a go.

Questions 1–7 · 25 marks

Question 1

4 marks

Computer network definition and low bandwidth implications

Networks

(a)

2 marks

Define a computer network:
1) An interconnected collection of autonomous computers, servers, and peripheral hardware devices.
2) Linked via wired or wireless transmission media (cables, optical fiber, radio frequencies) to facilitate data communication and resource sharing among users.

Mentor tip

State that multiple computing devices are connected together via physical or wireless communication channels to share data and hardware resources.

(b)

2 marks

Describe a problem resulting from low bandwidth:
1) Low bandwidth restricts the maximum data volume transmitted per second, leading to elevated network congestion and high transmission latency.
2) Consequently, file transfers take prolonged durations, streaming multimedia experiences buffering or packet dropouts, and real-time interactive business applications become unresponsive.

Mentor tip

Define bandwidth as data capacity over time, and explain how constrained throughput causes delays and degraded service.

Question 2

2 marks

Direct observation advantages and disadvantages in requirements analysis

System fundamentals

(a)

1 mark

Identify an advantage of direct observation:
Allows the systems analyst to observe end-users executing operational workflows in their natural working environment, capturing firsthand, unbiased reality rather than what users claim they do.

Mentor tip

Focus on observing real operational behavior in natural setting without reliance on subjective recollection.

(b)

1 mark

Identify a disadvantage of direct observation:
The Hawthorne effect: Users who are aware of being watched may alter their standard behavior, follow procedures more rigidly, or work unnaturally slowly; additionally, the technique is time-consuming for the analyst.

Mentor tip

Note observer bias or behavioral alteration (Hawthorne effect) when subjects know they are being observed.

Question 3

3 marks

Logic diagram representation of Boolean expression

Computer organisation

(a)

3 marks

Construct logic diagram for Boolean expression: \text{not } A \text{ or } (A \text{ and } B)
1) Connect input line A to a NOT gate (inverter) to produce intermediate signal \neg A.
2) Connect input lines A and B to a 2-input AND gate to produce intermediate signal (A \land B).
3) Connect intermediate outputs \neg A and (A \land B) into a 2-input OR gate to generate final output Z.

Z = \neg A \lor (A \land B) = \neg A \lor B

Mentor tip

Diagram includes 2 inputs (A, B), 3 gates (NOT, AND, OR), and 1 output.

Question 4

6 marks

International data migration compatibility, VPN communication, and social impact

System fundamentals
Networks

(a)

2 marks

Identify two data migration compatibility issues when moving headquarters between Europe and Asia:
1) Character encoding and language differences: Incompatible text standards (e.g., legacy ASCII/ISO vs Unicode/UTF-8 for Asian non-Latin character scripts).
2) Cultural data formatting conventions: Discrepancies in date representations (DD/MM/YYYY vs YYYY/MM/DD), address hierarchy structures, and currency symbol and precision standards.

Mentor tip

Highlight character set / encoding mismatches and differing date, currency, or unit formatting conventions.

(b)

2 marks

Outline how a Virtual Private Network (VPN) enables secure cross-continent communication:
1) Establishes an encrypted point-to-point tunnel over the public internet connecting European branch offices with Asian headquarters.
2) Encrypts all transmitted IP data packets, guaranteeing data confidentiality and integrity while masking internal IP addresses from external interception.

Mentor tip

Explain encrypted tunneling over the public internet providing secure, confidential communication between remote offices.

(c)

2 marks

Outline one social issue associated with relocating corporate headquarters:
Workplace disruption and job redundancy: Employees unable or unwilling to relocate to Asia face job displacement, loss of income, and career disruption. Conversely, relocating staff face cultural adaptation, family relocation stresses, and language barriers.

Mentor tip

Focus on human impact: job loss/redundancy or relocation stress and cultural adjustment.

Question 5

4 marks

Operational mechanism of packet switching across wide area networks

Networks

(a)

4 marks

Describe data transmission via packet switching:
1) Packetization: The source computer breaks the raw message stream into discrete, standardized units called packets, attaching header metadata (source IP, destination IP, packet sequence number, error checksum).
2) Independent routing: Intermediate routers evaluate packet destination addresses dynamically, forwarding individual packets along different optimal pathways across the network based on real-time traffic conditions.
3) Reassembly and error recovery: Upon reaching the destination, packets are reordered into their original sequence using their sequence numbers. If a packet is corrupt or missing according to checksum validation, a retransmission request is triggered.

Mentor tip

Describe breaking data into packets with headers, dynamic routing along independent paths, and destination reassembly with error checking.

Question 6

3 marks

Role and importance of isEmpty() method in stack algorithm design

Abstract data structures

(a)

3 marks

Explain the importance of calling isEmpty() during stack operations:
1) Method behavior: isEmpty() evaluates the internal stack pointer and returns a boolean value (True if the stack contains zero elements, False otherwise).
2) Prevention of stack underflow: Popping an element from an empty stack generates an illegal state exception (stack underflow) that will crash the program.
3) Loop termination: Serves as the mandatory boundary condition in control loops (e.g., 'while not STACK.isEmpty()') to ensure elements are processed until exhaustion without attempting out-of-bounds memory accesses.

Mentor tip

State that it returns boolean empty status, prevents catastrophic stack underflow on pop(), and provides safe loop termination.

Question 7

3 marks

Comparison of time slicing and priority scheduling in operating systems

Resource management

(a)

3 marks

Distinguish between time slicing and priority-based process scheduling:
1) Time slicing (Round Robin): The CPU scheduler assigns each active process a predetermined, equal quantum of processor time (time slice). When the timer expires, the running process is preempted and placed at the back of the ready queue, ensuring fair CPU distribution regardless of process type.
2) Priority scheduling: Each process is assigned an explicit priority weighting (e.g., critical real-time I/O interrupts have higher priority than background compute jobs). The scheduler always grants the CPU to the highest-priority runnable process.
3) Preemption and starvation: Priority scheduling allows urgent tasks to preempt lower tasks immediately, but risks starvation of low-priority processes unless aging mechanisms are applied, unlike democratic time slicing.

Mentor tip

Contrast equal fixed time quanta (round robin) with priority-ranked queues where high-priority jobs execute first.

Questions 8–12 · 75 marks

Question 8

15 marks

Primary memory hierarchy, system bus architecture, and character encodings

Computer organisation

(a)

5 marks

Part (i) Distinguish between RAM and ROM (3 marks):
- Volatility: RAM is volatile (contents are lost upon power interruption), whereas ROM is non-volatile (contents persist permanently without power).
- Read/Write capability: RAM supports both read and write operations at runtime, whereas ROM is strictly read-only in standard operation.
- Contents and purpose: RAM holds running application instructions, operating system kernel modules, and live working data. ROM stores immutable system firmware, such as BIOS/UEFI bootloader routines required to initialize hardware at startup.
Part (ii) Primary memory management role of operating system (2 marks):
- Dynamic address allocation: Allocates contiguous physical memory frames or virtual pages to application processes upon request, and reclaims/de-allocates memory when processes terminate.
- Memory protection and isolation: Enforces boundary checks so processes cannot corrupt adjacent memory segments, utilizing paging to secondary storage when RAM is exhausted.

Mentor tip

Cover volatility, read/write ability, and boot vs runtime roles for RAM/ROM. For OS memory management, detail allocation, deallocation, and virtual memory.

(b)

4 marks

Explain the distinct roles of the address bus and data bus during instruction execution:
1) System bus definition: Parallel electronic communication channels connecting the CPU registers to primary RAM.
2) Address bus: Unidirectional bus driven by the CPU (MAR). Carries the physical memory address specifying the target RAM location to read from or write to.
3) Data bus: Bidirectional bus carrying the actual instruction word or data operand between primary memory and the processor's Memory Data Register (MDR).
4) Execution cycle coordination: During fetch, the CPU places the instruction address on the address bus, signals a memory read, and retrieves the returned opcode across the data bus into the MDR.

Mentor tip

Highlight unidirectional address bus carrying location pointers from MAR vs bidirectional data bus carrying actual content to/from MDR.

(c)

4 marks

Evaluate the binary byte 0101 1110:
Part (i) Convert byte to hexadecimal (1 mark):
Split into two 4-bit nibbles: 0101_2 = 5_{16}, and 1110_2 = E_{16}.
Hexadecimal value = 5E.
Part (ii) State total distinct integers representable in 1 byte (1 mark):
2^8 = 256 distinct integer values (0 to 255 unsigned, or -128 to +127 in two's complement).
Part (iii) Explain why 1 byte cannot encode Chinese characters (2 marks):
A single byte provides at most 2^8 = 256 unique code points, which is sufficient for small alphabetic alphabets (Latin alphabet, punctuation, control codes). Chinese ideographic script contains tens of thousands of unique characters, necessitating multi-byte encodings (such as UTF-8 or UTF-16, requiring at least 2 to 3 bytes per character).

010 1_{2} = 5_{16}, 111 0_{2} = 1 4_{10} = E_{16} ⟹ 5 E_{16} 2^{8} = 256 ≪ Number of Chinese logograms (> 50,000)

Mentor tip

Split into nibbles 0101 (5) and 1110 (E). 1 byte gives 256 combinations, vastly insufficient for thousands of ideographic logograms.

(d)

2 marks

Construct truth table for equivalence condition (Output is True when inputs are equal):
Input A | Input B | Output C (XNOR)
0 | 0 | 1 (True)
0 | 1 | 0 (False)
1 | 0 | 0 (False)
1 | 1 | 1 (True)

C = (A \land B) \lor (\neg A \land \neg B) = \neg (A \oplus B)

Mentor tip

This represents the XNOR equivalence logic gate: output is 1 when both inputs match (0,0 or 1,1).

Question 9

15 marks

High-level languages, modular sub-procedures, and collection interval filtering

Computational thinking, problem-solving and programming
Abstract data structures

(a)

2 marks

Outline the necessity for high-level programming languages:
1) Human abstraction and productivity: High-level languages use human-readable syntax and structured abstractions (loops, conditional logic, complex data structures) rather than cryptic binary opcodes, drastically accelerating developer productivity.
2) Hardware portability and machine independence: High-level source code compiles or interprets across diverse CPU architectures without requiring knowledge of machine-level register sets and instruction encoding.

Mentor tip

Focus on programmer productivity, readability, and machine independence.

(b)

4 marks

Explain two distinct benefits of sub-procedures (methods/functions) in program construction:
Benefit 1: Code Reusability and Maintainability: A procedure written and verified once can be invoked from multiple call sites across the program, reducing redundant code and isolating modifications to a single modular location.
Benefit 2: Problem Decomposition and Team Collaboration: Complex software tasks are broken into manageable sub-tasks (top-down functional decomposition). Individual team members can develop, debug, and unit-test separate modules concurrently without interfering with other modules.

Mentor tip

Explain code reuse/easier maintenance and top-down problem decomposition/collaborative development.

(c)

3 marks

Identify three key characteristics of a collection data structure:
1) Abstract container of elements: Groups discrete data items into a single container entity, dynamically managing element storage.
2) Encapsulated access methods: Provides standardized iterator and mutation methods (e.g., resetNext(), hasNext(), getNext(), addItem(), isEmpty()) hiding underlying memory layout.
3) Dynamic sizing and type flexibility: Can grow and shrink dynamically at runtime, holding primitive values or heterogeneous complex object references.

Mentor tip

Mention encapsulated methods (hasNext, getNext), dynamic container capacity, and abstraction over underlying physical memory structures.

(d)

6 marks

Construct pseudocode to iterate collection NUMBERS and count elements within interval [-1, 1]:
COUNTER = 0
NUMBERS.resetNext()
while NUMBERS.hasNext()
ELEMENT = NUMBERS.getNext()
if ELEMENT >= -1.0 and ELEMENT <= 1.0 then
COUNTER = COUNTER + 1
end if
end while
output COUNTER

- 1 \leq x \leq 1 ⟺ ∣ x ∣ \leq 1

Mentor tip

Remember to call NUMBERS.resetNext() before the loop, fetch each value using getNext(), check interval bounds inclusive, and print the counter.

Question 10

15 marks

Industrial pipeline leak detection control system and flowchart modeling

System fundamentals
Networks
Control systems

(a)

2 marks

Identify security measures for confidential Head Office data:
Part (i) Hardware security measure (1 mark): Biometric access locks (fingerprint/retina scanners), electronic keycard access to server rooms, or physical chassis lock enclosures.
Part (ii) Software security measure (1 mark): Role-Based Access Control (RBAC) permissions, robust user password policies with MFA, or symmetric/asymmetric file-level data encryption.

Mentor tip

Give one physical hardware measure (locked door/biometrics) and one software measure (passwords/encryption/access rights).

(b)

1 mark

Identify one network security measure for remote site communication:
Virtual Private Network (VPN) with end-to-end IPsec encryption (or network firewalls / trusted MAC address filtering).

Mentor tip

Name VPN tunneling, transport encryption, or firewall filtering.

(c)

3 marks

Explain environmental benefits of a computer control system monitoring subsea pipelines:
1) Continuous 24/7 autonomous monitoring: Monitors pressure and flow sensors uninterruptedly without human fatigue, detecting anomalous micro-drops instantly.
2) Rapid automated isolation: Upon detecting leak parameters, the system triggers automated shutoff valves within milliseconds, halting oil flow and minimizing oceanic pollution and ecological damage.
3) Proactive disaster mitigation: Prevents catastrophic pipeline ruptures that would devastate marine wildlife and coastal ecosystems.

Mentor tip

Highlight instant response/automated valve shutoff, continuous 24/7 reliability, and minimizing ecological contamination.

(d)

4 marks

Explain the relationship between sensors, output transducers, and processor in this leak detection system:
1) Sensor input: Subsea flow and pressure sensors continuously measure physical quantities, converting them into continuous analog electrical signals.
2) Analog-to-Digital Conversion (ADC): The analog signals are digitized by an ADC so the digital processor can read them.
3) Processor evaluation: The microprocessor compares the digital readings against baseline operating parameters retrieved from disk.
4) Output transducer actuation: If values fall outside tolerable thresholds, the processor transmits digital signals (converted via DAC/relay switches) to output transducers, sounding audible alarms and activating emergency valve shutoff actuators.

Mentor tip

Explain the flow: physical sensors -> ADC -> processor logic comparison -> output transducers/actuators (audible alarm, shutoff valves).

(e)

5 marks

Construct system flowchart representing the leak monitoring process:
1) Input symbol: Flow and pressure sensor readings received into system.
2) Manual input / storage: System parameters loaded from disk (with staff configuration manual input option).
3) Processing block: Processor compares incoming sensor readings against baseline parameters from storage.
4) Decision symbol (Is sensor value within tolerable parameter limits?):
- YES path: Loop back to continue continuous sensor sampling.
- NO path (Leak condition detected):
5) Output / Action blocks: Trigger error routine -> sound audible alarm on office computer AND dispatch automated emergency email alert to Head Office managers.

Mentor tip

Include sensor input, disk parameter access, comparison decision diamond, normal monitoring loop, and error routine branches (alarm, alert email).

Question 11

15 marks

Alphabetical linked list mutation, head node deletion, and binary tree mapping

Abstract data structures

(a)

3 marks

Compare dynamic linked list with static 1D array for maintaining sorted vegetable names:
1) Dynamic sizing: A linked list allocates nodes on demand from the heap, expanding and contracting without fixed capacity limits or memory wastage, whereas an array has a fixed compile-time size.
2) Insertion and deletion efficiency: Adding or removing an item in a sorted linked list requires only redirecting node pointer references (O(1) pointer updates once located). In an array, inserting or deleting requires shifting all subsequent elements in memory.
3) Memory overhead: Linked list nodes incur additional memory overhead to store pointer references for every data element.

Mentor tip

Contrast dynamic heap allocation with static array limits, and pointer relinking with costly array element shifts.

(b)

2 marks

Sketch singly linked list holding [asparagus, lettuce, potato, radish] in alphabetical order:
1) External head pointer 'First' points to first node: [ 'asparagus' | next ].
2) 'asparagus'.next points to [ 'lettuce' | next ].
3) 'lettuce'.next points to [ 'potato' | next ].
4) 'potato'.next points to [ 'radish' | null ].
5) 'radish' contains a null pointer representing end-of-list.

Mentor tip

Show external Head pointer, alphabetical node chain (asparagus -> lettuce -> potato -> radish), and final null pointer.

(c)

6 marks

Part (i) List steps to insert 'cabbage' into sorted linked list (4 marks):
1) Allocate a new node containing the data value 'cabbage' and set its next pointer to null.
2) Traverse the list from the head pointer, comparing 'cabbage' alphabetically against each node's value.
3) Identify the insertion position between 'asparagus' and 'lettuce' (since 'asparagus' < 'cabbage' < 'lettuce').
4) Set the next pointer of the new 'cabbage' node to point to 'lettuce'.
5) Update the next pointer of 'asparagus' to point to the new 'cabbage' node.
Part (ii) Explain why deleting the first node differs from deleting internal nodes (2 marks):
When deleting an internal node, the previous node's next pointer is redirected to bypass the deleted node. When deleting the first node, there is no previous node; instead, the external head pointer ('First') itself must be updated to point to the second node.

Mentor tip

For insertion, point new node to next node before updating previous node's pointer. For head deletion, note that external head pointer itself must be modified.

(d)

1 mark

State dynamic data structure that enables faster searching than a linear linked list:
Binary Search Tree (BST) / Self-balancing Binary Search Tree (AVL or Red-Black Tree).

Mentor tip

Name Binary Search Tree (BST).

(e)

3 marks

Construct BST by inserting names in order [potato, asparagus, lettuce, radish]:
1) Insert 'potato' -> Root = 'potato'.
2) Insert 'asparagus' -> 'asparagus' < 'potato' -> Left child of 'potato'.
3) Insert 'lettuce' -> 'lettuce' < 'potato', 'lettuce' > 'asparagus' -> Right child of 'asparagus'.
4) Insert 'radish' -> 'radish' > 'potato' -> Right child of 'potato'.
Resulting tree hierarchy:
potato
/ \
asparagus radish
\
lettuce

Mentor tip

Trace insertion: potato is root, asparagus is left, lettuce is right of asparagus, radish is right of potato.

Question 12

15 marks

Variable swapping logic, matrix row exchange, and selection sort algorithmic orchestration

Computational thinking, problem-solving and programming

(a)

3 marks

Analyze buggy variable swap algorithm:
Code given: TEMP = A; B = TEMP; A = B.
Part (i) Trace with A = 3, B = 5 (1 mark):
- TEMP = 3
- B = 3 (Original value of B=5 is overwritten and destroyed!)
- A = 3
Final values: A = 3, B = 3.
Part (ii) Correct algorithm modification (2 marks):
The original value of B must be assigned to A before B is assigned TEMP. Swap lines 2 and 3:
TEMP = A
A = B
B = TEMP

Mentor tip

Notice that overwriting B first loses its original value; assign A = B first, then B = TEMP.

(b)

4 marks

Construct procedure swapRows(MAT, K, L) for 2D array with 4 columns (indices 0 to 3):
procedure swapRows(MAT, K, L)
loop COL from 0 to 3
swap(MAT[K][COL], MAT[L][COL])
end loop
end procedure
Alternative using explicit temporary variable:
procedure swapRows(MAT, K, L)
loop COL from 0 to 3
TEMP = MAT[K][COL]
MAT[K][COL] = MAT[L][COL]
MAT[L][COL] = TEMP
end loop
end procedure

Mentor tip

Loop across columns 0 to 3, swapping elements MAT[K][COL] and MAT[L][COL] either directly or via method swap().

(c)

2 marks

Retrieve data from player array tables:
Part (i) State Paul's total score (1 mark):
Locate 'Paul' in PLAYERS: index 3.
Look up TOTALS[3] -> 105.
Part (ii) Identify location of Hugh's fourth round score (1 mark):
Locate 'Hugh' in PLAYERS: index 2.
Fourth round corresponds to round index 3.
Location in matrix: ROUNDS[2][3] (value is 90).

Mentor tip

Paul is index 3 in TOTALS (105). Hugh is index 2, fourth round is column 3: ROUNDS[2][3].

(d)

6 marks

Construct selection sort algorithm to sort parallel arrays in ascending order of TOTALS:
loop I from 0 to 4
MIN_IDX = I
loop J from I + 1 to 5
if TOTALS[J] < TOTALS[MIN_IDX] then
MIN_IDX = J
end if
end loop
if MIN_IDX != I then
swap(TOTALS[I], TOTALS[MIN_IDX])
swap(PLAYERS[I], PLAYERS[MIN_IDX])
swapRows(ROUNDS, I, MIN_IDX)
end if
end loop

Outer loop: I \in [0, 4], Inner loop: J \in [I + 1, 5]

Mentor tip

Maintain synchronization across all three parallel structures: when swapping TOTALS, simultaneously swap PLAYERS and call swapRows(ROUNDS, I, MIN_IDX).

Our analysis

Where the marks are

Each part sorted by the topic it mostly tests. Computational thinking, problem-solving and programming carries the most marks on this paper.

Computational thinking, problem-solving and programming27 marks · 27%
Q9, Q12
Abstract data structures21 marks · 21%
Q6, Q9, Q11
Computer organisation18 marks · 18%
Q3, Q8
Control systems12 marks · 12%
Q10
Networks11 marks · 11%
Q1, Q4, Q5, Q10
System fundamentals8 marks · 8%
Q2, Q4, Q10
Resource management3 marks · 3%
Q7

Mentor insights

Traps to watch for

01
Stack underflow from missing isEmpty() boundary guard · Q6
Popping from an empty stack triggers a fatal stack underflow error. Every pop operation must be preceded by an isEmpty() validation check.
02
Pointer update order during linked list node insertion · Q11
When inserting 'cabbage' between 'asparagus' and 'lettuce', you must set cabbage.next = asparagus.next (lettuce) BEFORE setting asparagus.next = cabbage. Reversing this sequence breaks the pointer chain and orphans the rest of the list.
03
Accidental variable overwriting in 3-variable swap · Q12
Executing B = TEMP before A = B causes the original value of B to be completely lost. The correct sequence is TEMP = A; A = B; B = TEMP.
04
Parallel array synchronization in selection sort · Q12
When sorting parallel arrays (PLAYERS, TOTALS, ROUNDS), finding the minimum index in TOTALS requires swapping elements across ALL three structures at that exact index to prevent data misalignment.

Solutions and tips are GeorgeTheTutor's own; the questions are not reproduced here. Not affiliated with or endorsed by the International Baccalaureate Organization.

Want someone to go through your paper with you?

Our maths mentors took these exams recently. One-to-one, they'll find where your marks are going and fix it before May.

Find your maths mentor More past papers