Difference between revisions of "Section A AL"
(→Fundamentals of data structures) |
(→Theory of computation) |
||
Line 102: | Line 102: | ||
[[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}} |
Revision as of 14:37, 26 January 2019
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
Algorithms - Needs Quiz
Year 2
Theory of computation
Year 1
Year 2
Maths for Regular Expressions =