Check your understanding of Algorithms & Programming at AS level first.
Click on the button on the right, AND/OR choose UNIT 1 - Topic 9 Algorithms & Programming, above - NOTE there are several subpages in Topic 9, make sure you look at them all. There are buttons on the AS page to take you to the various topics pages for AS.
Simplify Boolean expressions using Boolean identities, rules and De Morgan’s laws
Recursion - Explain the use of recursion in algorithms and programs and consider the potential elegance of this approach.
Validation and Verification - Identify, explain and apply appropriate techniques of validation and verification in algorithms and programs.
Sorting - Explain the need for a variety of sorting algorithms both recursive and non-recursive
Sorting - Describe the characteristics of sorting algorithms, including quicksort.
Searching - Follow search and sort algorithms and programs and make alterations to such algorithms.
Logical operations in algorithms and programs - Identify, use and explain logical operators in algorithms and programs, including NAND and NOR.
Traversal of data structures - Write and interpret algorithms used in the traversal of data structures.
Compression - Explain data compression and how data compression algorithms are used
Compression - Compare and explain the efficiency of data compression algorithms in terms of compression ratio, compression time, decompression time and saving percentage.
Testing - Select appropriate test data.
Testing - Dry-run a program or algorithm in order to identify possible errors, including logical errors.
Testing - Explain the purpose of a given algorithm by showing the effects of test data.
Comparing algorithms - Use Big O notation to determine the complexity and efficiency of given algorithms in terms of their execution time, their memory requirements and between algorithms that perform the same task.