J277 GCSE Computer Science 2.1 Algorithms

What is the first step of the linear search algorithm?

• Identify the middle item in the list

• Identify the first item in the list

• Identify a random item in the list

• Identify the last item in the list

Ignoring any information about a problem that isn't important is called...

• decomposition

• abstraction

• algorithmic thinking

• pattern matching

Which of the following search algorithms can only be carried out on an ordered list?

• Linear search

• Binary Search

Computational thinking is used to...

• improve the efficiency of an existing program or piece of code

• turn a problem into something that can be solved by the computer

• help you think like a computer

• tell the programmer the rules of a programming language

A programmer solves a complex task by writing many small sub programs. This is an example of...

• decomposition

• abstraction

• authentication

• pipelining

A program is used to sort a very large list of unordered words into alphabetical order. Which sorting algorithm would sort the list most efficiently?

• Bubble sort

• Insertion sort

• Merge Sort

• Binary Search

A benefit of using Algorithmn 1 over Algorithm 2 is that...

• it can be more easily converted into a programming language.

• it can be interpreted by all programming languages

• it uses the proper syntax of all programming languages

• it is vague and unstructured

A issue with Algorithmn 2 is that...

• it can be easily converted into a programming language.

• it can be interpreted by all programming languages

• it does not use the proper syntax of a programming language

• it is vague and unstructured

Which of the following data types could store the value 45.31?

• Integer

• Real/Float

• Boolean

• String

Which expression evaluates to TRUE?

• 3 < 5 AND 1 > 2

• 1 != 1 or 4 < 5

• NOT ( 7 > 3 )

• 5 <= 3 OR 8 >= 9