Difference between revisions of "Section A AL"

From TRCCompSci - AQA Computer Science
Jump to: navigation, search
(Fundamentals of algorithms)
 
(25 intermediate revisions by the same user not shown)
Line 1: Line 1:
 
__NOTOC__
 
__NOTOC__
 +
=Advanced Information=
 +
[[Advanced Information Revision Notes]]
 +
 
=Introduction=
 
=Introduction=
 
You are advised to spend no more than 45 minutes on this section. Questions will examine the specification content not specific to the Preliminary Material.  
 
You are advised to spend no more than 45 minutes on this section. Questions will examine the specification content not specific to the Preliminary Material.  
  
This section covers short answer theory questions on the topics within unit 1 from both year 1 and 2. '''[[Section A AS|The year 1 topics are here]]''':
+
This section covers short answer theory questions on the topics within unit 1 from both year 1 and 2.:
  
 
==Fundamentals of programming==
 
==Fundamentals of programming==
 +
===Year 1===
 +
 +
[[Pseudo Code]] - {{done}}
 +
 +
[[Constants - Variables - Data Types]] - {{done}}
 +
 +
[[Selection]] - {{done}}
 +
 +
[[Repetition - Iteration]] - {{done}}
 +
 +
[[Operators]] - {{done}}
 +
 +
[[Subroutines - Functions]] - {{done}}
 +
 +
[[Parameters - Global Variables]] - {{done}}
 +
 +
[[Text Files]] - {{done}}
 +
 +
[[Binary Files]] - {{done}}
 +
 +
[[Handling Exceptions]] - {{done}}
 +
 +
===Year 2===
 +
 +
[[Programming Paradigms]] - {{done}}
  
 
[[Object Orientated Programming]] - {{done}}
 
[[Object Orientated Programming]] - {{done}}
Line 13: Line 41:
 
==Fundamentals of data structures==
 
==Fundamentals of data structures==
  
 +
===Year 1===
 +
[[Data Structures]] - {{done}}
 +
 +
[[Arrays]] - {{done}}
 +
 +
[[Records]] - {{done}}
 +
 +
===Year 2===
 
[[Dynamic vs Static]] - {{done}}
 
[[Dynamic vs Static]] - {{done}}
  
[[Linked Lists - Lists]] - {{partially done}}
+
[[Abstract Data Structures]] - {{done}}
 +
 
 +
[[Linked Lists - Lists]] - {{done}}
  
 
[[Stacks]] - {{done}}
 
[[Stacks]] - {{done}}
Line 21: Line 59:
 
[[Queues]] - {{done}}
 
[[Queues]] - {{done}}
  
[[Graphs]] - {{partially done}}
+
[[Graphs]] - {{done}}
  
[[Trees]] - {{partially done}}
+
[[Trees]] - {{done}}
  
 
[[Dictionaries]] - {{done}}
 
[[Dictionaries]] - {{done}}
  
[[Hashing]] - {{partially done}}
+
[[Hashing]] - {{done}}
  
 
[[Vectors]] - {{done}}
 
[[Vectors]] - {{done}}
  
 
==Fundamentals of algorithms==
 
==Fundamentals of algorithms==
 +
===Year 1===
 +
[[Structured Programming]] - {{done}}
  
[[Merge Sort]] - {{partially done}}
+
[[Algorithms]] - {{done}}
 +
 
 +
[[Linear Search]] - {{done}}
 +
 
 +
[[Binary Search]] - {{done}}
 +
 
 +
[[Bubble Sort]] - {{done}}
 +
 
 +
===Year 2===
 +
[[Merge Sort]] - {{done}}
  
 
[[Shortest Path]] - {{done}}
 
[[Shortest Path]] - {{done}}
  
===Traversals===
+
[[Graph Traversals]] - {{done}}
[[Depth First]] - {{partially done}}
 
 
 
[[Breadth First]] - {{partially done}}
 
  
 
[[Tree Traversals]] - {{done}}
 
[[Tree Traversals]] - {{done}}
Line 48: Line 94:
 
==Theory of computation==
 
==Theory of computation==
  
 +
===Year 1===
 +
[[Computational Thinking]] - {{done}}
 +
 +
[[Abstraction - Automation]] - {{done}}
 +
 +
[[Finite State Machines]] - {{done}}
 +
 +
===Year 2===
 
[[Turing Machines]] - {{done}}
 
[[Turing Machines]] - {{done}}
  
Line 53: Line 107:
  
 
[[Regular Expressions]] - {{done}}
 
[[Regular Expressions]] - {{done}}
 +
 +
[[Maths for Regular Expressions]] - {{done}}
  
 
[[Comparing Algorithms - Big O]] - {{done}}
 
[[Comparing Algorithms - Big O]] - {{done}}
  
 
[[Intractable Problems]] - {{done}}
 
[[Intractable Problems]] - {{done}}

Latest revision as of 09:57, 8 June 2022

Advanced Information

Advanced Information Revision Notes

Introduction

You are advised to spend no more than 45 minutes on this section. Questions will examine the specification content not specific to the Preliminary Material.

This section covers short answer theory questions on the topics within unit 1 from both year 1 and 2.:

Fundamentals of programming

Year 1

Pseudo Code - Incomplete

Constants - Variables - Data Types - Incomplete

Selection - Incomplete

Repetition - Iteration - Incomplete

Operators - Incomplete

Subroutines - Functions - Incomplete

Parameters - Global Variables - Incomplete

Text Files - Incomplete

Binary Files - Incomplete

Handling Exceptions - Incomplete

Year 2

Programming Paradigms - Incomplete

Object Orientated Programming - Incomplete

Recursion - Incomplete

Fundamentals of data structures

Year 1

Data Structures - Incomplete

Arrays - Incomplete

Records - Incomplete

Year 2

Dynamic vs Static - Incomplete

Abstract Data Structures - Incomplete

Linked Lists - Lists - Incomplete

Stacks - Incomplete

Queues - Incomplete

Graphs - Incomplete

Trees - Incomplete

Dictionaries - Incomplete

Hashing - Incomplete

Vectors - Incomplete

Fundamentals of algorithms

Year 1

Structured Programming - Incomplete

Algorithms - Incomplete

Linear Search - Incomplete

Binary Search - Incomplete

Bubble Sort - Incomplete

Year 2

Merge Sort - Incomplete

Shortest Path - Incomplete

Graph Traversals - Incomplete

Tree Traversals - Incomplete

Reverse Polish - Incomplete

Theory of computation

Year 1

Computational Thinking - Incomplete

Abstraction - Automation - Incomplete

Finite State Machines - Incomplete

Year 2

Turing Machines - Incomplete

BNF - Syntax Diagrams - Incomplete

Regular Expressions - Incomplete

Maths for Regular Expressions - Incomplete

Comparing Algorithms - Big O - Incomplete

Intractable Problems - Incomplete