Menu

Edexcel GCSE Computer Science (1CP2) Exam Questions

Build a practice paper from 604 exam-style questions, each with its mark scheme and example answers. Print it, or answer it on paper and then open the mark schemes. Or browse the questions by topic.

Build a paper

Topics (none ticked: all of them)
Question types (none ticked: all of them)

Practice paper

3 questions · 6 marks

Pick again
Print
1Short recall2 marksUnits & Conversion Swap Remove

Data storage is measured in binary multiples.

Define the term bit.

[2 marks]
Mark scheme

Award one mark for any of the following up to a maximum of two marks:

  • A binary digit (1)
  • Has the value 0 or 1 (1)
  • The smallest unit of data storage (1)
  • A single 0 or 1 (1)

Allow binary digit/binary place value for binary digit

Allow a single binary digit for a single 0 or 1

Do not accept a group of 8 bits/half a nibble of 4 bits, which describe a byte or a nibble

Do not accept a binary number/binary on its own

Example answers and how they were marked
Full marks2/2

A binary digit that can have the value 0 or 1.

Why: A binary digit (1) and has the value 0 or 1 (1).

Some marks1/2

It is the smallest unit of data storage.

Why: Smallest unit of data storage (1), but does not state that it is a binary digit or that it has the value 0 or 1.

No marks0/2

A group of 8 bits.

Why: Describes a byte, not a bit; no creditworthy point and named in the Do not accept line.

2Describe2 marksMemory Management Swap Remove

The operating system is held in main memory while the computer is running.

Describe how the operating system stops a running program from overwriting memory that is not its own.

[2 marks]
Mark scheme

Award up to two marks for a linked description such as:

  • It keeps a record of which memory addresses/areas belong to each program and to the operating system (1) so it knows which addresses a program is allowed to use (1)
  • Each program is given its own area of main memory (1) so a program cannot write to the addresses used by another program or by the operating system (1)
  • The memory used by the operating system is marked as protected/reserved (1) so a program that tries to write to it is blocked/causes an error (1)
  • The address a program writes to is checked against the record of its allocated area (1) and the write is stopped if the address is outside that area (1)

Allow the memory being protected to be that of the operating system or of another program.

For both marks, the expansion must follow/associate with the statement.

Do not award generic answers such as 'the operating system manages memory' or 'the operating system keeps track of memory'.

Do not award responses about stopping programs using too much memory or allocating memory, as these are not about protecting memory being overwritten.

Do not award responses about virtual memory, paging or moving processes to secondary storage.

Do not award responses about firewalls, antivirus software or passwords.

Example answers and how they were marked
Full marks2/2

The operating system gives each program its own area of main memory so that a program cannot write to the addresses used by another program or by the operating system.

Why: Each program is given its own area of main memory (1) linked to it not being able to write to the addresses used by another program or the operating system (1).

Some marks1/2

The operating system gives each program its own area of main memory.

Why: Each program is given its own area of main memory (1), but there is no linked development saying how this stops a program overwriting memory that is not its own.

No marks0/2

The operating system stops a program overwriting memory by moving it into virtual memory when it uses too much.

Why: This describes virtual memory and limiting how much memory a program uses, not protecting memory from being overwritten, so neither bullet applies and the Do not award lines rule it out.

3Calculate2 marksAdding Binary Numbers Swap Remove

Computers manipulate binary patterns.

Complete the table to show the result of the 8-bit binary addition.

[2 marks]
1286432168421
10010101
01001111
Mark scheme

Award one mark for each correct nibble in the correct order:

  • 1110 (1)
  • 0100 (1)

0 marks if the response is not 8-bit binary.

Example answers and how they were marked
Full marks2/2

1110 0100

Why: 149 + 79 = 228, carrying where a column adds to 2: both nibbles are correct (2).

Some marks1/2

1110 0101

Why: A slip in the last bit. The first nibble is correct (1); the second is not.

No marks0/2

1101 1111

Why: Writes 1 in every column with a 1 and never carries. Neither nibble is correct.

Questions by topic

More ways to revise Edexcel GCSE Computer Science (1CP2)

Teachers: build a paper, print it with the mark schemes at the end, and sign your school up to set your classes activities on every topic.

Fetch Decode Explain isn't affiliated with or endorsed by Pearson Edexcel.