Questions: Algorithms
New numbers every time.
Computational thinking
- Abstraction: what to leave outIdentify, 1 mark, free
- Computational thinking wordsIdentify, 1 mark, free
- Which technique is this?Identify, 1 mark, free
- Flowchart symbolsState, 1 mark, free
- Follow an algorithm written as stepsCalculate, 2 marks, free
- Input, process, outputIdentify, 1 mark, free
- Reading a structure diagramState, 2 marks, free
- Adding to a structure diagramIdentify, 2 marks, free
Linear search and binary search
- Linear search: comparisonsState, 1 mark, free
- Binary search: the items comparedWrite down, 2 marks, free
- Binary search: first item and comparisonsState, 2 marks, free
- Which list can binary search use?Identify, 1 mark, free
- Why binary search needs a sorted listExplain, 1 mark, free
- Binary search: the most comparisonsState, 1 mark, free
- Linear or binary search?Choose, 1 mark, free
- Binary search on wordsWrite down, 2 marks, free
- Searching for an item that is not thereState, 3 marks, free
- Explain a binary searchExplain, 4 marks, free
Bubble sort
- Bubble sort: the first passWrite down, 2 marks, free
- Bubble sort: a later passWrite down, 2 marks, free
- Bubble sort: swaps in a passState, 1 mark, free
- Bubble sort: passes, swaps and comparisonsState, 3 marks, free
- Bubble sort: complete the tableComplete, 3 marks, free
- Bubble sort: which statement is true?Identify, 1 mark, free
- Bubble sort into descending orderWrite down, 2 marks, free
- Bubble sort on wordsWrite down, 2 marks, free
- Bubble sort: when is it sorted?State, 2 marks, free
Insertion sort and merge sort
- Insertion sort: after some passesWrite down, 2 marks, free
- Insertion sort: complete the tableComplete, 3 marks, free
- Insertion sort: items movedState, 1 mark, free
- Merge sort: the first splitWrite down, 2 marks, free
- Merge two sorted listsWrite down, 2 marks, free
- Merge sort: merging back upWrite down, 3 marks, free
- Which sort is it?Identify, 1 mark, free
- Which sorting algorithm?Identify, 1 mark, free
- Describe a merge sortDescribe, 4 marks, free
Comparing algorithms, and searching in code
- Worst cases for searchingState, 2 marks, free
- Comparisons as the list growsComplete, 3 marks, free
- Search timeCalculate, 4 marks, free
- Trace a linear searchComplete, 4 marks, free
- Complete a binary searchComplete, 3 marks, free
- What does this program output?State, 1 mark, free
- Efficiency: which statement is true?Identify, 1 mark, free
- Choose algorithms for a system (6 marks)Evaluate, 6 marks, free
More trace tables: nested loops, arrays and subroutines
- Trace tables and subroutines: ideasIdentify, 2 marks, free
- Trace table: nested loopsComplete, 6 marks, free
- Output of nested loopsState, 3 marks, free
- How many times does a nested loop run?Calculate, 2 marks, free
- Trace table: a loop over an arrayComplete, 5 marks, free
- An array changed by a loopComplete, 3 marks, free
- Trace table: a while loop over an arrayComplete, 4 marks, free
- Trace table: a function called in a loopComplete, 5 marks, free
- What does the function return?Calculate, 3 marks, free
- Following function callsCalculate, 2 marks, free
- Trace a program to find its bugComplete, 5 marks, free
- Find and fix the bugIdentify, 2 marks, free
Flowcharts
- Which flowchart symbol?Identify, 2 marks, free
- Spot the wrong symbolIdentify, 2 marks, free
- Follow a flowchart with decisionsState, 2 marks, free
- Follow a flowchart with a loopCalculate, 3 marks, free
- Trace table for a flowchartComplete, 5 marks, free
- Complete a flowchart: a missing boxComplete, 2 marks, free
- Complete a flowchart: the decisionComplete, 2 marks, free
- Draw a flowchartDraw, 6 marks, free
AQA, Pearson Edexcel and OCR are registered trade marks of their owners. Brainlag Learn is independent: it is not affiliated with or endorsed by any exam board, and every question on it is original.