Edexcel GCSE Computer Science (1CP2) Exam Questions

• B It is easier to learn, write and debug (1)
• The only correct answer is B. The correct answer is easier to learn, write and debug.
• A is not correct because direct control of the hardware is a reason for using a low-level language
• C is not correct because a low-level language produces smaller executable code
• D is not correct because low-level programs run more quickly than high-level programs

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

• Uses statements/instructions that look like English/maths (1)
• Does not depend on one type of processor / can be run on different types of computer with few or no changes (machine independent) (1)
• A single statement is translated into several machine code instructions (1)
• Provides data structures such as arrays and records (1)
• Provides built-in/library subprograms (1)
• Is translated by a compiler or an interpreter (1)

Allow portable/platform independent for machine independent.

Allow easier to read/write/understand/debug only when linked to the English-like statements, e.g. uses words that look like English so it is easier to understand.

Do not accept a high-level language / not a low-level language with no other detail.

Do not accept written in binary/machine code.

Do not accept faster to run / uses less memory, as these are characteristics of low-level languages.

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 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.

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.

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

• The same source code can be used on different processors (1) because a compiler/interpreter for each processor translates it into that processor's machine code/instructions (1)
• The program is machine/processor independent (1) because the code is translated into the machine code/instructions of each processor it is run on (1)
• A different compiler/interpreter is used for each type of processor (1) so the same source code can be translated into each processor's machine code/instructions (1)
• The program can be moved/copied to a computer with a different processor (1) because a compiler/interpreter that produces code for that processor exists (1)

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

Do not accept 'it is portable' without a linked reason about translation for different processors.

Do not accept 'it is easier to use/read/write' on its own without a linked reason about translation/processors.

Do not accept 'it is not written in binary'/'it is not machine code'/'it is not written in assembly language' as the reason without saying that the code is translated into each processor's machine code/instructions.

Do not accept the misconception that the program runs directly on any processor without being translated.

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

• The programmer can control/manipulate the hardware directly (1) because low-level instructions can access registers/memory addresses/hardware features (1)
• The code can be made to work efficiently with a specific device (1) because low-level languages are processor/chipset specific, so the instructions match that hardware (1)
• The code produced is fast to execute (1) because it is optimised for the specific processor/uses few instructions (1)
• The code produced is small (1) so it fits in the limited memory/ROM available in the device (1)

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

Fast execution and small code size are typical advantages of low-level languages; award them only where the linked reason relates to the device.

Do not accept 'it is easier to write/learn/understand' or 'it is faster to write' as a point or as the expansion, because low-level languages are not easier for these.

Do not accept 'it is close to the hardware' or 'it works with hardware' without expansion of what that allows the program to do.

Do not accept 'because it is low-level' as the expansion; the answer must say what the language/hardware allows.

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

Ease of learning, use and debug

• High-level language statements are written in English-like words and mathematical symbols, so the students can read the quiz game code and understand what each line does.
• The language is easier to learn than a low-level language, so students who are new to programming can start writing the quiz game quickly.
• Errors are easier to find and fix because the code is readable; for example, the students can check a line that updates a score against the rule they intended.
• The students do not need to know how the processor carries out each statement, so they can concentrate on the quiz questions and rules.

Data structures

• High-level languages provide lists or arrays, so the names and scores of all the players can be stored under one name and processed with a loop.
• A record can store a player's name and score as one item; in some languages a dictionary or class can be used instead, which keeps related data together.
• Using a data structure makes the code shorter and easier to understand than separate variables for every player's name and score.

Built-in functions and library routines

• High-level languages provide built-in functions such as print and input, so the students can display a question and read a player's answer without writing the underlying code.
• Library routines such as a random number generator can be used to choose quiz questions, saving the students time.
• String-handling routines can check or compare a player's answer, so the students do not have to write these routines themselves.
• Reusing tested routines reduces the amount of code the students write and can reduce errors in the quiz game.

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)

Additional guidance: Credit only points applied to the quiz game and the students; comparison with low-level languages is not required, but a correct contrast may support a point if it is applied. Do not award generic claims such as 'high-level programs run faster', 'work on any computer' or 'students do not need to learn syntax' unless they are justified for the quiz game.

Level 3 responses must cover all three bullet areas with linked reasoning that explains why the characteristic helps the students finish the game quickly with few errors; an answer covering only two bullet areas is limited to Level 2. Do not award the idea that high-level code is already machine code or is understood directly by the processor. Accept dictionaries or classes as equivalents of records.

Indicative content

Machine independence

• A high-level language is machine independent, so the same source code can be run on different types of computer with few or no changes.
• The company can write the program once and sell it to users with different computers, without rewriting the code for each type of computer.
• Only one version of the program needs to be written and maintained, so development takes the company less time.

Processor specificity

• A low-level language is processor-specific, so a program written for one processor will not run on a different processor without being rewritten.
• Assembly language instructions depend on the instruction set of the particular processor, so the company would need a separate version of the program for each type of computer.
• Writing a separate low-level version for every type of computer would take the company much longer than writing one high-level program.
• Low-level code gives direct control of the hardware of one processor, so it is better suited to device drivers than to a program that must run on many different computers.

Translation

• High-level source code is translated for each type of computer by a compiler or an interpreter, so one version of the source code is enough for all the users.
• Assembly language is translated into machine code by an assembler, and the assembler produces machine code for one specific processor only.
• Machine code is already in a form that one particular processor can execute directly, but the same machine code will not run on a different processor.
• Each high-level statement translates into several machine code instructions, so the programmer does not need to know the instruction set of the 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)

Additional guidance

• Level 3 responses must cover both high-level machine independence and low-level processor specificity, with the effect on the company's decision.
• Do not award low-level language, assembly language or machine code as portable, or 'high-level languages are written in English/like English' as a reason for machine independence.