Computer Science AQA A2
flashcards
Decks in class (37)
# Cards
-
Section 7 Chapter 37 - Queues18
-
Section 7 Chapter 38 - Lists3
-
Section 7 Chapter 39 - Stacks11
-
Section 7 Chapter 40 - Hash Tables and Dictionaries9
-
Section 7 Chapter 41 - Graphs12
-
Section 7 Chapter 42 - Trees15
-
Section 7 Chapter 43 - Vectors10
-
Section 8 Chapter 44 - Recursive Algorithms9
-
Section 8 Chapter 45 - Big-O Notation8
-
Section 8 Chapter 46 and 4715
-
Section 8 Chapter 48 - Optimisation Algorithms3
-
Section 8 Chapter 49 - Limitations of Computation9
-
Section 9 Chapter 50 - Mealy Machines2
-
Section 9 Chapter 51 - Sets29
-
Section 9 Chapter 52 - Regular Expressions9
-
Section 9 Chapter 53 - The Turing Machine7
-
Section 9 Chapter 54 - Backaus Naur Form7
-
Section 9 Chapter 55 - Reverse Polish Notation3
-
Section 10 Chapter 56 - Structure of the Internet8
-
Section 10 Chapter 57 - Packet switching and routers9
-
Section 10 Chapter 58 - Internet Security18
-
Section 10 Chapter 59 - TCP/IP, standard application later protocols24
-
Section 10 Chapter 60 - IP addresses12
-
Section 10 Chapter 61 - Client Server Model6
-
Section 11 Chapter 62 - Entity Relationship Modelling4
-
Section 11 Chapter 63 - Relational Databases and Normalisation3
-
Section 11 Chapter 64 - Introduction to SQL0
-
Section 11 Chapter 65 - Defining and Updating Tables Using SQL5
-
Section 11 Chapter 66 - Systematic Approach to Problem Solving0
-
Section 12 Chapter 67 - Basic Concepts of OOP7
-
Section 12 Chapter 68 - Object Oriented Design Principles14
-
Section 12 Chapter 69 - Functional Programming22
-
Section 12 Chapter 70 - Function Application7
-
Section 12 Chapter 71 - Lists in Functional Programming5
-
Section 12 Chapter 72 - Big Data13
-
Appendix A - Floating Point Form0
-
Appendix B - Adders and D-type Flip Flops0
