Menu

Edexcel GCSE Computer Science (1CP2) Exam Questions

Build a practice paper from 631 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

4 questions · 8 marks

Pick again
Print
1Short recall2 marksTopologies Swap Remove

A small office installs a network that uses a star topology, with each device connected to a central switch.

Give two advantages of a star topology.

[2 marks]
Mark scheme

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

  • If one cable/device fails, the other devices are not affected (1)
  • Fast data transfer/high performance because each device has its own cable/connection (1)
  • Easy to add/remove devices (1)
  • Fault finding is easier because each device has its own cable (1)
  • The switch forwards data only to the destination device, so other devices do not receive it (1)

Do not accept disadvantages, such as the whole network going down if the central switch fails

Do not accept fast/faster/reliable/more reliable on their own, without a reason

Example answers and how they were marked
Full marks2/2

Each device has its own cable to the switch, so if one cable fails the other devices are not affected. It is also easy to add another device.

Why: Failure isolation (1) and easy to add devices (1).

Some marks1/2

It is fast because each device has its own connection.

Why: Fast data transfer qualified by own connection (1), but no second advantage.

No marks0/2

If the central switch fails, the whole network goes down.

Why: This is a disadvantage, not an advantage, so no mark.

2Short recall2 marksCompression Swap Remove

Files can be compressed before they are stored.

Define the term lossless compression.

[2 marks]
Mark scheme

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

  • Reduces/makes the size of a file smaller (1)
  • No data is lost/removed (during compression) (1)
  • The original file/data can be recreated/restored exactly (1)

Allow 'the compressed file takes up less storage space' for the first mark.

The second and third bullets are two ways of making the same point: award a maximum of one mark for them, so a response that says no data is lost and that the original file can be restored, but does not say the file is smaller, scores one mark.

Do not accept descriptions of lossy compression, e.g. 'it removes data that is not needed to make the file smaller'.

Ignore reference to download/transmission times, bandwidth and streaming, as these are benefits of compression and not part of the definition.

Example answers and how they were marked
Full marks2/2

Lossless compression reduces the size of a file without permanently removing any data, so the original file can be restored exactly.

Why: Reduces the size of a file (1) and no data is lost, so the original can be restored exactly (1); maximum of two marks reached.

Some marks1/2

It makes a file smaller so it downloads more quickly.

Why: Reduces the size of a file (1); the faster download is ignored as a benefit, not part of the definition.

No marks0/2

It removes data that is not needed to make the file smaller.

Why: Describes lossy compression, which the do-not-accept line rules out, so the mention of making the file smaller is not credited.

3Describe2 marksLow and High Level Languages Swap Remove

A programmer has written a program in assembly language.

Describe why it is necessary to translate the program into machine code before it can be run.

[2 marks]
Mark scheme

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

  • The processor/CPU can only execute machine code/binary instructions (1) so the assembly instructions must be converted into machine code before the program can run (1)
  • Each assembly instruction/mnemonic matches/corresponds to one machine code instruction (1) so each line must be replaced with the machine code the processor executes (1)
  • The program is written using mnemonics (1) that must be translated into machine code for the processor to carry out the instructions (1)
  • The hardware/processor does not understand assembly language directly (1) so it must be translated into machine code that the processor can execute (1)

Do not accept 'assembly language is a low-level language'.

Do not accept 'it is hard to understand' or 'it is not English'.

Do not accept benefits, such as 'machine code runs faster' or 'the program will run more quickly'.

Do not accept 'an assembler/a translator converts it' on its own, with no reference to the processor only being able to execute machine code/binary.

Do not accept responses about high-level languages or about compilers/interpreters.

Example answers and how they were marked
Full marks2/2

The processor can only execute machine code, so the assembly instructions must be converted into machine code before the program can run.

Why: States what the processor can execute (1) and links it to converting the program's instructions into machine code (1).

Some marks1/2

Each assembly instruction matches one machine code instruction.

Why: Correct point about the one-to-one match (1) but no development saying that this is because the processor only executes machine code.

No marks0/2

Because an assembler translates assembly language into machine code.

Why: Names the translator but gives no reason tied to the processor only being able to execute machine code, so no mark; this is in the 'Do not accept' guidance.

4Convert2 marksDenary to Binary Conversion Swap Remove

Binary patterns can represent numbers.

Convert the denary number 199 to 8-bit binary.

[2 marks]
Mark scheme

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

  • 1100 (1)
  • 0111 (1)

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

Example answers and how they were marked
Full marks2/2

1100 0111

Why: 199 = 128 + 64 + 4 + 2 + 1: both nibbles are correct (2).

Some marks1/2

1100 1000

Why: Converts 200 instead (a slip in adding up the place values). The first nibble is correct (1); the second is not.

No marks0/2

1110 0011

Why: The bits are written in reverse, smallest place value first. 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.