The following topics are included in A-level Paper 1 for AQA Computer Science.
Notes
Advanced Notes
- 3.1. Graph-Traversal
- 3.2. Tree-Traversal
- 3.3. Reverse Polish
- 3.4. Searching Algorithms
- 3.5. Sorting Algorithms
- 3.6. Optimisation Algorithm
Intermediate Notes
- 3.1. Graph-Traversal
- 3.2. Tree-Traversal
- 3.3. Reverse Polish
- 3.4. Searching Algorithms
- 3.5. Sorting Algorithms
- 3.6. Optimisation Algorithm
Concise Notes
- 3.1. Graph-Traversal
- 3.2. Tree-Traversal
- 3.3. Reverse Polish
- 3.4. Searching Algorithms
- 3.5. Sorting Algorithms
- 3.6. Optimisation Algorithms
Flashcards
- 3.1 Graph Traversal
- 3.2 Tree Traversal
- 3.3 Reverse Polish
- 3.4 Searching Algorithms
- 3.5 Sorting Algorithms
- 3.6 Optimisation Algorithm
Questions by Topic
- 3.1. Graph-Traversal MS
- 3.1. Graph-Traversal QP
- 3.2. Tree-Traversal MS
- 3.2. Tree-Traversal QP
- 3.3. Reverse Polish Notation MS
- 3.3. Reverse Polish Notation QP
- 3.4. Searching Algorithms MS
- 3.4. Searching Algorithms QP
- 3.5. Sorting Algorithms MS
- 3.5. Sorting Algorithms QP
- 3.6. Optimisation Algorithm MS
- 3.6. Optimisation Algorithm QP
Videos
- 3.1. Graph Traversal
- 3.2. Tree Traversal
- 3.3. Reverse Polish
- 3.4. Searching Algorithms
- 3.5. Sorting Algorithms
- 3.6. Optimisation Algorithm