Ultimate A-Level Computer Science Podcast

🎧 A-Level Computer Science revision for OCR & AQA students. ⭐ If this podcast helps your revision, leaving a quick rating really helps other students find it.

In this bonus episode, we focus on the OCR A-Level Computer Science NEA evaluation section. We look at what evaluation is really for, how it links back to the original aims and success criteria, and what students need to do to show that their solution has been properly tested and reviewed.

The episode explains how to evaluate a finished project in a clear and structured way, including judging how well the solution meets user needs, identifying strengths and limitations, and reflecting honestly on possible improvements. It is designed to help students understand what a strong NEA evaluation looks like and how to approach this final section with confidence.

Perfect for OCR H446 Computer Science students completing the NEA.

This episode introduces optimization algorithms in computer science, specifically focusing on Dijkstra's shortest path algorithm and the A algorithm*. It explains how Dijkstra's algorithm finds the shortest path between a starting point and all other nodes in a weighted graph, with applications in areas like internet routing and GPS. The document then contrasts computable and incomputable problems, using the Travelling Salesman Problem (TSP) as an example of an intractable problem that is difficult to solve efficiently. Finally, it introduces heuristic methods as a practical approach for finding approximate solutions to intractable problems, and describes the A* algorithm as a path-finding algorithm that uses a heuristic function to focus on reaching a specific goal node.

🎧 A-Level Computer Science revision for OCR & AQA students. ⭐ If this podcast helps your revision, leaving a quick rating really helps other students find it.

In this bonus episode, we look at post-development testing for the OCR A-Level Computer Science NEA. This is the stage where students test the finished system in a structured and meaningful way to show whether it actually works as intended.

We cover the purpose of post-development testing, the difference between simply trying out a program and carrying out proper formal testing, and how to record evidence clearly. We also explain how test plans, expected outcomes, actual outcomes, and screenshots or other evidence can help demonstrate that the solution has been fully checked.

This episode is especially useful for students who want to strengthen the testing section of their NEA and make sure their evidence supports the marks available in the OCR H446 coursework project.

#ALevelComputerScience #OCRComputerScience #ComputerScienceNEA #OCRNEA #Coursework #ProgrammingProject #ALevelRevision #ComputerScienceRevision

🎧 A-Level Computer Science revision for OCR & AQA students.
⭐ If this podcast helps your revision, leaving a quick rating really helps other students find it.

In this episode, we break down Iterative Testing in the OCR A-Level Computer Science NEA (H446).

You’ll learn:

What iterative testing means and why it’s important

How to test your solution at each stage of development

How to present test data, expected results, and actual outcomes

How to identify issues and refine your solution

What examiners are really looking for in testing evidence

Common mistakes that cost marks

Iterative testing is essential for demonstrating that your solution works correctly and improves over time.

🎯 If you’re working on your NEA, make sure to also listen to the Design and Iterative Development episodes to understand how testing fits into the full development process.

This episode provides an overview of graph traversal algorithms, specifically depth-first search (DFS) and breadth-first search (BFS). It explains how to trace and describe typical applications for each algorithm, including illustrations of their operational steps using a sample graph. The text further details the data structures employed by each algorithm—a stack for DFS and a queue for BFS—and examines their complexity. Finally, it briefly discusses the application of these concepts to tree traversals, highlighting similarities and differences.