Suitability of Algorithms (OCR A-Level Computer Science): Quizzes
📚Quizzes
Practise the questions
12 questions from this quiz
ShowHide
Practise the questions
12 questions from this quiz
What two metrics are used to measure algorithm efficiency?
What two metrics are used to measure algorithm efficiency?
Execution time and space
What does time complexity represent?
What does time complexity represent?
Constant time
Which components are included in space complexity measurement?
Which components are included in space complexity measurement?
Input data, temp variables, call stack
What do large inputs require for good performance?
What do large inputs require for good performance?
Lower time complexity
What is Bubble Sort's time complexity?
What is Bubble Sort's time complexity?
Why is Merge Sort suitable for large data sets?
Why is Merge Sort suitable for large data sets?
It has time complexity
What does Binary Search require to function?
What does Binary Search require to function?
Sorted data
Which search is suitable for unsorted data?
Which search is suitable for unsorted data?
Linear Search
Why is iterative factorial more suitable than recursive?
Why is iterative factorial more suitable than recursive?
More memory-efficient
What is the time complexity of recursive Fibonacci?
What is the time complexity of recursive Fibonacci?
With memory constraints, which complexity should you prefer?
With memory constraints, which complexity should you prefer?
Lower space complexity
What common mistake do students make when analysing algorithms?
What common mistake do students make when analysing algorithms?
Focusing only on time complexity