OCR A2 Computer Science Algorithms Quiz

OCR A2 Computer Science Algorithms Quiz

12th Grade

15 Qs

quiz-placeholder

Similar activities

Microsoft Excel

Microsoft Excel

KG - Professional Development

20 Qs

HTML

HTML

9th - 12th Grade

12 Qs

Baze de date-Design

Baze de date-Design

12th Grade

10 Qs

ClaseDispositivosPc

ClaseDispositivosPc

6th Grade - University

10 Qs

C-Programming Basics

C-Programming Basics

12th Grade

16 Qs

básico de Code

básico de Code

10th - 12th Grade

14 Qs

Aspek Legal TIK

Aspek Legal TIK

12th Grade

10 Qs

OCR A2 Computer Science Algorithms Quiz

OCR A2 Computer Science Algorithms Quiz

Assessment

Quiz

Computers

12th Grade

Practice Problem

Hard

Used 1+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

15 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the A* Algorithm?

A sorting algorithm that iterates through a list to find the smallest element.

A generalisation of Dijkstra's algorithm that approximately finds the shortest path between two nodes.

A method of traversing a graph by using a stack to travel as far along one route as possible.

An algorithm to search a list for a particular item by iterating through the list and checking each element.

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What does Big O Notation represent?

The average time an algorithm takes to complete on any input size.

The exact number of operations an algorithm will perform.

A way of classifying algorithms based on their complexity by setting an upper bound for the worst case space or time complexity.

The best case scenario for the time complexity of an algorithm.

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the time complexity of Binary Search?

O(n)

O(n^2)

O(log(n))

O(n log(n))

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which algorithm uses a queue to visit all the neighbours of the current node before exploring each of the neighbours' neighbours?

Depth-First Traversal

Binary Search

Breadth-First Traversal

Insertion Sort

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the time complexity of Bubble Sort?

O(n)

O(n log(n))

O(log(n))

O(n^2)

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

How does Depth-First Traversal differ from Breadth-First Traversal?

Depth-First Traversal uses a queue, while Breadth-First Traversal uses a stack.

Depth-First Traversal uses a stack, while Breadth-First Traversal uses a queue.

Depth-First Traversal is a sorting algorithm, while Breadth-First Traversal is a searching algorithm.

Depth-First Traversal is a searching algorithm, while Breadth-First Traversal is a sorting algorithm.

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the goal of Dijkstra's Shortest Path Algorithm?

To sort a list by repeatedly halving the sublist.

To search a list for a particular item by iterating through the list.

To find the shortest path between two nodes on a graph using a priority queue.

To divide a list into sorted and unsorted sections and place elements in the correct position.

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?