Chapter 31: Data Types: Floating Point Arithmetic

A-level Computer ScienceOCR6 topicsHigher

StudyStudy Material QuizQuiz ResourcesResources

Mock Papers

Exam-board mock papers

Mock papers launch from 1 August 2026. New papers will be added regularly from this date.

Dashboard tracking

Included with paid subject access

You can see the paper details now. Access unlocks when your plan includes this subject and tier.

Mock paperFeatured

Mock papers launch collection

alevel · computer-science · OCR · All papers

Releases 1 August 2026

Locked

Topic-aware long answers

Ultimate/Lifetime long-answer set

Ultimate and Lifetime users can create one saved set of 4 extended-response questions for this topic and mark answers with examiner-style feedback.

AI MCQ generation is available to paying students: 20 questions per session,2 sessions per month. Long-answer AI generation requires Ultimate or Lifetime access.

Free starter set

Searching, Sorting and Path Finding Long-Answer Questions

Examiner-style long-answer practice with automatic marking, improvement advice and ProofCoach tracking.

4 questions24 marks36 min

standard / hard / synoptic

6 marksdescribestandardOCR A

CS31-1 standard algorithms: describe how binary search, merge sort and Dijkstra's algorithm operates in ordering question attempts and finding a shortest learning path, using precise OCR H446 terminology.

0 characters

Write your answer first, then mark it.

6 marksexplainstandardOCR A

CS31-2 applied case: explain why binary search, merge sort and Dijkstra's algorithm would affect ordering question attempts and finding a shortest learning path, including one limitation or trade-off.

0 characters

Write your answer first, then mark it.

6 markswritehardOCR A

CS31-3 task for standard algorithms: write a response using binary search, merge sort and Dijkstra's algorithm in ordering question attempts and finding a shortest learning path; produce a justified algorithm choice.

0 characters

Write your answer first, then mark it.

6 marksevaluatesynopticOCR A

CS31-4 synoptic judgement: evaluate the suitability of binary search, merge sort and Dijkstra's algorithm for ordering question attempts and finding a shortest learning path, comparing it with one credible alternative.

0 characters

Write your answer first, then mark it.

Subject MCQ Bank

20 stored MCQs for this topic

Paying students get 20 stored MCQs per generation session and 2sessions each month. Your set is saved here so you can reset and retake it without using another allowance. If the bank is running low, replenishment happens in the background.

The 20-question stored MCQ bank is premium-only. Free users can study the starter unit and standard quiz, but bank practice unlocks after purchasing the subject.

Loading practice tools...

← Previous

30. Data Types: Binary Arithmetic

32. Data Types: Bitwise Manipulation and Masks

Key learning objectives

Understand the key principles behind Data Types: Floating Point Arithmetic.
Apply these ideas to exam-style questions.
Recall the essential definitions and key terms.