AQA • Computer Science

AQA A-Level Computer Science notes on the topic of Data Structures (which appears on paper one!) Notes are detailed and well laid out and all specific terms and areas are well explained to enhance understanding. There's even a contents page! Good luck with your exams! Hope this helps!!! Written by a grammar school student who received a predicted A.

A cheat sheet detailing the key points required for AQA A Level Computer Science Paper 1

This pack of revision notes contains highly-detailed explanations, examples, diagrams and algorithms for Networking and Computer Communication for the Computer Science A-Level. Check the tags for all of the information included! The notes aren't in any particular order, but everything is included under a heading/subheading, so it's easy to find what you need. I hope these are helpful!

Notes for the AQA A-Level in Computer Science on computational thinking. These notes include information about Turing machines, finite state and mealy machines, sets and set operations, regular languages and more. The document also includes small code snippets to support the theory. Important sections and keywords are highlighted, too.

A set of notes describing how compression works and why it is used. It covers both lossy and lossless compression, has a few examples, and contains valuable tips.

This document contains notes on binary floating point numbers, including basic arithmetic, conversion to and from base-10, error calculations, signed floating point numbers, and more.

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...

This is a description of an automated theory course and its practical applications, including regular expressions, finite automata, and context-free grammars. An example of a finite automaton representing a game of tennis is provided. It also covers the concepts of languages, transition functions, and a simple protocol for sending data.

Summarised revision notes of the specification topics, helping students achieve top grades in exams.

Notes for the computer systems and architecture module of AQA A Level Computer Science. Information is summarised into bullet points and can be easily turned into flashcards. Condense notes with diagrams

The complete summary of the AQA AS level Computer Science specification Written by a Cambridge offer-holder and A*A*A* predicted student. Hand-drawn diagrams and detailing included. Programming, theory and ethics all within this document.

Level 3 Technical Level IT: CYBER SECURITY IT: NETWORKING IT: PROGRAMMING IT: USER SUPPORT Y/507/6424 Unit 1 Fundamental principles of computing Mark scheme June 2019 Version 1.0: Final *196AY/MS* Mark schemes are prepared by the Lead Assessment Writer and considered, together with the relevant questions, by a panel of subject teachers. This mark scheme includes any amendments made at the standardisation events which all asso...

Covers the following topics of the 'Fundamentals of Programming' in an accessible way: - Subroutines and their local/global variables -Exception handling -Object orientated concepts Created by a final year A-Level student with the aid of mark schemes so all information is accurate. Easy to understand and adapt to own needs if necessary

Clear, concise notes (4 pages) detailing the first half of necessary information students must learn for the topic 'Fundamentals of Programming'. Made by a final year A-Level student along with the aid of mark schemes so all the information is correct and relevant. Easy to read and adapt to your own needs.

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.

This document covers wat you need to know about the internal and external hardware involved in computer processes, including buses and cpu hardware (and what they do)