These are some of my notes for the AQA A-Level Computer Science course on algorithms, time and space complexity, the classification of algorithms, computational limits, and a few other small areas. The document includes a range of formatted equations, worked examples of Dijkstra's algorithm with a sample implementation, and more. Key points are highlighted, and the sections are split up. Please note that there may be a few formatting errors within the document. They don't affect the info...

All of the algorithms students need for their A-Level exam- both the pseudocode and Python code. Sorting and searching algorithms are covered in detail and fully commented.

This document covers what Big O notation is and why it is used, as well as the algorithms associated with it.

This document covers the laws of boolean algebra that allow you to calculate the result of a boolean expression.

This document covers what you need to know about logic gates, what they look like and their algebraic counterpart.

This document covers number conversions between denary, binary and hexadecimal and how to do it.