Menu
Exam Questions

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

2 questions · 3 marks

Pick again
Print
1Multiple choice1 markImages Swap Remove

Identify the smallest identifiable area of a bitmap image.

[1 mark]
  • AColour depth
  • BFile size
  • CPixel
  • DResolution
Mark scheme
  • C Pixel (1)
  • The only correct answer is C. The correct answer is pixel.
  • A is not correct because colour depth is the number of bits used to store the colour of each pixel
  • B is not correct because file size is the amount of storage an image takes up, not an area of the image
  • D is not correct because resolution is a measure of the number of pixels in an image (such as its width × height), not the smallest identifiable area
Example answers and how they were marked
Full marks1/1

C Pixel

Why: Correct option; a pixel is the smallest identifiable area of a bitmap image (1).

No marks0/1

D Resolution

Why: Resolution is a measure of the number of pixels in an image, not the smallest identifiable area; no mark.

No marks0/1

A Colour depth

Why: Colour depth is the number of bits used to store each pixel's colour, not the smallest identifiable area; no mark.

2Describe2 marksMemory Management Swap Remove

An operating system keeps a record of the memory it has allocated to each program.

Describe how this record is used.

[2 marks]
Mark scheme

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

  • The start and end address/size of the block allocated to each program is recorded (1) so the operating system knows which areas of main memory are in use and which are free (1)
  • The record is checked before memory is allocated (1) so memory already in use is not given to another program/is not overwritten (1)
  • The record is searched for a free block that is large enough (1) so a newly loaded program is placed in a suitable area of main memory (1)
  • The record is updated when a program ends/closes (1) so the memory it was using is marked as free for other programs (1)

Allow the record to be called a memory map/memory table/allocation table.

A response that only says the operating system keeps a record/list of the memory each program is using, without saying what the record contains, earns 0 marks.

A response that states what the record contains, e.g. the addresses/the start and end address of each block, earns 1 mark even if it does not say how the record is used.

Do not accept responses about saving programs/files to secondary storage or about moving programs to virtual memory, as these are not uses of this record.

Example answers and how they were marked
Full marks2/2

The operating system records the start and end address of the block of memory given to each program so that it does not give the same memory to another program.

Why: The start and end address of each block is recorded (1) linked to memory already in use not being given to another program (1).

Some marks1/2

The operating system records the start and end address of the memory used by each program.

Why: States what the record contains (1), but does not develop how the record is used, so the second mark is not earned.

No marks0/2

The operating system saves the programs to the hard disk so there is enough memory for other programs.

Why: Describes moving programs to secondary storage rather than how the record of allocated memory is used; no creditworthy point is made.

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

4.2 Network security

Build a paper on this topic 36
Network Security Risks 18 questions Preventing Network Security Risks 18 questions

5.1 Environmental

Build a paper on this topic 36
E-waste 17 questions Manufacturing Technology 19 questions

5.2 Ethical and legal

Build a paper on this topic 18
Data Protection Act 14 questions Impact of AI 4 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.