Advanced A-Level Programming CP519
Deepen your knowledge of algorithms, recursion, and Big O notation with this CPD course for new A-level Computer Science teachers.
Summary
This 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.
What topics are 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 will you learn?
Participants will engage in hands-on coding and interactive teaching strategies including code tracing, worked examples, incremental development and extension challenges.
How long is this course?
6 hours.
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.