Edexcel GCSE Computer Science (1CP2) Exam Questions

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

• Statements are written using words/phrases that look like English or maths (1) so the code is easier to read/understand/write (1)
• One statement is translated into several machine code instructions (1) so programs are shorter to write than in a low-level language (1)
• High-level languages provide built-in data structures such as arrays/lists/records (1) so a collection of data items can be stored and accessed under one name (1)

Do not accept responses that only give a benefit or drawback, such as 'it is easier to learn', with no characteristic.

Do not accept 'it is easier than a low-level language' without saying what the characteristic is.

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

• Devices (can) understand/interpret the data they receive (1) because they follow the same set of rules for communication (1)
• Data is sent in an agreed format/structure (1) so the receiving device can interpret/understand it correctly (1)
• Devices (can) connect/communicate successfully (1) because they agree how the data is transmitted, such as the type of signal used (1)
• Errors (can) be detected/handled (1) because both devices follow the same rules for checking the data (1)

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

Do not accept 'so devices can talk/communicate with each other' or 'so they can understand each other' without saying they follow the same rules/agreed format.

Do not accept an answer that only states protocols are a set of rules, without saying what this allows (e.g. the data can be understood/interpreted).

Do not accept a faster connection/speed as a reason why protocols are needed.

Do not accept naming a protocol (e.g. TCP/IP, HTTP, Wi-Fi) without an explanation of why it is needed.

Do not accept a description of what a protocol does (e.g. 'TCP splits data into packets') without saying why this is needed.

Indicative content

User accounts

• Each student and teacher should have their own user account, so the operating system can identify the person who is logged on.
• The operating system keeps a record of all valid users on the computer, so unknown users are not allowed to log in.
• A separate home area or folder can be created for each account, so a student's saved work is kept apart from other users' work.
• An account can be disabled when a student leaves the school, so they can no longer access the computers.

Authentication

• A username and password can be required at login, so only users with the correct details can use the computer.
• The operating system checks the entered password against the stored password for that account before allowing access.
• Users should be encouraged to choose a strong password, which makes it harder for someone else to guess and log in.
• The operating system can lock an account after several failed login attempts, which reduces the chance of someone trying passwords repeatedly.

Benefits for the school

• Many students can share the same computers because each person's files are kept separate.
• Work is less likely to be deleted or changed by another student, because users only see their own files.
• The school can see which account was used on a computer, so misuse can be traced to a user.
• Teachers can be confident that only authorised people can use the library computers.
• The school does not need a separate computer for every student, so it saves money.

Levels

• Level 0 (0 marks): No rewardable content.
• Level 1 (1–2 marks): Basic, independent points are made, showing elements of understanding of key concepts/principles of computer science. (AO1) The discussion will contain basic information with little linkage between points made or application to the context. (AO2)
• Level 2 (3–4 marks): Demonstrates adequate understanding of key concepts/principles of computer science. (AO1) The discussion shows some linkages and lines of reasoning with some structure and application to the context. (AO2)
• Level 3 (5–6 marks): Demonstrates comprehensive understanding of key concepts/principles of computer science to support the discussion being presented. (AO1) The discussion is well developed, with sustained lines of reasoning that are coherent and logically structured, and which clearly apply to the context. (AO2)

Level 3 responses must cover both user accounts and authentication, and apply them to the school library.

Do not accept general operating system functions such as file management or process management unless they are explicitly linked to managing users.

Indicative content

Control of the hardware

• Low-level languages can read and write the contents of registers and memory addresses directly, so the firmware can take the values from the distance sensors without calling a library routine.
• Assembly language instructions can read from and write to specific input/output ports on the vacuum cleaner's processor, so the motors can be switched on and off directly.
• The programmer decides exactly which processor operations are carried out and in which order, which matters when the vacuum must reverse away from a step or an obstacle.
• A low-level language puts nothing between the program and the hardware, so the programmer can control the hardware of the vacuum cleaner precisely.

Efficiency of the code

• Assembly language code can be hand-optimised instruction by instruction, so the code that checks a sensor is as short as possible.
• The programmer can choose which registers hold values that are used again and again, which cuts down the number of memory accesses the firmware needs.
• A hand-written low-level program can be made compact, so it is more likely to fit in the small amount of memory the vacuum cleaner has.
• Because each instruction does one defined job, the time taken to react to a sensor reading is predictable, which suits firmware that must not overrun.

Link between the language and the processor

• Low-level languages are processor-specific, so the instructions used are those of the exact processor in the vacuum cleaner rather than general statements that need translating.
• Each assembly language instruction maps to one machine code instruction, so the programmer knows precisely which processor operation will be carried out by each line of code.
• An assembler turns each mnemonic into its machine code equivalent, so the machine code running on the vacuum cleaner's processor is exactly what the programmer wrote.
• Code written for a different processor would have to be rewritten, which is acceptable here because the vacuum cleaner always uses the same processor.

Levels

• Level 0 (0 marks): No rewardable content.
• Level 1 (1–2 marks): Basic, independent points are made, showing elements of understanding of key concepts/principles of computer science. (AO1) The discussion will contain basic information with little linkage between points made or application to the context. (AO2)
• Level 2 (3–4 marks): Demonstrates adequate understanding of key concepts/principles of computer science. (AO1) The discussion shows some linkages and lines of reasoning with some structure and application to the context. (AO2)
• Level 3 (5–6 marks): Demonstrates comprehensive understanding of key concepts/principles of computer science to support the discussion being presented. (AO1) The discussion is well developed, with sustained lines of reasoning that are coherent and logically structured, and which clearly apply to the context. (AO2)

Within Level 1, award 1 mark for a single basic point and 2 marks for two or more independent basic points; Level 2 requires the points to be linked to the vacuum cleaner; Level 3 requires both control of the hardware and efficiency of the code, and a few concise, linked sentences can reach Level 3, so extra length is not required.

Accept registers, memory addresses, input/output ports, machine code and mnemonics as ways of describing access to the hardware, and accept 'a low-level language is faster' as a basic point on its own. Do not award 'binary is a low-level language' (machine code is written in binary, but binary is not a language), or characteristics of high-level languages such as being easy to read or portable, as characteristics of a low-level language.