Advanced A-Level Programming
CP519 Face to face course
Deepen your knowledge of algorithms, recursion, and Big O notation with this CPD course for new A-level Computer Science teachers.
Skip to course bookingThis course equips new A-level computer science teachers with advanced programming skills, focusing on search and sorting algorithms, recursion, and Big O notation.
Who is it for?
This course is designed for teachers of A-level computer science who want to strengthen their understanding of complex algorithmic concepts.
Topics covered
01 | Sorting Algorithms: Explore bubble sort, merge sort, quicksort, and insertion sort, including time and space complexities.
02 | Recursive Programming: Understanding recursion with practical examples and its comparison to iterative methods.
03 | Search Algorithms: Linear and binary search, their applications, and time complexities.
04 | Big O Notation: Assess algorithmic efficiency with a focus on complexities from O(1) to O(n²).
How long is this course?
6 hours.
How will you learn?
Participants will engage in hands-on coding and interactive teaching strategies including code tracing, worked examples, incremental development and extension challenges.
Outcomes
By the end of this course, you will be able to:
- • Implement sorting algorithms, including bubble sort, merge sort, quicksort, and insertion sort.
- • Explain the principles of recursive programming and differentiate it from iterative approaches.
- • Apply recursive methods to solve problems and evaluate their performance against iterative solutions.
- • Identify and compare the characteristics of linear and binary search algorithms, including their time complexities.
- • Analyse and assess the efficiency of algorithms using Big O notation for time and space complexity.
This course is part of Teach secondary computing
Teach secondary computing
Our nationally recognised qualification will give you confidence to take your computing teaching to the next level and to apply those skills in the classroom.
Dates coming soon
Contact your local Computing Hub for more information
Find your local Hub
Adapted teaching and effective learning interventions in secondary computing
Develop an evidence-informed approach to education recovery over a sustained period, securing the computing education of young people following a period of great disruption.
Adapting the Teach Computing Curriculum for mixed-year classes - short course
Explore progression within Teach Computing Curriculum and how to use this to adapt it for your own mixed-age setting.
Advanced Data Structures for A-Level Computer Science
Following on from CP502 (which is a pre-requisite to this course) this PDE covers Linked Lists, Graphs, Trees and Binary Search Trees. Gain further confidence in teaching the data structures content in the A-level specification including attempting and marking exam questions.