AQA • Computer Science

If you see my notes and are confused about the unit numbers, i am too. This website has incorrect unit numbers that are not based on the exam board. Just look at the name of the notes to see if that is what you are looking for. This is a content heavy chapter. I would advise you to learn how to draw the different architectures that you learn, as well as understanding in detail the fetch decode execute cycle. If you can memorise all notes and understand them you can get a guaranteed A.

Guaranteed A if you memorise all notes and understand how to do Boolean logic questions. I advise you to practice boolean logic questions the most as there is a guaranteed 4 marker on them in the AS paper at the end of year 12. All the rules have been stated in my notes. I would advise you to look at mark schemes as you do not get the marks for getting the correct answer. You stop getting marks after you make a mistake.

Exam board- AQA. Guaranteed A for the chapter if you memorise all notes. Easy to understand.

It just gives you introduction to machine learning

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.