AQA Computer Science GCSE - 3.1 Fundamentals of algorithms
Authored by Gary Cruttenden
Computers
10th - 12th Grade
Used 167+ times
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
A technique used to hide the underlying complexity of a system.
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
A sequence of steps that can be followed to complete a task.
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
To break down a problem into smaller sub-tasks.
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
A method of showing an algorithm graphically.
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
This stage turns the input into the output.
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
A way of representing an algorithm as a 'universal' programming language.
7.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
This is used to 'dry run' a program to see the value of variables and the program output.
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Microsoft
or continue with
%20(1).png)
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?
