Skip to content

Course home

Algorithms

Algorithms

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667
Question 14

An algorithm is designed to count how many heart rate readings in a dataset are below 40 beats per minute (bpm).

SET low_count TO 0
FOR EACH reading FROM heart_rates DO
    IF (reading < 40) THEN
        SET low_count TO low_count + 1
    END IF
END FOREACH
SEND 'Low heart rate occurrences: ' & low_count TO DISPLAY

A small dataset is sorted in ascending order and stored in the array heart_rates as follows:

42, 46, 51, 55, 63, 70

Describe one inefficiency when executing this algorithm with this dataset.

[2]
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