Skip to main content

Courses||Blog|Updates

Loading

© 2026 Kepler Revise. All Rights Reserved.

About Us | Blog | Reviews | Contact Us |Privacy Policy | Terms & Conditions |

Home
Courses
OCR A-Level Computer Science
Paths and Complexity

OCR · A-Level Computer Science

Paths and Complexity

4Topics

2.6hStudy time

In this section

4 topics

Dijkstra’s Shortest-Path Algorithm

Trace tentative distances and permanent choices

A*: Costs, Heuristics and Paths

Trace g, h and f with explicit tie-breaking

Big-O, Growth Rates and Resource Costs

Compare constant, logarithmic, polynomial and exponential growth

Algorithm Cases, Time, Space and Selection

Compare constant, logarithmic, linear, polynomial and exponential growth

Work through each topic to complete the section.