Understanding simple algorithms

QuizÂ by GCSE AQA Computer Science

GCSE (AQA)
Computer Science
English National Curriculum

Feel free to use or edit a copy

includes Teacher and Student dashboards

### Measures 1 skill fromGCSE (AQA)Computer ScienceEnglish National Curriculum

3.1.2

Track each student's skills and progress in your Mastery dashboards

• edit the questions
• save a copy for later
• start a class game
• view complete results in the Gradebook and Mastery Dashboards
• automatically assign follow-up activities based on studentsâ€™ scores
• assign as homework
• share a link with colleagues
• print as a bubble sheet

### Our brand new solo games combine with your quiz, on the same screen

Correct quiz answers unlock more play!

12 questions
• Q1
Why are algorithms represented in flowcharts or pseudo-code?
To offer a level of abstraction in viewing the problem
So that they can easier understood by people looking at them
So anyone, regardless of their chosen programming language, can follow them
All of these
45s
3.1.2
Edit
Delete
• Q2
Which of these statements is not true about an efficient algorithm?
Less lines of code mean it is more efficient
Efficient algorithms should aim to take the minimum time needed to execute
You can write code in less lines as long as it achieves the same result
Using subroutines can make algorithms more efficient
45s
3.1.2
Edit
Delete
• Q3
What is the benefit of using trace tables with algorithms?
To save time programming it
To show further testing
To be able to test the algorithm for logical errors
To be able to answer exam quiestions
45s
3.1.2
Edit
Delete
• Q4
Which of these algorithms would improve the one above to make it more efficient?
OUTPUT(a) x 3
Create a for loop to print 'a' three times.
You can not make it more efficient
OUTPUT(a,a,a)
45s
3.1.2
Edit
Delete
• Q5
What is the output of this algorithm?
It will return true or false depending on if x == 10
It will output the value True or False as a string
IT will output the value of 10 + 1
It will output the value 10
45s
3.1.2
Edit
Delete
• Q6
If the user input into this algorithm is 3, what is the output?
12
7
4
6
45s
3.1.2
Edit
Delete
• Q7
If the value 'Sophie' is input into this algorithm, what is the output?
You are not Sue
You are not Sophie
Hello Sophie
Hello Sue
45s
3.1.2
Edit
Delete
• Q8
If the user input into this algorithm is 10, what is the output?
20
4
10
40
45s
3.1.2
Edit
Delete
• Q9
What is this algorithm doing?
Creating a binary search on a list
Creating a linear search on an array
Creating a bubble sort to sort a data set
Creating a merge sort to sort a data set
45s
3.1.2
Edit
Delete
• Q10
What are lines 2 and 5 of this algorithm doing?
Telling the while loop to end
Declaring the start and end of the while loop
Declaring the start of the while loop
printing the while loop
45s
3.1.2
Edit
Delete
• Q11
What are lines 4 and 12 doing in this algorithm?
They are looking for the mid pointer
They are creating a condition controlled loop
They are creating a count controlled loop
They are ending the loops
45s
3.1.2
Edit
Delete
• Q12
Why is it important to decompose a problem before writing the algorithms?
To be able to write one larger algorithm
To test the algorithms first
You do not need to, it is time consuming
This allows you to write smaller algorithms that deal with each sub problem
45s
3.1.2
Edit
Delete

Teachers give this quiz to your class