Skip to content

Course home

Algorithms

Algorithms

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576
Question 22

An automated sorting facility maintains an unsorted digital catalog of N N\,N parcels currently on a conveyor belt. A control system uses a standard linear search algorithm to find a specific tracking number in the catalog.

a.

State the number of comparisons made in the best-case scenario, and identify the position of the target tracking number in the catalog that leads to this.

[1]
b.

State the number of comparisons made in the worst-case scenario, and describe the possible outcomes regarding the target tracking number that lead to this.

[1]
Markscheme

Algorithms Questions

  1. GCSE
  2. /Computer Science
  3. /Algorithms

159 exam-style questions on Edexcel GCSE Computer Science Algorithms, covering Constructs for solving problems, Variables, constants and data structures, Arithmetic, relational and logical operators, Tracing algorithm output with trace tables, Types of error and correcting logic errors, Standard algorithms (sorts and searches), and Evaluating algorithm fitness and efficiency. Each one has a worked solution and a mark scheme showing where the marks go.

Question bank