Difference between revisions of "2022 Paper 1 Revision Quiz"
(→Graph Traversal) |
(→Graph Traversal) |
||
Line 453: | Line 453: | ||
-Dictionary | -Dictionary | ||
||Incorrect | ||Incorrect | ||
+ | |||
+ | {Complete the following: | ||
+ | |type="{}"} | ||
+ | For Depth First & Breadth First traversals it is important to know when a node has been { discovered }. | ||
+ | When you evaluate a node the { neighbours } of the current node will be add to the Stack or Queue. | ||
+ | It is important to also record when you have { fully|completely } explored the current node. | ||
</quiz> | </quiz> | ||
Revision as of 15:46, 3 June 2022
Contents
Recursion
Arrays
Abstract Data Types & Dynamic vs Static
Queues
Stacks
Graphs
Trees
Graph Traversal
Searching Algorithms
Sorting Algorithms
Optimisation Algorithms
Order of Complexity