Menu

Edexcel GCSE Computer Science (1CP2) Exam Questions

Build a practice paper from 693 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 marksTopologies Swap Remove

Networks can use different topologies.

Define the term network topology.

[2 marks]
Mark scheme

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

  • The layout/arrangement/structure of a network (1)
  • How devices/nodes are connected together (1)

Allow 'the physical or logical layout/arrangement of a network' for the first point.

Allow 'the way parts of a system/network are connected' for the second point.

Do not award the first mark for 'how devices are connected' on its own.

Do not accept a named topology (e.g. star, bus, mesh) on its own.

Do not accept a network device or how data is transmitted on its own.

Example answers and how they were marked
Full marks2/2

The layout of a network and how the devices in it are connected together.

Why: Layout/arrangement of a network (1) and how devices/nodes are connected together (1).

Some marks1/2

The way devices are connected in a network.

Why: How devices/nodes are connected together (1), but no reference to the layout/arrangement/structure of the network.

No marks0/2

A star network.

Why: Near miss: names a topology but does not define the term.

2Describe2 marksTranslators Swap Remove

A high-level program must be translated into machine code before it can be run.

Describe how a compiler and an interpreter differ in when the translated code is executed.

[2 marks]
Mark scheme

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

  • The interpreter executes each line as soon as it has been translated (1) so translation and execution happen together/at the same time (1)
  • The compiler translates the whole program first (1) and the machine code is run later/separately (1)
  • The interpreter translates the code and runs it while the program is running (1) whereas the compiler does not run the code it produces (1)
  • The compiler produces translated code that is executed only after all the translation has finished (1) but the interpreter executes each line immediately (1)

Allow 'translates one line at a time' where it is linked to executing each line immediately.

Do not accept answers that only state that a compiler is faster/an interpreter is slower, without reference to when execution happens.

Do not accept answers that only give object code, error reporting or portability, without reference to when execution happens.

Do not accept the compiler executing the program as it translates it.

Example answers and how they were marked
Full marks2/2

The compiler translates the code first and the program is executed afterwards, but the interpreter executes each line as soon as it has been translated.

Why: Compiler translates the whole program first and it is executed afterwards (1) and interpreter executes each line as soon as it is translated (1).

Some marks1/2

The interpreter executes each line immediately after translating it.

Why: Correct interpreter timing (1); no comparison with when the compiler's translated code is executed.

No marks0/2

The compiler executes the program line by line as it translates it.

Why: Reverses the two translators; a compiler does not execute the program it translates, so no mark.

3Convert2 marksDenary to Binary Conversion Swap Remove

Computer systems manipulate bit patterns.

Convert the denary number 140 to 8-bit binary.

[2 marks]
Mark scheme

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

  • 1000 (1)
  • 1100 (1)

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

Example answers and how they were marked
Full marks2/2

1000 1100

Why: 140 = 128 + 8 + 4: both nibbles are correct (2).

Some marks1/2

1000 1101

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

No marks0/2

0011 0001

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.