Menu
Exam Questions

Edexcel GCSE Computer Science (1CP2) Exam Questions

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

5 questions · 8 marks

Pick again
Print
1Multiple choice1 markCharacter Sets Swap Remove

Characters are encoded using 7-bit ASCII.

Identify the number of different characters that can be represented using 7-bit ASCII.

[1 mark]
  • A64
  • B127
  • C128
  • D256
Mark scheme
  • C 128 (1)
  • The only correct answer is C. The correct answer is 128.
  • A is not correct because 6 bits give only 64 different combinations
  • B is not correct because 127 is the largest 7-bit value, not the number of characters that 7 bits can represent
  • D is not correct because 256 characters need 8 bits, as used by 8-bit extended ASCII
Example answers and how they were marked
Full marks1/1

C 128

Why: Selects the only correct option (1): 7 bits give 2 to the power of 7, which is 128 different characters.

No marks0/1

D 256

Why: Near miss scoring 0: 256 is the number of characters that 8 bits give in extended ASCII, not 7-bit ASCII.

No marks0/1

B 127

Why: Misconception scoring 0, the off-by-one error the examiners' report describes: 127 is the largest 7-bit value, but 7 bits give 128 different characters.

2Short recall1 markUnits & Conversion Swap Remove

A file has a size of 2 kibibytes.

State the number of bytes in the file.

[1 mark]
Mark scheme

Award one mark for:

  • 2048 (1)
  • 2 × 1024 (1)
  • 2^11 (1)

Allow 2048 bytes.

Do not accept 2000, which is the number of bytes in two decimal kilobytes.

Do not accept 1024, which is the number of bytes in one kibibyte.

Do not accept 16, which is the number of bits in two bytes.

Example answers and how they were marked
Full marks1/1

2048

Why: 2048 is 2 × 1024, the number of bytes in 2 kibibytes (1).

No marks0/1

2000

Why: 2000 uses the decimal kilobyte, not the binary kibibyte; the mark scheme does not accept it.

No marks0/1

16

Why: 16 is the number of bits in two bytes, confusing bits with bytes; the mark scheme does not accept it.

3Describe2 marksUtility Software Swap Remove

A hard disk can become fragmented as files are saved and deleted.

Describe how disk defragmentation software improves the performance of a hard disk.

[2 marks]
Mark scheme

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

  • Parts of a file are moved so they are stored together/in consecutive locations (1) so the read/write head has less distance to travel to read the file (1)
  • Files are rearranged so that each file is stored in one block (1) which reduces the time taken to open/load the file (1)
  • Free space on the disk is collected into one area (1) so new files can be saved without becoming fragmented (1)
  • The parts of each fragmented file are put in order (1) so fewer movements of the read/write head are needed to read it (1)

Do not accept responses about compressing files, deleting files or increasing the amount of storage, as these are not what defragmentation software does.

Do not accept 'it makes the disk faster' without saying how the files are changed.

Example answers and how they were marked
Full marks2/2

It moves the parts of a file so they are stored together in consecutive locations (1), so the read/write head does not have to move as far and the file opens more quickly (1).

Why: Linked point (1) and development (1): the file parts are stored together, which reduces read/write head movement.

Some marks1/2

It reorganises the files on the hard disk so that they are stored together.

Why: The point is made (1) but there is no development saying how this improves performance, so the second mark is not awarded.

No marks0/2

It compresses the files so that they take up less space on the disk.

Why: This describes data compression software, which the mark scheme says is not accepted; no creditworthy point is made.

4Describe2 marksTranslators Swap Remove

High-level code can be translated by a compiler or by an interpreter.

Describe how a compiler translates high-level code differently from an interpreter.

[2 marks]
Mark scheme

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

  • The compiler translates the whole program/complete source code in one go (1) whereas the interpreter translates one line/statement at a time (1)
  • The compiler translates all of the source code before any of it is run/executed (1) but the interpreter translates each line/statement as it reads it (1)
  • The interpreter translates one line/statement at a time (1) and the compiler translates the whole program/source code together (1)

Accept the compiler point and the interpreter point in either order.

Do not accept responses about object code/executable files, when the translated code is executed, how errors are reported, or speed/memory use.

Do not accept 'the interpreter executes/runs each line' on its own, without saying that it translates one line/statement at a time.

Example answers and how they were marked
Full marks2/2

A compiler translates the whole program in one go, while an interpreter translates one line at a time.

Why: Whole program translated in one go (1) and interpreter translates one line at a time (1).

Some marks1/2

A compiler translates the whole program in one go.

Why: Whole program translated in one go (1); no linked point about the interpreter translating a line at a time.

No marks0/2

A compiler produces an executable file, but an interpreter does not.

Why: Describes the output, not the amount translated at a time; object code/executable files are not accepted.

5Calculate2 marksBinary Shifts Swap Remove

Computers manipulate binary patterns.

Complete the table with the result of applying the shift to the binary pattern.

[2 marks]
Binary patternShift8-bit binary result
1000 0001Logical shift right by 1
Mark scheme

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

  • 0100 (1)
  • 0000 (1)

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

Example answers and how they were marked
Full marks2/2

0100 0000

Why: Every bit moves 1 place right, with 0s in from the left: both nibbles are correct (2).

Some marks1/2

0100 0001

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

No marks0/2

0000 0010

Why: Shifts the bits the wrong way. Neither nibble is correct.

Questions by topic

2.1 Binary

Build a paper on this topic 58
Adding Binary Numbers 6 questions Binary and Hexadecimal Basics 10 questions Binary Shifts 6 questions Binary to Denary Conversion 6 questions Binary to Hexadecimal Conversion 6 questions Denary to Binary Conversion 6 questions Denary to Hexadecimal Conversion 6 questions Denary to Negative Binary Conversion 6 questions Hexadecimal to Binary Conversion 6 questions

2.2 Data representation

Build a paper on this topic 56
Character Sets 18 questions Images 19 questions Sound 19 questions

2.3 Data storage and compression

Build a paper on this topic 24
Compression 18 questions Units & Conversion 6 questions

3.1 Hardware

Build a paper on this topic 77
Embedded Systems 17 questions Fetch Decode Execute Cycle 15 questions Primary Memory 15 questions Secondary Memory 15 questions Stored Program Computers 15 questions

3.2 Software

Build a paper on this topic 124
File Management 18 questions Memory Management 16 questions Peripheral Management 11 questions Process Management 12 questions Purpose & Function of Operating Systems 17 questions Software Basics 13 questions User Management 18 questions Utility Software 19 questions

3.3 Programming languages

Build a paper on this topic 37
Low and High Level Languages 19 questions Translators 18 questions

4.1 Networks

Build a paper on this topic 138
Addressing 16 questions LANs & WANs 16 questions Network Speed 5 questions Packet Switching 16 questions Protocols & Layers 17 questions The Internet 16 questions Topologies 17 questions Wired Connections 17 questions Wireless Connections 18 questions

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

Activities Flashcards Revision notes

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.