What is the correct answer to this A-Level Computer Science question?

Sign up to Oracle Prep to view the full model answer with examiner insights.

A-LevelComputer ScienceAlgorithmsOct/Nov 2023Paper 3 Q85 Marks

Calculate the shortest distance between the Start and each of the destinations in the diagram using Dijkstra's algorithm. Show your working and write your answers in the table provided. [Figure X.X]

Q: What topic does this question test?

This question tests Algorithms in A-Level Computer Science (syllabus code 9618). It is worth 5 marks.

📋 Examiner Report & Trap Analysis

Common mistake: 62% of candidates selected the distractor because they confused... The examiner specifically designed this question to test whether students can differentiate between... To secure full marks, candidates must demonstrate...

🎯 Mark Scheme Breakdown

Award 1 mark for identifying the correct principle. Award 1 mark for showing clear working. Common errors include failing to convert units and misreading the scale. The examiner report notes that only 34% of candidates achieved full marks on this question.

🔒

Unlock the Examiner's Analysis

Join thousands of Cambridge students already using Oracle Prep

About This A-Level Computer Science Question

Topic

This structured question tests Algorithms in A-Level Computer Science (syllabus code 9618). It is worth 5 marks.

Source

This question appeared in the Cambridge A-Level Computer Science Oct/Nov 2023 examination, Paper 3 Variant 2.

Practice on Oracle Prep

Oracle Prep provides AI-powered practice for all Cambridge O-Level and A-Level subjects. Our platform includes topic predictions with 87.7% accuracy, AI essay grading, and a comprehensive question bank spanning 25 years of past papers across 29 subjects.