Edexcel GCSE Computer Science (1CP2) Exam Questions

• B Compiler (1)
• The only correct answer is B. The correct answer is compiler.
• A is not correct because an assembler translates assembly language code into machine code, not a high-level program
• C is not correct because an interpreter translates and executes the code line by line, without producing a complete machine code program first
• D is not correct because a linker combines object code files into a single executable, it does not translate source code

Award one mark for any of the following:

• Translation/execution stops (when the error is found) / the rest of the program is not translated/executed (1)

Allow stops/terminates/halts when the error is found

Do not accept shows/displays an error message on its own

Do not accept the whole program is translated and errors are reported at the end

Do not accept translates line by line on its own

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

• It can control/manipulate the hardware (components/registers/memory locations) directly (1)
• Each instruction maps to a single machine-code instruction, so the behaviour/timing can be controlled precisely (1)
• The code can run very quickly / has a fast execution time (1)
• The code uses less memory/RAM (1)
• The code can be optimised for a particular processor/chipset (1)

Only award one mark where both 'controls the hardware' and 'accesses registers/memory locations' are given, as these are the same point.

Do not accept 'it is closer to the hardware' without saying that it controls or accesses the hardware directly.

Do not accept easier/faster to write/program/learn/understand/debug (these are advantages of high-level languages).

Do not accept faster/quicker without qualification.

Do not accept portable/machine independent.

Do not accept does not need to be translated/compiled (assembly language must be assembled).

Do not accept it is a low-level language / a repeat of the question.

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

• The (same) program/source code can run on different types/makes of computer/processor (1)
• With few/no changes (to the program code) (1)
• The same source code can be translated for each type of processor (1)
• A different compiler/interpreter is used for each type of processor (1)
• The program does not depend on one specific type of processor/hardware (1)
• Only one version of the program needs to be written/kept (1)
• The program is portable between different computers (1)

Allow 'different computers' as meaning different types of computer/processor.

Do not accept a program that will only run on one type of computer / the computer it was written on.

Do not accept written in machine code/binary, is translated into machine code, compiled/interpreted, is a low-level language.

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

• Translates/converts (high-level/source) code one line/statement at a time (1)
• Translates/converts the code and executes/runs each line as it goes (1)
• Executes/runs each line/statement immediately after it is translated (1)
• Reports/stops with an error message as soon as a syntax error is found (1)

Allow 'runs' for executes, 'converts' for translates and 'instruction' for line/statement

Do not accept translates the whole program before it is run

Do not accept produces/creates object code, an executable file or machine code that is saved

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

• Statements are written in English-like words/use maths symbols (1) so the programmer can understand more easily what each one does (1)
• The language uses meaningful names for variables/structured constructs such as loops (1) so the code is easier to read/follow (1)
• One statement translates into several machine code instructions (1) so there are fewer instructions to learn/understand for the same task (1)

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

Do not accept 'it is easier' / 'it is simpler' on its own, without saying what is easier/simpler.

Do not accept 'the computer understands it directly' / 'it does not need translating'.

Do not award answers about the program running faster or using less memory, as these are not about ease of learning.

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

• The compiler produces object code/machine code for the whole program (1) so there is no complete executable until every line has been translated (1)
• The compiler translates all the source code before producing the object code (1) so the program cannot start until translation has finished (1)
• The compiler checks the whole program for errors during translation (1) so all of the source code must be read before an executable can be produced (1)

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

Allow 'in one go'/'all at once' for the translation point, but this does not earn the second mark unless it is linked to why the program cannot be executed until translation has finished.

A statement that the whole program is translated, with no linked reason about when the program can be executed, earns 1 mark only.

Do not accept 'a compiler is faster' or 'compiled code runs faster' on its own; this does not explain why translation must finish before execution.

Do not accept 'it translates and runs the program one line at a time', as this describes an interpreter.

Indicative content

The output of each type of translator

• A compiler translates the whole program in one go and produces object code.
• The object code is saved as an executable file, which is already in machine code so the processor can run it directly.
• An interpreter does not produce object code, so no translated file exists for the company to save and sell.
• An interpreter translates one line at a time and executes it immediately, but that translation is not kept.

Whether the program has to be translated each time it is run

• Compiled code is translated once, so the executable can be run as many times as the customer likes without being translated again.
• If the source code is edited, the whole program has to be compiled again to produce a new executable.
• An interpreted program is translated again every time it is run, so a customer who runs the program often waits for translation at every run.
• An executable runs faster than interpreted code because it is already in machine code.

What the customer needs on their computer to run the program

• A customer who installs the executable needs no compiler on their computer, so the program will run straight away.
• If the company supplied the source code instead, the customer would need an interpreter installed, and it would have to be an interpreter for their type of computer.
• A customer given only the executable does not have the source code, so cannot change the program.

Conclusion

• A compiler is the better choice for this company, because the executable can be sold and the customer runs it without it being translated again and without being given the source code.
• Using an interpreter would mean supplying the source code to customers and translating the program on every run.

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 all three bullets for this company's program, including translating once rather than on every run, and reach a conclusion.

Do not accept 'a compiler fixes errors' (a compiler reports syntax errors at the end of translation, it does not fix them) or 'a compiler is easier to use' with no link to output, translation or the customer. Do not accept answers about translating to assembly language.

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.