This class was created by Brainscape user Michael Matthews. Visit their profile to learn more about the creator.
By:
Michael Matthews
- decks
- flashcards
- learners
Decks in this class (37)
Section 7 Chapter 37 - Queues
Elementary data type,
Composite data types,
Abstract data type
18
cards
Section 7 Chapter 38 - Lists
List,
Array,
How python lists work when inserting
3
cards
Section 7 Chapter 39 - Stacks
Stack,
Applications of stacks 2,
How to implement a stack
11
cards
Section 7 Chapter 40 - Hash Tables and Dictionaries
Hash table,
Hashing algorithm,
Folding method
9
cards
Section 7 Chapter 41 - Graphs
Graph,
Weighted graph,
Node
12
cards
Section 7 Chapter 42 - Trees
Tree,
Rooted tree,
Node
15
cards
Section 7 Chapter 43 - Vectors
Vector,
How vectors can be represented as...,
How vectors can be represented in...
10
cards
Section 8 Chapter 44 - Recursive Algorithms
Recursion,
Characteristics of a recursive al...,
How to store a binary tree if you...
9
cards
Section 8 Chapter 45 - Big-O Notation
What is a function in terms of ma...,
Time complexity,
Permutations
8
cards
Section 8 Chapter 46 and 47
Linear search,
Linear search complexity,
Why you would use a linear search
15
cards
Section 8 Chapter 48 - Optimisation Algorithms
Examples of optimisation problems 4,
Application of shortest path algo...,
Djikstras algorithm
3
cards
Section 8 Chapter 49 - Limitations of Computation
Tractable problem,
Intractable problem,
How to solve an intractable probl...
9
cards
Section 9 Chapter 50 - Mealy Machines
Finite state automaton,
Mealy machine
2
cards
Section 9 Chapter 51 - Sets
Set,
Methods to define a set 3,
Symbol for empty set
29
cards
Section 9 Chapter 52 - Regular Expressions
*
9
cards
Section 9 Chapter 53 - The Turing Machine
Structure of a turing machine,
What is a turing machine in terms...,
Features of a turing machine 4
7
cards
Section 9 Chapter 54 - Backaus Naur Form
Syntax for defining a syntactic v...,
Syntax for defining a syntactic v...,
Syntax diagram
7
cards
Section 9 Chapter 55 - Reverse Polish Notation
Advantages of rpn 2,
Use of rpn,
How to convert infix to postfix w...
3
cards
Section 10 Chapter 56 - Structure of the Internet
Structure of the internet,
Uniform resource locator and its ...,
What internet registries do
8
cards
Section 10 Chapter 57 - Packet switching and routers
Packet switching,
Structure of a packet,
Contents of the header 5
9
cards
Section 10 Chapter 58 - Internet Security
Firewall,
The uses firewalls 3,
Packet filtering
18
cards
Section 10 Chapter 59 - TCP/IP, standard application later protocols
Layers of tcp ip 4,
Application layer,
Transport layer
24
cards
Section 10 Chapter 60 - IP addresses
Ip address,
Components of an ip address,
Classful addressing
12
cards
Section 10 Chapter 61 - Client Server Model
Client server model,
Websocket protocol,
Crud mappings
6
cards
Section 11 Chapter 62 - Entity Relationship Modelling
Attribute,
Primary key,
Composite primary key
4
cards
Section 11 Chapter 63 - Relational Databases and Normalisation
Relational database,
Third order normalisation,
Properties of a normalised databa...
3
cards
Section 11 Chapter 64 - Introduction to SQL
0
cards
Section 11 Chapter 65 - Defining and Updating Tables Using SQL
Client server database,
How concurrent access can be cont...,
Record locks
5
cards
Section 11 Chapter 66 - Systematic Approach to Problem Solving
0
cards
Section 12 Chapter 67 - Basic Concepts of OOP
Class,
Instantiation,
Object
7
cards
Section 12 Chapter 68 - Object Oriented Design Principles
Aggregation,
Composition,
Uml symbol for aggregation
14
cards
Section 12 Chapter 69 - Functional Programming
Programming paradigm,
Procedural,
Declarative
22
cards
Section 12 Chapter 70 - Function Application
Higher order function,
How many parameters can a functio...,
How are functions that seem to ha...
7
cards
Section 12 Chapter 71 - Lists in Functional Programming
List,
Makeup of a list,
Head of a list
5
cards
Section 12 Chapter 72 - Big Data
Big data,
Volume of big data,
Velocity of big data
13
cards
Appendix A - Floating Point Form
0
cards
Appendix B - Adders and D-type Flip Flops
0
cards
More about
Computer Science AQA A2
- Class purpose General learning
Learn faster with Brainscape on your web, iPhone, or Android device. Study Michael Matthews's Computer Science AQA A2 flashcards for their CNS class now!
How studying works.
Brainscape's adaptive web mobile flashcards system will drill you on your weaknesses, using a pattern guaranteed to help you learn more in less time.
Add your own flashcards.
Either request "Edit" access from the author, or make a copy of the class to edit as your own. And you can always create a totally new class of your own too!
What's Brainscape anyway?
Brainscape is a digital flashcards platform where you can find, create, share, and study any subject on the planet.
We use an adaptive study algorithm that is proven to help you learn faster and remember longer....
Looking for something else?
Biology 101
- 16 decks
- 1,045 flashcards
- 114 learners
Decks:
Biochemical Basics, Cell Biology, Microbiology, And more!
AQA A2 Computing
- 26 decks
- 223 flashcards
- 17 learners
Decks:
Aqa A2 Computing 16 Regular Expressions, Aqa A2 Computing 25 Graphs And Trees, Aqa A2 Computing 11 Information Hiding A, And more!
Computer Science AQA AS
- 37 decks
- 493 flashcards
- 503 learners
Decks:
Section 1 Chapter 1 Programming Basics, Section 1 Chapter 2 Selection, Section 1 Chapter 3 Iteration, And more!
Computer science A2
- 19 decks
- 292 flashcards
- 1 learners
Decks:
Recap, Data Structures, Logical Operations, And more!
