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
Measures 1 skill from
GCSE (AQA)
Computer Science
English National Curriculum
3.1.2
Track each student's skills and progress in your Mastery dashboards
With a free account, teachers can
- 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
Show answers
- Q1Why are algorithms represented in flowcharts or pseudo-code?To offer a level of abstraction in viewing the problemSo that they can easier understood by people looking at themSo anyone, regardless of their chosen programming language, can follow themAll of these45s3.1.2EditDelete
- Q2Which of these statements is not true about an efficient algorithm?Less lines of code mean it is more efficientEfficient algorithms should aim to take the minimum time needed to executeYou can write code in less lines as long as it achieves the same resultUsing subroutines can make algorithms more efficient45s3.1.2EditDelete
- Q3What is the benefit of using trace tables with algorithms?To save time programming itTo show further testingTo be able to test the algorithm for logical errorsTo be able to answer exam quiestions45s3.1.2EditDelete
- Q4Which of these algorithms would improve the one above to make it more efficient?OUTPUT(a) x 3Create a for loop to print 'a' three times.You can not make it more efficientOUTPUT(a,a,a)45s3.1.2EditDelete
- Q5What is the output of this algorithm?It will return true or false depending on if x == 10It will output the value True or False as a stringIT will output the value of 10 + 1It will output the value 1045s3.1.2EditDelete
- Q6If the user input into this algorithm is 3, what is the output?1274645s3.1.2EditDelete
- Q7If the value 'Sophie' is input into this algorithm, what is the output?You are not SueYou are not SophieHello SophieHello Sue45s3.1.2EditDelete
- Q8If the user input into this algorithm is 10, what is the output?204104045s3.1.2EditDelete
- Q9What is this algorithm doing?Creating a binary search on a listCreating a linear search on an arrayCreating a bubble sort to sort a data setCreating a merge sort to sort a data set45s3.1.2EditDelete
- Q10What are lines 2 and 5 of this algorithm doing?Telling the while loop to endDeclaring the start and end of the while loopDeclaring the start of the while loopprinting the while loop45s3.1.2EditDelete
- Q11What are lines 4 and 12 doing in this algorithm?They are looking for the mid pointerThey are creating a condition controlled loopThey are creating a count controlled loopThey are ending the loops45s3.1.2EditDelete
- Q12Why is it important to decompose a problem before writing the algorithms?To be able to write one larger algorithmTo test the algorithms firstYou do not need to, it is time consumingThis allows you to write smaller algorithms that deal with each sub problem45s3.1.2EditDelete
