Back to the full dot-point answer
EnglandComputer ScienceQuick questions
Component 1: Programming and System Development
Quick questions on Linear search, binary search and graph traversal - 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 precondition for binary search and its time complexity. [2 marks]
What is q2?Show answer
A breadth-first traversal uses which auxiliary data structure? [1 mark]
What is q3?Show answer
Give one situation where linear search is more appropriate than binary search. [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.