Search Header Logo

147. OCR A Level (H046-H446) SLR25 – 2.3 Standard algorithms

Authored by James Cole

Computers

11th Grade

Used 1+ times

147. OCR A Level (H046-H446) SLR25 – 2.3 Standard algorithms
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

15 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is an algorithm?

A data storage unit

A type of computer hardware

A programming language

A sequence of steps followed to solve a problem

Answer explanation

An algorithm is a sequence of steps followed to solve a problem, making it the correct choice among the options provided.

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which sorting algorithm is NOT required at AS level?

Bubble sort

Quick sort

Merge sort

Insertion sort

Answer explanation

Merge sort is NOT required at AS level, as it is more complex and not typically covered in basic sorting algorithm topics.

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

How many additional sorting algorithms must you learn for the full A level?

None

Three

Two

One

Answer explanation

To cover the full A level, you need to learn two additional sorting algorithms beyond what you already know.

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is a searching algorithm you need to know for AS level?

A* algorithm

Linear search

Dijkstra's shortest path

Merge sort

Answer explanation

Linear search is a basic searching algorithm commonly taught at AS level, making it the correct choice from the options provided.

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What type of algorithms find satisfactory or optimal paths between vertices or nodes on a graph?

Sorting algorithms

Searching algorithms

Data structuring algorithms

Path finding algorithms

Answer explanation

Path finding algorithms are specifically designed to find satisfactory or optimal paths between vertices or nodes on a graph.

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which path finding algorithm is NOT required for the full A level?

Dijkstra's shortest path

A* algorithm

Linear search

None of the above

Answer explanation

Linear search is NOT required for the full A level as it is a basic searching algorithm and not typically covered in depth at that level.

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What are you expected to do with most algorithms in the exam?

Only trace them

Read, trace, and write them

Only write them

Only read them

Answer explanation

The correct choice is to read, trace, and write most algorithms in the exam, as it involves a comprehensive understanding and application of the algorithms.

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?