A Level Computer Science 9618 Paper 33, Oct/Nov 2025

Question paper and mark scheme75 marks13 questions

Solve it on ExamPal

Practise

Untimed. Write on the paper and check as you go.

Start

Exam

Timed, with a clock you set, like sitting the real paper.

Start

Opens full screen.

Opening the question paper

Read as textThe questions and the mark scheme as plain text. Easier to read on a phone.

Question paper

9618/33 · Oct/Nov 2025

Download PDF
1
a(i)

An enumerated data type, Spectrum, is required to hold the names of colours. Write the pseudocode statement for the type declaration of Spectrum to hold the names of the colours available: Red, Orange, Yellow, Green, Blue, Indigo, Violet.

[2]
a(ii)

Identify two characteristics of the list of values given in an enumerated data type declaration.

[2]
b

ColourData is a composite data type to store definitions of colours. Write pseudocode statements to declare ColourData to hold the following fields: Field | Example data ColourCode | XYZ12345 Colour | Red Wavelength | 650 Frequency | 4.62 PrimaryColour | Yes Use the most appropriate data type in each case, including the enumerated data type Spectrum from part a(i).

[4]
2

Numbers are stored in a computer system using binary floating-point representation with: • 12 bits for the mantissa • 4 bits for the exponent • two’s complement form for both the mantissa and the exponent • 2 bytes in total.

a

Outline the effect of changing the number of bits used to store the mantissa to 10 bits, in this system.

[3]
b

Describe one example of a situation that could cause an overflow to occur and the consequences of such an overflow.

[3]
3

Describe how packet switching is used to pass messages across a network. Do not include checking for completeness and resending packets in your answer.

[4]
4

Identify and describe three protocols that are used in the Application Layer of the TCP/IP protocol suite. Protocol 1 ......................................................................................................................................... Description ....................................................................................................................................... .......................................................................................................................................................... .......................................................................................................................................................... Protocol 2 ......................................................................................................................................... Description ....................................................................................................................................... .......................................................................................................................................................... .......................................................................................................................................................... Protocol 3 ......................................................................................................................................... Description ....................................................................................................................................... .......................................................................................................................................................... ..........................................................................................................................................................

[6]
5
a

State the purpose of multi-tasking.

[1]
b

Explain how an operating system ensures that multi-tasking operates efficiently.

[3]
6
a(i)

The Karnaugh map (K-map) represents a logic circuit with four inputs. Draw loop(s) around appropriate group(s) in the K-map to produce an optimal sum-of-products.

[3]
a(ii)

Write the Boolean expression from your answer to part a(i) as a simplified sum-of-products. Do not carry out any further simplification.

[2]
b

Simplify the following expression using De Morgan’s laws and Boolean algebra. Show all the stages in your simplification. X=A+B+C‾+B‾+C

[3]
7
a

Outline the process of optimisation during the compilation of a program.

[2]
b

Write the Reverse Polish Notation (RPN) for the given infix expression: ((6 + 12) / (16 – 10)) * 18

[3]
c

The RPN expression c a – b d + * b c + / is to be evaluated, where: a = 4, b = 12, c = 24 and d = 6. Show the changing contents of the stack as the RPN expression is evaluated.

[4]
8

Calculate the shortest distance between the Start node and each of the nodes in the graph using Dijkstra’s algorithm. Show your working on the graph or in the working space. Write your answers in the table provided.

[5]
Figure 1 of 1 for question 8
9

A company requires a digital certificate to ensure the authenticity of its online communications. Outline the process followed to acquire a digital certificate.

[4]
10

A stack, StackArray, is to be implemented using pseudocode, to store a maximum of 100 string items in an appropriate array. Declarations are required so that the stack has a beginning, an end and a maximum size. An array is also required to store the data.

a

Write pseudocode to declare the variables, constant and array required to implement the stack.

[3]
b

Write pseudocode for a procedure to initialise the top and bottom pointers of the stack to appropriate values.

[3]
11

Describe when the use of recursion would be beneficial and give an example. Description ....................................................................................................................................... .......................................................................................................................................................... .......................................................................................................................................................... .......................................................................................................................................................... Example ........................................................................................................................................... ..........................................................................................................................................................

[3]
12

An exception can occur when running a program.

a

Explain what is meant by an exception.

[3]
b

Identify one example of an exception and give one reason why the exception may cause a problem. Example .................................................................................................................................... ................................................................................................................................................... Reason ...................................................................................................................................... ...................................................................................................................................................

[2]
13

The table shows assembly language instructions for a processor that has one register, the Accumulator (ACC). Instruction Label | Opcode | Operand | Explanation | LDM | #n | Load the number n to the ACC | LDD | <address> | Load the contents of the location at the given address to the ACC | LDI | <address> | The address to be used is at the given address. Load the contents of this second address to the ACC | ADD | <address> | Add the contents of the given address to the ACC | ADD | #n | Add the number n to the ACC | SUB | <address> | Subtract the contents of the given address from the ACC | SUB | #n | Subtract the number n from the ACC | STO | <address> | Store the contents of the ACC at the given address <label>: | | <data> | Gives a symbolic address <label> to the memory location with the contents <data> # denotes a denary number, e.g. #123 <label> can be used in place of <address> The current contents of memory are: Address | Contents 563 | 125 899 | 63 Write assembly language code, using only the given instruction set to: • store the denary value 250 as labelled variable X • store the value stored in location 563 as labelled variable Y • add the value stored in variable X to the value stored in variable Y • subtract the value stored in location 899 from the current value in the Accumulator • store the result in variable Total. Show the initialisation and values of the variables X, Y and Total in the table provided.

[7]

Mark scheme

9618/33 · Oct/Nov 2025

Download PDF

1a(i) · 2 marks

  • 1 mark

    MP1 TYPE Spectrum =

  • 1 mark

    MP2 (Red, Orange, Yellow, Green, Blue, Indigo, Violet)

1a(ii) · 2 marks

  • 1 mark

    MP1 the list is ordered/ordinal

  • 1 mark

    MP2 the list contains all possible values

  • 1 mark

    MP3 no duplicate values in list

  • 1 mark

    MP4 all values are the same data type

1b · 4 marks

  • 1 mark

    One mark for TYPE ColourData and ENDTYPE correct

  • 1 mark

    One mark for correct use of DECLARE in all declarations

  • 1 mark

    One mark for correct use of Spectrum in declaration

  • 1 mark

    One mark for remaining four declarations correct (STRING, INTEGER, REAL, BOOLEAN)

2a · 3 marks

  • 1 mark

    MP1 the precision of the number stored in the mantissa will be reduced

  • 1 mark

    MP2 the number of bits available for the exponent will increase to 6

  • 1 mark

    MP3 … this will increase the range of numbers that can be stored.

2b · 3 marks

  • 1 mark

    MP1 a process involving a calculation / the multiplication of two large numbers could take place

  • 1 mark

    MP2 the result might be outside of the range of values possible to store in the given system

  • 1 mark

    MP3 … leading to the most significant bits of the mantissa/exponent being lost (which is an overflow).

3 · 4 marks

  • 1 mark

    MP1 the message is divided into small chunks called packets

  • 1 mark

    MP2 each packet is given a header with important data including source and destination IP addresses

  • 1 mark

    MP3 each packet is sent independently // packets can be sent through different routes

  • 1 mark

    MP4 packets are sent through the optimum route // packets can be re-routed if a route is unavailable

  • 1 mark

    MP5 packets are reassembled at the destination into the whole message

4 · 6 marks

  • 1 mark

    HTTP/S [1]

  • 1 mark

    a protocol/secure protocol used to transfer hypermedia documents / web pages / (data) files between networked devices [1]

  • 1 mark

    FTP [1]

  • 1 mark

    a protocol to download, upload and transfer files from one location to another on a network [1]

  • 1 mark

    POP3 [1]

  • 1 mark

    a protocol used to retrieve/receive emails from a mail server to a computer [1]

  • 1 mark

    IMAP [1]

  • 1 mark

    allows users to access/read their emails from any device without removing the message from the mail server // synchronises emails on any device [1]

  • 1 mark

    SMTP [1]

  • 1 mark

    a protocol used to send emails between mail servers // a protocol used to send emails from a computer to a mail server [1]

  • 1 mark

    BitTorrent [1]

  • 1 mark

    a communication protocol used for peer-to-peer file sharing [1]

5a · 1 mark

  • 1 mark

    To enable multiple programs/processes to be executed at the same time

5b · 3 marks

  • 1 mark

    MP1 the operating system monitors the state of each task/process

  • 1 mark

    MP2 using scheduling to ensure hardware resources are used efficiently

  • 1 mark

    MP3 … and making sure that tasks/processes do not clash.

6a(i) · 3 marks

  • 1 mark

    Correct loop for group of 1s in row CD=01 (columns AB=00, 01, 11)

  • 1 mark

    Correct loop for 2x2 group in rows CD=01, 11 and columns AB=01, 11

  • 1 mark

    Correct loop for 2x2 group in rows CD=11, 10 and columns AB=11, 10

6a(ii) · 2 marks

  • 1 mark

    MP1 One correct Boolean term with an OR sign

  • 1 mark

    MP2 All three correct Boolean terms connected by OR signs and no other terms present.

6b · 3 marks

  • 1 mark

    One mark for correct use of De Morgan’s laws

  • 1 mark

    One mark for correct use of any other Boolean algebra law

  • 1 mark

    One mark for correct answer: (X=) C.(A + B)

7a · 2 marks

  • 1 mark

    MP1 To identify and remove redundant code / To simplify expressions / To reorder the code

  • 1 mark

    MP2 … so that storage size/memory use/power consumption/program execution time/CPU time is minimized.

7b · 3 marks

  • 1 mark

    MP1 6 12 +

  • 1 mark

    MP2 16 10 – /

  • 1 mark

    MP3 18 *

7c · 4 marks

  • 1 mark

    First ring correct

  • 1 mark

    Second ring correct

  • 1 mark

    Third ring correct

  • 1 mark

    One mark for the interim total (360) and the final total (10).

8 · 5 marks

  • 1 mark

    MP1 Initialisation – setting Start to 0

  • 1 mark

    MP2 … and the rest of the towns to 

  • 1 mark

    MP3 Evidence to show values at nodes being updated

  • 1 mark

    MP4 Evidence to show ‘visited node(s)’

  • 1 mark

    MP5 Evidence to show a correct calculation of at least one route

  • 1 mark

    MP6 Evidence to show more than one route has been calculated for at least one town

  • 2 marks

    Correct Answers: Two marks for all six correct values (One mark for four or five correct values): T=6, V=10, W=13, X=18, Y=21, Z=28

9 · 4 marks

  • 1 mark

    MP1 the company generates a public and private key pair locally using a web browser and an RSA key generator tool, which may be part of the CA’s web page

  • 1 mark

    MP2 the company requests a digital certificate from a Certificate Authority (CA)

  • 1 mark

    MP3 the CA responds with its public key and digital certificate,

  • 1 mark

    MP4 … signed with its private key

  • 1 mark

    MP5 the company gathers authentication information e.g. its public key

  • 1 mark

    MP6 … and sends it to the CA signed with the company’s private key and encrypted with the CA’s public key

  • 1 mark

    MP7 the CA verifies the received information and generates/issues the digital certificate.

10a · 3 marks

  • 1 mark

    MP1 Correct declaration of constant Maximum

  • 1 mark

    MP2 Both correctly declared integers

  • 1 mark

    MP3 Correct array declaration

10b · 3 marks

  • 1 mark

    MP1 Correct procedure definition structure

  • 1 mark

    MP2 Base pointer with appropriate value (0 or 1)

  • 1 mark

    MP3 Top pointer with appropriate value (–1, 0, 1)

11 · 3 marks

  • 1 mark

    MP1 Recursion is beneficial for problems that can be broken down into smaller, repetitive problems

  • 1 mark

    MP2 … especially for problems that have many possible branches / are too complex for an iterative approach

  • 1 mark

    MP3 An example e.g. solving mathematical series, sorting a pile of documents, etc.

12a · 3 marks

  • 1 mark

    MP1 An exception is an unplanned / unexpected event that occurs when a program is running

  • 1 mark

    MP2 … due to an error in programming/logic that wasn’t detected during program construction/compilation

  • 1 mark

    MP3 The effect of an exception can be that the program halts unexpectedly.

12b · 2 marks

  • 1 mark

    MP1 One mark for an example of an exception (see list in guidance)

  • 1 mark

    MP2 One mark for the reason for the given exception

13 · 7 marks

  • 1 mark

    MP1 LDM #250 seen

  • 1 mark

    MP2 Correct use of LDD 563

  • 1 mark

    MP3 Correct use of ADD with labelled address X

  • 1 mark

    MP4 Correct use of SUB with address 899

  • 1 mark

    MP5 At least one correct use of STO

  • 1 mark

    MP6 Correct setting up of at least one labelled address and its value

  • 1 mark

    MP7 Correct setting up of remaining two labelled addresses and their values

Questions

  1. 1
    Question 18 marks
    Mark scheme ›
  2. 2
    Question 26 marks
    Mark scheme ›
  3. 3
    Question 34 marks
    Mark scheme ›
  4. 4
    Question 46 marks
    Mark scheme ›
  5. 5
    Question 54 marks
    Mark scheme ›
  6. 6
    Question 68 marks
    Mark scheme ›
  7. 7
    Question 79 marks
    Mark scheme ›
  8. 8
    Question 85 marks
    Mark scheme ›
  9. 9
    Question 94 marks
    Mark scheme ›
  10. 10
    Question 106 marks
    Mark scheme ›
  11. 11
    Question 113 marks
    Mark scheme ›
  12. 12
    Question 125 marks
    Mark scheme ›
  13. 13
    Question 137 marks
    Mark scheme ›

More 9618 papers

Other papers from Oct/Nov 2025

Solve it on ExamPalStart