GCSE Computer Science - Paper 2 (Algorithms & Programming)

What is an algorithm?

• A sequence of logical instructions for carrying out a task.

• A method of writing up a set of instructions for a computer program.

• A problem-solving method using computer science techniques.

• The process of extracting or withdrawing something.

Answer explanation

A sequence of logical instructions for carrying out a task.

What is computational thinking?

• A sequence of logical instructions for carrying out a task.

• A problem-solving method using computer science techniques.

• The process of extracting or withdrawing something.

• Breaking down a complex problem or system into smaller parts.

Answer explanation

A problem-solving method using computer science techniques.

What is abstraction?

• A sequence of logical instructions for carrying out a task.

• A method of writing up a set of instructions for a computer program.

• The process of extracting or withdrawing something.

• Breaking down a complex problem or system into smaller parts.

Answer explanation

The process of extracting or withdrawing something.

What is decomposition?

• A sequence of logical instructions for carrying out a task.

• A method of writing up a set of instructions for a computer program.

• The process of extracting or withdrawing something.

• Breaking down a complex problem or system into smaller parts.

Answer explanation

Breaking down a complex problem or system into smaller parts.

What is pseudocode?

• A sequence of logical instructions for carrying out a task.

• A method of writing up a set of instructions for a computer program using plain English.

• The process of extracting or withdrawing something.

• Breaking down a complex problem or system into smaller parts.

Answer explanation

A method of writing up a set of instructions for a computer program using plain English.

What is a trace table used for?

• To trace the value of variables as each line of code is executed.

• To write up a set of instructions for a computer program.

• To break down a complex problem into smaller parts.

• To extract or withdraw something.

Answer explanation

To trace the value of variables as each line of code is executed.

What is the first step in a linear search?

• Set counter to 0.

• Find out the length of the data set.

• Examine value held in the list at the counter position.

• Check to see if the value at that position matches the value searched for.

Answer explanation

The first step in a linear search is to find out the length of the data set.

What is a disadvantage of a linear search?

• It can be quite inefficient.

• It only works on ordered data sets.

• It requires complex algorithms.

• It cannot find the last item in the data set.

Answer explanation

Linear search can be quite inefficient due to its sequential nature of checking each element in the data set until the target is found.

What is the first step in a binary search?

• Set counter to 0.

• Find out the length of the data set.

• Start by setting the counter to the middle position in the list.

• Examine value held in the list at the counter position.

Answer explanation

Start by setting the counter to the middle position in the list.

What is a binary search used for?

• Searching an ordered list.

• Searching an unordered list.

• Writing up a set of instructions for a computer program.

• Breaking down a complex problem into smaller parts.

Answer explanation

Binary search is used for searching an ordered list, making it an efficient way to find elements in a sorted collection.