Difference between revisions of "Section A AL"
(→Theory of computation) |
(→Fundamentals of data structures) |
||
Line 48: | Line 48: | ||
[[Dynamic vs Static]] - {{done}} | [[Dynamic vs Static]] - {{done}} | ||
− | [[Linked Lists - Lists]] - {{ | + | [[Linked Lists - Lists]] - {{done}} |
[[Stacks]] - {{done}} | [[Stacks]] - {{done}} |
Revision as of 13:37, 15 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