Difference between revisions of "Section A AL"
(→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. | + | 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]] - {{ | + | [[Abstract Data Structures]] - {{done}} |
| + | |||
| + | [[Linked Lists - Lists]] - {{done}} | ||
[[Stacks]] - {{done}} | [[Stacks]] - {{done}} | ||
| Line 21: | Line 59: | ||
[[Queues]] - {{done}} | [[Queues]] - {{done}} | ||
| − | [[Graphs]] - {{ | + | [[Graphs]] - {{done}} |
| − | [[Trees]] - {{ | + | [[Trees]] - {{done}} |
[[Dictionaries]] - {{done}} | [[Dictionaries]] - {{done}} | ||
| − | [[Hashing]] - {{ | + | [[Hashing]] - {{done}} |
[[Vectors]] - {{done}} | [[Vectors]] - {{done}} | ||
==Fundamentals of algorithms== | ==Fundamentals of algorithms== | ||
| + | ===Year 1=== | ||
| + | [[Structured Programming]] - {{done}} | ||
| − | [[Merge Sort]] - {{ | + | [[Algorithms]] - {{done}} |
| + | |||
| + | [[Linear Search]] - {{done}} | ||
| + | |||
| + | [[Binary Search]] - {{done}} | ||
| + | |||
| + | [[Bubble Sort]] - {{done}} | ||
| + | |||
| + | ===Year 2=== | ||
| + | [[Merge Sort]] - {{done}} | ||
[[Shortest Path]] - {{done}} | [[Shortest Path]] - {{done}} | ||
| − | + | [[Graph Traversals]] - {{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
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 -
