Difference between revisions of "Section A AL"
| (8 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. | ||
| Line 38: | Line 41: | ||
==Fundamentals of data structures== | ==Fundamentals of data structures== | ||
| + | ===Year 1=== | ||
[[Data Structures]] - {{done}} | [[Data Structures]] - {{done}} | ||
| Line 44: | Line 48: | ||
[[Records]] - {{done}} | [[Records]] - {{done}} | ||
| − | == | + | ===Year 2=== |
| − | [[ | + | [[Dynamic vs Static]] - {{done}} |
| − | [[ | + | [[Abstract Data Structures]] - {{done}} |
| − | + | [[Linked Lists - Lists]] - {{done}} | |
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | [[Linked Lists - Lists]] - {{ | ||
[[Stacks]] - {{done}} | [[Stacks]] - {{done}} | ||
| Line 92: | Line 70: | ||
==Fundamentals of algorithms== | ==Fundamentals of algorithms== | ||
| + | ===Year 1=== | ||
| + | [[Structured Programming]] - {{done}} | ||
| + | |||
| + | [[Algorithms]] - {{done}} | ||
| + | |||
| + | [[Linear Search]] - {{done}} | ||
| + | |||
| + | [[Binary Search]] - {{done}} | ||
| + | |||
| + | [[Bubble Sort]] - {{done}} | ||
| + | ===Year 2=== | ||
[[Merge Sort]] - {{done}} | [[Merge Sort]] - {{done}} | ||
[[Shortest Path]] - {{done}} | [[Shortest Path]] - {{done}} | ||
| − | |||
| − | |||
[[Graph Traversals]] - {{done}} | [[Graph Traversals]] - {{done}} | ||
| Line 107: | 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 112: | 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
Constants - Variables - Data Types - 
Parameters - Global Variables -
Year 2
Object Orientated Programming -
Fundamentals of data structures
Year 1
Arrays -
Records -
Year 2
Stacks -
Queues -
Graphs -
Trees -
Hashing -
Vectors -
Fundamentals of algorithms
Year 1
Year 2
Theory of computation
Year 1
Year 2
Maths for Regular Expressions -
