Loading…

Worked solutions

IB Computer Science HL · Paper 1

Computer Science, Higher Level

Session: November 2014
Marks: 100
Duration: 2 hours 10 min
Calculator: Not allowed
Questions: 14

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

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

Practice mode

Hide our working until you've had a go.

Questions 1–9 · 25 marks

Question 1

3 marks

Spreadsheet features and operating system role

System fundamentals
Computer organisation

(a)

2 marks

Outline two distinct functional characteristics of spreadsheet applications:
1) Grid-based addressable matrix: Data is organized into intersecting rows and columns forming individual cells referenced by coordinate labels (e.g., B4).
2) Dynamic formula recalculation: Built-in mathematical and statistical functions automatically recompute output values whenever underlying cell values change.

Mentor tip

State two distinctive traits: cell grid structuring and automatic formula recalculation.

(b)

1 mark

Define the term operating system:
Core system software that manages physical hardware resources, supervises processor scheduling and memory allocation, and provides foundational platform services for application execution.

Mentor tip

Emphasize management of physical computer hardware and system resources.

Question 2

1 mark

Function of the Arithmetic Logic Unit (ALU)

Computer organisation

(a)

1 mark

Outline the fundamental purpose of the CPU's ALU:
Executes all elementary arithmetic computations (such as addition and subtraction) alongside bitwise logical decisions (AND, OR, NOT, comparisons) mandated by instruction machine codes.

Mentor tip

Specify that the ALU performs arithmetic calculations and logical operations.

Question 3

2 marks

Relationship between binary and hexadecimal representations

Computer organisation

(a)

2 marks

Outline the mathematical relationship linking binary and hexadecimal numbering:
1) Base power equivalence: Binary is base 2 while hexadecimal is base 16; since 2^4 = 16, sixteen is an exact power of two.
2) Direct 4-bit nibble grouping: Exactly four binary digits (bits) correspond to a single hexadecimal character, allowing compact human-readable transcription of long binary byte streams.

2^{4} = 16

Mentor tip

State that 16 = 2^4, so each single hexadecimal digit represents exactly four binary bits.

Question 4

4 marks

Stack abstract data structure characteristics and applications

Abstract data structures

(a)

2 marks

Describe the operational characteristics of a stack:
1) Single-ended linear structure: A collection where insertion and removal operations are strictly restricted to one terminal boundary termed the top of the stack.
2) LIFO access discipline: Operates under Last-In, First-Out behavior, meaning the most recently pushed element is the first element popped.

Mentor tip

Mention the single-ended point of access and the Last-In, First-Out (LIFO) protocol.

(b)

2 marks

Identify two computing applications of a stack:
1) Call stack management: Preserves subroutine return addresses, parameters, and local activation frames during nested or recursive procedure execution.
2) Expression parsing and evaluation: Converts infix mathematical expressions to reverse Polish notation (postfix) and validates balanced syntactic brackets in compilers.

Mentor tip

Name practical applications such as function call return address tracking or syntax bracket parsing.

Question 5

4 marks

Boolean logic truth table construction for XOR expression

Computer organisation

(a)

4 marks

Construct the complete truth table for Boolean expression X = (not A and B) or (A and not B):
Row 1 [A = 0, B = 0]: (not 0 and 0) or (0 and not 0) = (1 and 0) or (0 and 1) = 0 or 0 = 0
Row 2 [A = 0, B = 1]: (not 0 and 1) or (0 and not 1) = (1 and 1) or (0 and 0) = 1 or 0 = 1
Row 3 [A = 1, B = 0]: (not 1 and 0) or (1 and not 0) = (0 and 0) or (1 and 1) = 0 or 1 = 1
Row 4 [A = 1, B = 1]: (not 1 and 1) or (1 and not 1) = (0 and 1) or (1 and 0) = 0 or 0 = 0

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

Mentor tip

Recognize this classic Exclusive-OR (XOR) pattern: output is 1 when inputs differ, and 0 when inputs match.

Question 6

3 marks

Modular programming advantages of sub-programs

Computational thinking, problem-solving and programming

(a)

3 marks

State three distinct advantages of utilizing sub-programs (procedures/functions):
1) Modular decomposition: Decomposes large, complex software problems into smaller, manageable, and logically isolated modules.
2) Code reuse without duplication: A sub-program can be invoked from multiple locations across different programs, reducing total codebase volume.
3) Independent testing and maintenance: Individual sub-routines can be developed and unit-tested in isolation, allowing localized debugging without impacting unrelated components.

Mentor tip

Highlight modular problem division, reusability across programs, and independent unit testing/maintenance.

Question 7

3 marks

Algorithmic flowchart trace table execution

Computational thinking, problem-solving and programming

(a)

3 marks

Trace the algorithm step-by-step to identify the exact outputs produced:
Initialization: K = 3, P = 1.
Iteration 1: Condition K > 1 (3 > 1) evaluates to true.
- Output K: prints 3.
- Output P: prints 1.
- Decrement K: K = 3 - 1 = 2.
- Update P: P = 1 * 2 = 2.
Iteration 2: Condition K > 1 (2 > 1) evaluates to true.
- Output K: prints 2.
- Output P: prints 2.
- Decrement K: K = 2 - 1 = 1.
- Update P: P = 2 * 1 = 2.
Iteration 3: Condition K > 1 (1 > 1) evaluates to false -> terminates.
Sequential outputs: 3, 1, 2, 2.

Mentor tip

Notice that outputs occur BEFORE the variables K and P are updated within each loop iteration.

Question 8

2 marks

Definition and mechanism of device polling

Resource management

(a)

2 marks

Define the computer control technique of polling:
1) Sequential status interrogation: A central control unit or CPU systematically queries peripheral devices or network nodes one by one to check their operational readiness or data pending status.
2) Deterministic periodic scheduling: Polling checks occur at predetermined regular time intervals, contrasting with event-driven interrupt handling.

Mentor tip

Define polling as periodic, systematic interrogation of peripheral status by a central controller.

Question 9

3 marks

Network communication protocols and necessity

Networks

(a)

1 mark

Define the term network protocol:
A formalized set of rules, syntax specifications, and transmission standards governing the reliable exchange of data between communicating entities across a network.

Mentor tip

Define as a standardized set of rules and conventions governing data transmission.

(b)

2 marks

Outline two reasons why protocols are essential in networked communication:
1) Data integrity and error control: Standardized parity/checksum algorithms detect frame corruption during transit and mandate retransmission.
2) Flow control and deadlock avoidance: Negotiates packet transmission rates between fast senders and slow receivers, preventing buffer overflow and communication deadlock.

Mentor tip

Mention error detection/correction mechanisms and flow control to prevent buffer saturation.

Questions 10–14 · 75 marks

Question 10

15 marks

Retail point-of-sale processing, headquarters synchronization, and data loss prevention

System fundamentals

(a)

5 marks

Describe the logical flow and standard symbols of the in-store POS system flowchart:
1) Input symbol: Manual barcode scan / payment card reader captures transaction details and card credentials.
2) Process symbol: In-store terminal queries local daily price database downloaded from headquarters.
3) Telecommunication link: Encrypted online transmission to external Card Authorization Centre.
4) Decision symbol: Branch on whether authorization approval is received (Yes -> continue, No -> decline transaction).
5) Output and storage symbols: Receipt is output to printer, while transaction details are saved to local persistent storage for end-of-day batch upload.

Mentor tip

Identify each standard flowchart symbol: input device, local database lookup, remote authorization link, decision branch, and receipt print.

(b)

2 marks

Describe the nightly processing carried out at company headquarters:
1) Batch inventory reconciliation: Processes transaction batches from all retail branches to decrement stock levels in the enterprise database and trigger automated warehouse restocking.
2) Financial auditing and analytics: Consolidates revenue metrics, audits card transactions, and prepares daily regional management sales reports.

Mentor tip

Identify batch updates to the central inventory database and consolidated financial audit reporting.

(c)

3 marks

Identify three distinct causes of organizational data loss:
1) Hardware malfunction: Physical storage device breakdown, such as mechanical hard disk head crashes or storage controller failure.
2) Malicious cyber activity: External malware, ransomware encryption, or hostile intrusions by rogue actors.
3) Human error or environmental disasters: Accidental record deletion by operators, power surges, or facility fires and floods.

Mentor tip

List three distinct categories: hardware failure, malicious malware/hacking, and human error or physical disaster.

(d)

3 marks

Explain why data loss poses a far more severe threat than the loss of hardware or software:
1) Replaceability via capital vs uniqueness: Lost hardware can be readily repurchased and replaced under equipment insurance; off-the-shelf software can be cleanly reinstalled from original media or cloud repositories.
2) Irreplaceable historical records: Proprietary transactional customer histories, accounting ledgers, and order records are unique and cannot be reconstructed if destroyed without backups.
3) Legal and financial fallout: Loss of proprietary client data results in severe regulatory privacy fines, lawsuits, lost business trust, and corporate failure.

Mentor tip

Contrast replaceable hardware/software against unique, irreplaceable enterprise data and the associated legal/business consequences.

(e)

2 marks

Identify two effective strategies to prevent organizational data loss:
1) Regular automated offsite backups: Creating scheduled, versioned data backups stored in geographically separate cloud repositories, coupled with regular restoration drills.
2) Strict access controls and encryption: Enforcing role-based access permissions, multi-factor authentication, and cryptographic data protection to block unauthorized modification or accidental deletion.

Mentor tip

Specify automated offsite/cloud backup schedules alongside role-based access control and encryption.

Question 11

15 marks

Magic square verification and matrix construction algorithms

Computational thinking, problem-solving and programming

(a)

2 marks

Construct an algorithm to compute the sum of the main diagonal elements in a 7x7 matrix A:
SUM = 0
loop K from 0 to 6
SUM = SUM + A[K][K]
end loop
output SUM

Mentor tip

Iterate single index K from 0 to 6, accumulating elements where row and column indices match: A[K][K].

(b)

8 marks

Construct an algorithm to verify whether an n x n array is a magic square:
IS_MAGIC = true
TARGET_SUM = 0
// Calculate reference sum from primary diagonal
loop K from 0 to n - 1
TARGET_SUM = TARGET_SUM + A[K][K]
end loop
// Check secondary diagonal
SEC_SUM = 0
loop K from 0 to n - 1
SEC_SUM = SEC_SUM + A[K][n - 1 - K]
end loop
if SEC_SUM != TARGET_SUM then
IS_MAGIC = false
end if
// Check every row and column sum
ROW = 0
loop while ROW < n and IS_MAGIC
ROW_SUM = 0
COL_SUM = 0
loop COL from 0 to n - 1
ROW_SUM = ROW_SUM + A[ROW][COL]
COL_SUM = COL_SUM + A[COL][ROW]
end loop
if ROW_SUM != TARGET_SUM or COL_SUM != TARGET_SUM then
IS_MAGIC = false
end if
ROW = ROW + 1
end loop
if IS_MAGIC then
output "The array is a magic square"
else
output "The array is not a magic square"
end if

Mentor tip

Check primary diagonal, secondary diagonal (using index n - 1 - K), and all row/column sums against TARGET_SUM.

(c)

5 marks

Apply the Siamese construction algorithm to complete the 5x5 magic square:
Rules applied: Start 1 at middle top [0,2]. Step up-right. Wrap around edges. If occupied, drop one row down from previous number.
Row 0: 17, 24, 1, 8, 15
Row 1: 23, 5, 7, 14, 16
Row 2: 4, 6, 13, 20, 22
Row 3: 10, 12, 19, 21, 3
Row 4: 11, 18, 25, 2, 9
Verification: Every row, column, and diagonal sums to 65.

Magic Constant = \frac{n ( n ^{2} + 1 )}{2} = \frac{5 ( 25 + 1 )}{2} = 65

Mentor tip

Follow Siamese rules: move up one row and right one column; wrap around edges; drop down one row when encountering an already-filled cell.

Question 12

15 marks

Software project management, language selection, and Gantt chart limitations

System fundamentals
Computational thinking, problem-solving and programming

(a)

2 marks

State two essential tasks students must undertake to define a programming problem:
1) Identify user requirements and scope: Engage stakeholders to establish clear operational objectives and system success criteria.
2) Specify concrete inputs, processing, and outputs: Document precise data formats, user interactions, and expected calculated results.

Mentor tip

Highlight gathering user requirements and defining concrete inputs, processing algorithms, and output specifications.

(b)

1 mark

Identify two standard techniques to represent algorithms during software design:
1) Pseudocode: Structured, language-agnostic textual representation of programmatic logic.
2) Program flowcharts: Standardized geometric diagrams illustrating control flow pathways and conditional branches.

Mentor tip

Name pseudocode and program flowcharts (or structure diagrams).

(c)

3 marks

Discuss the appropriateness of beta testing within a 10-day student project timeframe:
1) Advantages in theory: Exposes the software to unbiased external users on diverse hardware setups, providing objective feedback on usability and latent bugs.
2) Timeline constraint: A 10-day deadline leaves insufficient time to package pre-release builds, recruit external testers, gather feedback, and implement revisions.
3) Conclusion: Inappropriate for this short schedule; rigorous internal alpha testing among the three student developers is far more viable.

Mentor tip

Weigh the objectivity of external user feedback against the severe time constraints of a 10-day project.

(d)

3 marks

Outline three criteria considered when choosing an implementation programming language:
1) Team competence and familiarity: Whether all contributing team members understand the syntax and idioms without requiring extensive retraining.
2) Library and framework ecosystem: Availability of pre-built, robust libraries tailored to the problem domain (e.g., UI controls, math routines).
3) Target platform runtime support: Availability of compilers, interpreters, and execution environments compatible with target client operating systems.

Mentor tip

Consider developer language familiarity, available third-party library support, and target platform compatibility.

(e)

2 marks

Analyze the project Gantt chart to identify task relationships:
1) Concurrent tasks: 'Design algorithms' and 'Design test data' can be executed simultaneously in parallel by different team members during days 2-4.
2) Sequential tasks: 'Define the problem' must finish before 'Design algorithms' or 'Code the program' can begin.

Mentor tip

Identify overlapping parallel activities (e.g., algorithm design and test data design) vs prerequisite ordered pairs (problem definition preceding coding).

(f)

4 marks

Explain why Gantt charts are inadequate for managing large-scale commercial business projects:
1) Lack of task interdependency modeling: Fails to clearly illustrate complex dependencies, preventing project managers from automatically computing critical path bottlenecks when upstream tasks slip.
2) Omission of resource allocation: Displays timelines without showing personnel workloads, equipment capacity, or team member assignments, risking severe resource contention.
3) Poor adaptability to change: Highly rigid; unexpected scope changes or delays require tedious manual rebuilding across cascading project phases.
4) No budget tracking: Tracks schedule duration exclusively, providing no visibility into burn rate, expenses, or financial cost overruns.

Mentor tip

Discuss the lack of dependency/critical path visibility, inability to manage human resource constraints, and absence of budget tracking.

Question 13

15 marks

Automated correctional facility security, GPS tracking, and ethical implications

Control systems
Networks
System fundamentals

(a)

2 marks

Suggest two sensors suitable for detecting perimeter intrusion at a facility:
1) Passive Infrared (PIR) / Active infrared beam sensors: Detects heat signatures and breaks in optical perimeter tripwires.
2) Buried seismic/pressure sensors: Senses ground vibrations and physical footsteps along perimeter fence boundaries.

Mentor tip

Suggest movement, pressure, or infrared beam sensors.

(b)

2 marks

Outline a suitable alert notification for security patrols:
Handheld device vibrating alert and audible alarm accompanied by an urgent on-screen notification displaying the precise sector coordinates of the breach.

Mentor tip

Specify the delivery mechanism (audible siren or handheld vibration/message) and the context delivered (alert details).

(c)

2 marks

Suggest transmission media for each communication link:
1) Perimeter sensors to security control room: Shielded fiber-optic or underground copper cable (immune to electromagnetic noise, high bandwidth, and tamper-resistant).
2) Security control room to mobile patrol devices: Encrypted wireless radio frequency (RF) signals, Wi-Fi mesh, or cellular data.

Mentor tip

Recommend physical wired/fiber cabling for fixed perimeter sensors and wireless/RF for mobile handheld units.

(d)

1 mark

State one network security method used when transmitting location coordinates:
End-to-end cryptographic encryption (such as AES-256) to prevent eavesdropping and data packet tampering.

Mentor tip

Name strong cryptographic encryption.

(e)

2 marks

Outline two operational uses of patrol GPS data by the central security system:
1) Patrol route compliance verification: Confirms guards actively patrol assigned perimeter sectors on schedule without remaining stationary.
2) Incident dispatch optimization: Automatically identifies and directs the nearest available guard to intercept an alarm trigger.

Mentor tip

Mention monitoring guard movement/location compliance and dispatching the nearest personnel during emergencies.

(f)

6 marks

Discuss the ethical implications of mandating wearable GPS tracking devices:
1) Arguments favoring mandate (Safety and justice): Enforces lawful movement boundaries for individuals under house arrest or probation, serving as a humane alternative to physical imprisonment while protecting community safety; assists locating lost children or vulnerable patients with dementia.
2) Arguments opposing mandate (Civil liberties and dignity): Constant biometric and geographic surveillance infringes on fundamental privacy, engenders psychological stress, undermines mutual social trust, and creates risks of stalker surveillance if location data is hacked.
3) Conclusion: Mandated tracking can be ethically justified only when strictly proportionate to verifiable risk (such as judicial sentencing or protective medical care) with strong statutory oversight and strict data security.

Mentor tip

Present balanced arguments: public safety and incarceration alternatives vs privacy infringement, lack of trust, and potential surveillance misuse.

Question 14

15 marks

Dynamic singly linked list operations and binary search tree search efficiency

Abstract data structures

(a)

6 marks

1) Structural description of a dynamic singly linked list:
- A linear, heap-allocated sequence of nodes where each node contains two fields: a data payload and a reference pointer pointing to the next node in the sequence.
- An external head pointer anchors the start of the list, and the final node's pointer is set to null to mark the list termination.
2) Search algorithm to locate a target item:
- Set a temporary traversal pointer CURRENT to the head pointer.
- Loop while CURRENT != null and CURRENT.data != TARGET:
CURRENT = CURRENT.next
- If CURRENT != null then the item is found; if CURRENT reaches null, the item does not exist in the list.

Mentor tip

Describe node structure (data and pointer fields) anchored by a head pointer, followed by linear traversal comparing each node's data.

(b)

2 marks

Analyze binary search tree traversals for the given tree:
1) Postorder traversal (Left, Right, Root):
- Left subtree of MARK: Root ANNIE, right child IVY with left child BORIS and right child JANE.
- Postorder on IVY subtree: BORIS, JANE, IVY.
- Postorder on ANNIE subtree: BORIS, JANE, IVY, ANNIE.
- Right subtree of MARK: ROBERT.
- Root node: MARK.
- Complete sequence: BORIS, JANE, IVY, ANNIE, ROBERT, MARK.
2) Traversal returning sorted alphabetical order: Inorder traversal (Left, Root, Right).

Mentor tip

Postorder visits subtrees in Left-Right-Root order; inorder visits in Left-Root-Right order yielding sorted order.

(c)

4 marks

Describe how to delete a node with two children from a binary search tree while preserving BST ordering:
1) Locate replacement node: Find the inorder successor (the smallest value in the right subtree) or inorder predecessor (largest value in left subtree).
2) Copy data payload: Overwrite the data field of the node to be deleted with the data value from the replacement node.
3) Remove replacement node: Delete the replacement node from its original location; since it is guaranteed to have at most one child, bypass it by linking its parent directly to its single child (or null if it is a leaf).

Mentor tip

Replace the deleted node's value with its inorder successor (minimum in right subtree), then remove the successor node.

(d)

3 marks

Compare the search efficiency of a binary search tree against a singly linked list:
1) Linked list linear search: Searching an unordered or ordered singly linked list requires scanning node pointers sequentially, yielding O(n) time complexity (averaging n/2 comparisons).
2) Balanced binary search tree: Each comparison eliminates half of the remaining search space, yielding O(log n) logarithmic time complexity.
3) Degenerate worst-case: If a BST becomes completely unbalanced (skewed like a linked list), search performance degrades to O(n).

O (lo g_{2} n) vs O (n)

Mentor tip

Contrast the logarithmic average search complexity O(log n) of a balanced BST against the linear search complexity O(n) of a linked list.

Our analysis

Where the marks are

Each part sorted by the topic it mostly tests. System fundamentals carries the most marks on this paper.

System fundamentals34 marks · 34%
Q1, Q10, Q12, Q13
Computational thinking, problem-solving and programming25 marks · 25%
Q6, Q7, Q11, Q12
Abstract data structures19 marks · 19%
Q4, Q14
Computer organisation8 marks · 8%
Q1, Q2, Q3, Q5
Networks6 marks · 6%
Q9, Q13
Control systems6 marks · 6%
Q13
Resource management2 marks · 2%
Q8

Mentor insights

Traps to watch for

01
Flowchart loop trace output sequencing · Q7
Notice that output statements occur at the beginning of the loop body before K is decremented and P is multiplied. When K reaches 1, the condition K > 1 evaluates to false and the loop terminates without printing.
02
Secondary diagonal column index indexing · Q11
In an n x n array with zero-based indices (0 to n - 1), the secondary diagonal coordinate in row K is A[K][n - 1 - K]. Using A[K][n - K] causes an off-by-one array index exception.
03
BST node deletion pointer restructuring · Q14
Never delete a node with two children by directly redirecting parent pointers. Instead, replace its key value with that of its inorder successor, then unlink the successor node.

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 2014
Marks: 100
Duration: 2 hours 10 min
Calculator: Not allowed
Questions: 14

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

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

Practice mode

Hide our working until you've had a go.

Questions 1–9 · 25 marks

Question 1

3 marks

Spreadsheet features and operating system role

System fundamentals
Computer organisation

(a)

2 marks

Outline two distinct functional characteristics of spreadsheet applications:
1) Grid-based addressable matrix: Data is organized into intersecting rows and columns forming individual cells referenced by coordinate labels (e.g., B4).
2) Dynamic formula recalculation: Built-in mathematical and statistical functions automatically recompute output values whenever underlying cell values change.

Mentor tip

State two distinctive traits: cell grid structuring and automatic formula recalculation.

(b)

1 mark

Define the term operating system:
Core system software that manages physical hardware resources, supervises processor scheduling and memory allocation, and provides foundational platform services for application execution.

Mentor tip

Emphasize management of physical computer hardware and system resources.

Question 2

1 mark

Function of the Arithmetic Logic Unit (ALU)

Computer organisation

(a)

1 mark

Outline the fundamental purpose of the CPU's ALU:
Executes all elementary arithmetic computations (such as addition and subtraction) alongside bitwise logical decisions (AND, OR, NOT, comparisons) mandated by instruction machine codes.

Mentor tip

Specify that the ALU performs arithmetic calculations and logical operations.

Question 3

2 marks

Relationship between binary and hexadecimal representations

Computer organisation

(a)

2 marks

Outline the mathematical relationship linking binary and hexadecimal numbering:
1) Base power equivalence: Binary is base 2 while hexadecimal is base 16; since 2^4 = 16, sixteen is an exact power of two.
2) Direct 4-bit nibble grouping: Exactly four binary digits (bits) correspond to a single hexadecimal character, allowing compact human-readable transcription of long binary byte streams.

2^{4} = 16

Mentor tip

State that 16 = 2^4, so each single hexadecimal digit represents exactly four binary bits.

Question 4

4 marks

Stack abstract data structure characteristics and applications

Abstract data structures

(a)

2 marks

Describe the operational characteristics of a stack:
1) Single-ended linear structure: A collection where insertion and removal operations are strictly restricted to one terminal boundary termed the top of the stack.
2) LIFO access discipline: Operates under Last-In, First-Out behavior, meaning the most recently pushed element is the first element popped.

Mentor tip

Mention the single-ended point of access and the Last-In, First-Out (LIFO) protocol.

(b)

2 marks

Identify two computing applications of a stack:
1) Call stack management: Preserves subroutine return addresses, parameters, and local activation frames during nested or recursive procedure execution.
2) Expression parsing and evaluation: Converts infix mathematical expressions to reverse Polish notation (postfix) and validates balanced syntactic brackets in compilers.

Mentor tip

Name practical applications such as function call return address tracking or syntax bracket parsing.

Question 5

4 marks

Boolean logic truth table construction for XOR expression

Computer organisation

(a)

4 marks

Construct the complete truth table for Boolean expression X = (not A and B) or (A and not B):
Row 1 [A = 0, B = 0]: (not 0 and 0) or (0 and not 0) = (1 and 0) or (0 and 1) = 0 or 0 = 0
Row 2 [A = 0, B = 1]: (not 0 and 1) or (0 and not 1) = (1 and 1) or (0 and 0) = 1 or 0 = 1
Row 3 [A = 1, B = 0]: (not 1 and 0) or (1 and not 0) = (0 and 0) or (1 and 1) = 0 or 1 = 1
Row 4 [A = 1, B = 1]: (not 1 and 1) or (1 and not 1) = (0 and 1) or (1 and 0) = 0 or 0 = 0

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

Mentor tip

Recognize this classic Exclusive-OR (XOR) pattern: output is 1 when inputs differ, and 0 when inputs match.

Question 6

3 marks

Modular programming advantages of sub-programs

Computational thinking, problem-solving and programming

(a)

3 marks

State three distinct advantages of utilizing sub-programs (procedures/functions):
1) Modular decomposition: Decomposes large, complex software problems into smaller, manageable, and logically isolated modules.
2) Code reuse without duplication: A sub-program can be invoked from multiple locations across different programs, reducing total codebase volume.
3) Independent testing and maintenance: Individual sub-routines can be developed and unit-tested in isolation, allowing localized debugging without impacting unrelated components.

Mentor tip

Highlight modular problem division, reusability across programs, and independent unit testing/maintenance.

Question 7

3 marks

Algorithmic flowchart trace table execution

Computational thinking, problem-solving and programming

(a)

3 marks

Trace the algorithm step-by-step to identify the exact outputs produced:
Initialization: K = 3, P = 1.
Iteration 1: Condition K > 1 (3 > 1) evaluates to true.
- Output K: prints 3.
- Output P: prints 1.
- Decrement K: K = 3 - 1 = 2.
- Update P: P = 1 * 2 = 2.
Iteration 2: Condition K > 1 (2 > 1) evaluates to true.
- Output K: prints 2.
- Output P: prints 2.
- Decrement K: K = 2 - 1 = 1.
- Update P: P = 2 * 1 = 2.
Iteration 3: Condition K > 1 (1 > 1) evaluates to false -> terminates.
Sequential outputs: 3, 1, 2, 2.

Mentor tip

Notice that outputs occur BEFORE the variables K and P are updated within each loop iteration.

Question 8

2 marks

Definition and mechanism of device polling

Resource management

(a)

2 marks

Define the computer control technique of polling:
1) Sequential status interrogation: A central control unit or CPU systematically queries peripheral devices or network nodes one by one to check their operational readiness or data pending status.
2) Deterministic periodic scheduling: Polling checks occur at predetermined regular time intervals, contrasting with event-driven interrupt handling.

Mentor tip

Define polling as periodic, systematic interrogation of peripheral status by a central controller.

Question 9

3 marks

Network communication protocols and necessity

Networks

(a)

1 mark

Define the term network protocol:
A formalized set of rules, syntax specifications, and transmission standards governing the reliable exchange of data between communicating entities across a network.

Mentor tip

Define as a standardized set of rules and conventions governing data transmission.

(b)

2 marks

Outline two reasons why protocols are essential in networked communication:
1) Data integrity and error control: Standardized parity/checksum algorithms detect frame corruption during transit and mandate retransmission.
2) Flow control and deadlock avoidance: Negotiates packet transmission rates between fast senders and slow receivers, preventing buffer overflow and communication deadlock.

Mentor tip

Mention error detection/correction mechanisms and flow control to prevent buffer saturation.

Questions 10–14 · 75 marks

Question 10

15 marks

Retail point-of-sale processing, headquarters synchronization, and data loss prevention

System fundamentals

(a)

5 marks

Describe the logical flow and standard symbols of the in-store POS system flowchart:
1) Input symbol: Manual barcode scan / payment card reader captures transaction details and card credentials.
2) Process symbol: In-store terminal queries local daily price database downloaded from headquarters.
3) Telecommunication link: Encrypted online transmission to external Card Authorization Centre.
4) Decision symbol: Branch on whether authorization approval is received (Yes -> continue, No -> decline transaction).
5) Output and storage symbols: Receipt is output to printer, while transaction details are saved to local persistent storage for end-of-day batch upload.

Mentor tip

Identify each standard flowchart symbol: input device, local database lookup, remote authorization link, decision branch, and receipt print.

(b)

2 marks

Describe the nightly processing carried out at company headquarters:
1) Batch inventory reconciliation: Processes transaction batches from all retail branches to decrement stock levels in the enterprise database and trigger automated warehouse restocking.
2) Financial auditing and analytics: Consolidates revenue metrics, audits card transactions, and prepares daily regional management sales reports.

Mentor tip

Identify batch updates to the central inventory database and consolidated financial audit reporting.

(c)

3 marks

Identify three distinct causes of organizational data loss:
1) Hardware malfunction: Physical storage device breakdown, such as mechanical hard disk head crashes or storage controller failure.
2) Malicious cyber activity: External malware, ransomware encryption, or hostile intrusions by rogue actors.
3) Human error or environmental disasters: Accidental record deletion by operators, power surges, or facility fires and floods.

Mentor tip

List three distinct categories: hardware failure, malicious malware/hacking, and human error or physical disaster.

(d)

3 marks

Explain why data loss poses a far more severe threat than the loss of hardware or software:
1) Replaceability via capital vs uniqueness: Lost hardware can be readily repurchased and replaced under equipment insurance; off-the-shelf software can be cleanly reinstalled from original media or cloud repositories.
2) Irreplaceable historical records: Proprietary transactional customer histories, accounting ledgers, and order records are unique and cannot be reconstructed if destroyed without backups.
3) Legal and financial fallout: Loss of proprietary client data results in severe regulatory privacy fines, lawsuits, lost business trust, and corporate failure.

Mentor tip

Contrast replaceable hardware/software against unique, irreplaceable enterprise data and the associated legal/business consequences.

(e)

2 marks

Identify two effective strategies to prevent organizational data loss:
1) Regular automated offsite backups: Creating scheduled, versioned data backups stored in geographically separate cloud repositories, coupled with regular restoration drills.
2) Strict access controls and encryption: Enforcing role-based access permissions, multi-factor authentication, and cryptographic data protection to block unauthorized modification or accidental deletion.

Mentor tip

Specify automated offsite/cloud backup schedules alongside role-based access control and encryption.

Question 11

15 marks

Magic square verification and matrix construction algorithms

Computational thinking, problem-solving and programming

(a)

2 marks

Construct an algorithm to compute the sum of the main diagonal elements in a 7x7 matrix A:
SUM = 0
loop K from 0 to 6
SUM = SUM + A[K][K]
end loop
output SUM

Mentor tip

Iterate single index K from 0 to 6, accumulating elements where row and column indices match: A[K][K].

(b)

8 marks

Construct an algorithm to verify whether an n x n array is a magic square:
IS_MAGIC = true
TARGET_SUM = 0
// Calculate reference sum from primary diagonal
loop K from 0 to n - 1
TARGET_SUM = TARGET_SUM + A[K][K]
end loop
// Check secondary diagonal
SEC_SUM = 0
loop K from 0 to n - 1
SEC_SUM = SEC_SUM + A[K][n - 1 - K]
end loop
if SEC_SUM != TARGET_SUM then
IS_MAGIC = false
end if
// Check every row and column sum
ROW = 0
loop while ROW < n and IS_MAGIC
ROW_SUM = 0
COL_SUM = 0
loop COL from 0 to n - 1
ROW_SUM = ROW_SUM + A[ROW][COL]
COL_SUM = COL_SUM + A[COL][ROW]
end loop
if ROW_SUM != TARGET_SUM or COL_SUM != TARGET_SUM then
IS_MAGIC = false
end if
ROW = ROW + 1
end loop
if IS_MAGIC then
output "The array is a magic square"
else
output "The array is not a magic square"
end if

Mentor tip

Check primary diagonal, secondary diagonal (using index n - 1 - K), and all row/column sums against TARGET_SUM.

(c)

5 marks

Apply the Siamese construction algorithm to complete the 5x5 magic square:
Rules applied: Start 1 at middle top [0,2]. Step up-right. Wrap around edges. If occupied, drop one row down from previous number.
Row 0: 17, 24, 1, 8, 15
Row 1: 23, 5, 7, 14, 16
Row 2: 4, 6, 13, 20, 22
Row 3: 10, 12, 19, 21, 3
Row 4: 11, 18, 25, 2, 9
Verification: Every row, column, and diagonal sums to 65.

Magic Constant = \frac{n ( n ^{2} + 1 )}{2} = \frac{5 ( 25 + 1 )}{2} = 65

Mentor tip

Follow Siamese rules: move up one row and right one column; wrap around edges; drop down one row when encountering an already-filled cell.

Question 12

15 marks

Software project management, language selection, and Gantt chart limitations

System fundamentals
Computational thinking, problem-solving and programming

(a)

2 marks

State two essential tasks students must undertake to define a programming problem:
1) Identify user requirements and scope: Engage stakeholders to establish clear operational objectives and system success criteria.
2) Specify concrete inputs, processing, and outputs: Document precise data formats, user interactions, and expected calculated results.

Mentor tip

Highlight gathering user requirements and defining concrete inputs, processing algorithms, and output specifications.

(b)

1 mark

Identify two standard techniques to represent algorithms during software design:
1) Pseudocode: Structured, language-agnostic textual representation of programmatic logic.
2) Program flowcharts: Standardized geometric diagrams illustrating control flow pathways and conditional branches.

Mentor tip

Name pseudocode and program flowcharts (or structure diagrams).

(c)

3 marks

Discuss the appropriateness of beta testing within a 10-day student project timeframe:
1) Advantages in theory: Exposes the software to unbiased external users on diverse hardware setups, providing objective feedback on usability and latent bugs.
2) Timeline constraint: A 10-day deadline leaves insufficient time to package pre-release builds, recruit external testers, gather feedback, and implement revisions.
3) Conclusion: Inappropriate for this short schedule; rigorous internal alpha testing among the three student developers is far more viable.

Mentor tip

Weigh the objectivity of external user feedback against the severe time constraints of a 10-day project.

(d)

3 marks

Outline three criteria considered when choosing an implementation programming language:
1) Team competence and familiarity: Whether all contributing team members understand the syntax and idioms without requiring extensive retraining.
2) Library and framework ecosystem: Availability of pre-built, robust libraries tailored to the problem domain (e.g., UI controls, math routines).
3) Target platform runtime support: Availability of compilers, interpreters, and execution environments compatible with target client operating systems.

Mentor tip

Consider developer language familiarity, available third-party library support, and target platform compatibility.

(e)

2 marks

Analyze the project Gantt chart to identify task relationships:
1) Concurrent tasks: 'Design algorithms' and 'Design test data' can be executed simultaneously in parallel by different team members during days 2-4.
2) Sequential tasks: 'Define the problem' must finish before 'Design algorithms' or 'Code the program' can begin.

Mentor tip

Identify overlapping parallel activities (e.g., algorithm design and test data design) vs prerequisite ordered pairs (problem definition preceding coding).

(f)

4 marks

Explain why Gantt charts are inadequate for managing large-scale commercial business projects:
1) Lack of task interdependency modeling: Fails to clearly illustrate complex dependencies, preventing project managers from automatically computing critical path bottlenecks when upstream tasks slip.
2) Omission of resource allocation: Displays timelines without showing personnel workloads, equipment capacity, or team member assignments, risking severe resource contention.
3) Poor adaptability to change: Highly rigid; unexpected scope changes or delays require tedious manual rebuilding across cascading project phases.
4) No budget tracking: Tracks schedule duration exclusively, providing no visibility into burn rate, expenses, or financial cost overruns.

Mentor tip

Discuss the lack of dependency/critical path visibility, inability to manage human resource constraints, and absence of budget tracking.

Question 13

15 marks

Automated correctional facility security, GPS tracking, and ethical implications

Control systems
Networks
System fundamentals

(a)

2 marks

Suggest two sensors suitable for detecting perimeter intrusion at a facility:
1) Passive Infrared (PIR) / Active infrared beam sensors: Detects heat signatures and breaks in optical perimeter tripwires.
2) Buried seismic/pressure sensors: Senses ground vibrations and physical footsteps along perimeter fence boundaries.

Mentor tip

Suggest movement, pressure, or infrared beam sensors.

(b)

2 marks

Outline a suitable alert notification for security patrols:
Handheld device vibrating alert and audible alarm accompanied by an urgent on-screen notification displaying the precise sector coordinates of the breach.

Mentor tip

Specify the delivery mechanism (audible siren or handheld vibration/message) and the context delivered (alert details).

(c)

2 marks

Suggest transmission media for each communication link:
1) Perimeter sensors to security control room: Shielded fiber-optic or underground copper cable (immune to electromagnetic noise, high bandwidth, and tamper-resistant).
2) Security control room to mobile patrol devices: Encrypted wireless radio frequency (RF) signals, Wi-Fi mesh, or cellular data.

Mentor tip

Recommend physical wired/fiber cabling for fixed perimeter sensors and wireless/RF for mobile handheld units.

(d)

1 mark

State one network security method used when transmitting location coordinates:
End-to-end cryptographic encryption (such as AES-256) to prevent eavesdropping and data packet tampering.

Mentor tip

Name strong cryptographic encryption.

(e)

2 marks

Outline two operational uses of patrol GPS data by the central security system:
1) Patrol route compliance verification: Confirms guards actively patrol assigned perimeter sectors on schedule without remaining stationary.
2) Incident dispatch optimization: Automatically identifies and directs the nearest available guard to intercept an alarm trigger.

Mentor tip

Mention monitoring guard movement/location compliance and dispatching the nearest personnel during emergencies.

(f)

6 marks

Discuss the ethical implications of mandating wearable GPS tracking devices:
1) Arguments favoring mandate (Safety and justice): Enforces lawful movement boundaries for individuals under house arrest or probation, serving as a humane alternative to physical imprisonment while protecting community safety; assists locating lost children or vulnerable patients with dementia.
2) Arguments opposing mandate (Civil liberties and dignity): Constant biometric and geographic surveillance infringes on fundamental privacy, engenders psychological stress, undermines mutual social trust, and creates risks of stalker surveillance if location data is hacked.
3) Conclusion: Mandated tracking can be ethically justified only when strictly proportionate to verifiable risk (such as judicial sentencing or protective medical care) with strong statutory oversight and strict data security.

Mentor tip

Present balanced arguments: public safety and incarceration alternatives vs privacy infringement, lack of trust, and potential surveillance misuse.

Question 14

15 marks

Dynamic singly linked list operations and binary search tree search efficiency

Abstract data structures

(a)

6 marks

1) Structural description of a dynamic singly linked list:
- A linear, heap-allocated sequence of nodes where each node contains two fields: a data payload and a reference pointer pointing to the next node in the sequence.
- An external head pointer anchors the start of the list, and the final node's pointer is set to null to mark the list termination.
2) Search algorithm to locate a target item:
- Set a temporary traversal pointer CURRENT to the head pointer.
- Loop while CURRENT != null and CURRENT.data != TARGET:
CURRENT = CURRENT.next
- If CURRENT != null then the item is found; if CURRENT reaches null, the item does not exist in the list.

Mentor tip

Describe node structure (data and pointer fields) anchored by a head pointer, followed by linear traversal comparing each node's data.

(b)

2 marks

Analyze binary search tree traversals for the given tree:
1) Postorder traversal (Left, Right, Root):
- Left subtree of MARK: Root ANNIE, right child IVY with left child BORIS and right child JANE.
- Postorder on IVY subtree: BORIS, JANE, IVY.
- Postorder on ANNIE subtree: BORIS, JANE, IVY, ANNIE.
- Right subtree of MARK: ROBERT.
- Root node: MARK.
- Complete sequence: BORIS, JANE, IVY, ANNIE, ROBERT, MARK.
2) Traversal returning sorted alphabetical order: Inorder traversal (Left, Root, Right).

Mentor tip

Postorder visits subtrees in Left-Right-Root order; inorder visits in Left-Root-Right order yielding sorted order.

(c)

4 marks

Describe how to delete a node with two children from a binary search tree while preserving BST ordering:
1) Locate replacement node: Find the inorder successor (the smallest value in the right subtree) or inorder predecessor (largest value in left subtree).
2) Copy data payload: Overwrite the data field of the node to be deleted with the data value from the replacement node.
3) Remove replacement node: Delete the replacement node from its original location; since it is guaranteed to have at most one child, bypass it by linking its parent directly to its single child (or null if it is a leaf).

Mentor tip

Replace the deleted node's value with its inorder successor (minimum in right subtree), then remove the successor node.

(d)

3 marks

Compare the search efficiency of a binary search tree against a singly linked list:
1) Linked list linear search: Searching an unordered or ordered singly linked list requires scanning node pointers sequentially, yielding O(n) time complexity (averaging n/2 comparisons).
2) Balanced binary search tree: Each comparison eliminates half of the remaining search space, yielding O(log n) logarithmic time complexity.
3) Degenerate worst-case: If a BST becomes completely unbalanced (skewed like a linked list), search performance degrades to O(n).

O (lo g_{2} n) vs O (n)

Mentor tip

Contrast the logarithmic average search complexity O(log n) of a balanced BST against the linear search complexity O(n) of a linked list.

Our analysis

Where the marks are

Each part sorted by the topic it mostly tests. System fundamentals carries the most marks on this paper.

System fundamentals34 marks · 34%
Q1, Q10, Q12, Q13
Computational thinking, problem-solving and programming25 marks · 25%
Q6, Q7, Q11, Q12
Abstract data structures19 marks · 19%
Q4, Q14
Computer organisation8 marks · 8%
Q1, Q2, Q3, Q5
Networks6 marks · 6%
Q9, Q13
Control systems6 marks · 6%
Q13
Resource management2 marks · 2%
Q8

Mentor insights

Traps to watch for

01
Flowchart loop trace output sequencing · Q7
Notice that output statements occur at the beginning of the loop body before K is decremented and P is multiplied. When K reaches 1, the condition K > 1 evaluates to false and the loop terminates without printing.
02
Secondary diagonal column index indexing · Q11
In an n x n array with zero-based indices (0 to n - 1), the secondary diagonal coordinate in row K is A[K][n - 1 - K]. Using A[K][n - K] causes an off-by-one array index exception.
03
BST node deletion pointer restructuring · Q14
Never delete a node with two children by directly redirecting parent pointers. Instead, replace its key value with that of its inorder successor, then unlink the successor node.

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