Difference between revisions of "Section A AL"
(→Fundamentals of data structures) |
(→Fundamentals of algorithms) |
||
Line 33: | Line 33: | ||
==Fundamentals of algorithms== | ==Fundamentals of algorithms== | ||
− | [[Merge Sort]] - {{ | + | [[Merge Sort]] - {{done}} |
[[Shortest Path]] - {{done}} | [[Shortest Path]] - {{done}} |
Revision as of 19:48, 6 June 2018
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. The year 1 topics are here:
Fundamentals of programming
Object Orientated Programming -
Fundamentals of data structures
Linked Lists - Lists - Needs Quiz
Stacks -
Queues -
Graphs -
Trees -
Hashing - Needs Quiz
Vectors -
Fundamentals of algorithms
Traversals
Depth First - Needs Quiz
Breadth First - Needs Quiz