Search Header Logo

AQA GCSE Computer Science 3.1 Fundamentals of Algorithms 1

Authored by Kelly McGovern

Computers

9th - 10th Grade

CCSS covered

Used 14+ times

AQA GCSE Computer Science 3.1 Fundamentals of Algorithms 1
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

21 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

What is the correct definition of an algorithm?

An algorithm is a step by step instructions to solve a problem.
An algorithm is a process of baking bread.
An algorithm is a software used to compute numbers.
An algorithm is the process of breaking problems.

Tags

CCSS.3.OA.D.8

CCSS.4.OA.A.3

CCSS.7.EE.B.3

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Decomposition is a term used to define...

The process of assigning value to a variable.
The process of taking out unnecessary details from problems.
The process of breaking down problems into smaller problems.
The process of coding a problem.

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Abstraction is.....

The process of drawing abstract pictures.
The process of assigning values to variables.
The process of breaking down problems.
The process of removing unnecessary details from a problem.

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What are the three algorithm constructs? 

Sequence, selection, repetition 
Input, output, process 
Input/output, decision, terminator    
Loop, input/output, process    

5.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

A flowchart needs to represent the a situation where for each mark a student is award 'Pass' or 'Fail'...the system will consider the mark and if it's 50 or over award 'Pass', else it awards 'Fail'. This is an example of which of the algorithm constructs?                                    

Decision 
Loop 
Sequence 
All of the above 

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Identify the description of a linear search

Put the elements in order, check each item in turn
Put the elements in order, compare to the middle value, split the list in order and repeat
Elements do not need to be in order, check each item in turn
Elements do not need to be in order, compare to the middle value, split the list in order and repeat

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Identify the description of a binary search

Put the elements in order, check each item in turn
Put the elements in order, compare to the middle value, split the list in order and repeat
Elements do not need to be in order, check each item in turn
Elements do not need to be in order, compare to the middle value, split the list in order and repeat

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?