Skip to main content

Back to the full dot-point answer

EnglandComputer ScienceQuick questions

Component 1: Programming and System Development

Quick questions on Recursion and Big-O complexity - Eduqas A-Level Computer Science Component 1

3short Q&A pairs drawn directly from our worked dot-point answer. For full context and worked exam questions, read the parent dot-point page.

What is q1?
Show answer
State the two parts every correct recursive subroutine must have. [2 marks]
What is q2?
Show answer
Why can deep recursion cause a stack overflow? [1 mark]
What is q3?
Show answer
Place in order of efficiency for large nn, best first: O(n)O(n), O(1)O(1), O(n2)O(n^2), O(log⁡n)O(\log n). [1 mark]

Have a question we have not covered?

This dot-point answer is short enough that we have not extracted many short questions yet. Read the full dot-point answer or ask Mo, our study assistant, in the chat for follow ups.

All Computer ScienceQ&A pages