AQA A-Level Computer Science 4.3 Fundamentals of algorithms overview quiz quiz

A queue

A stack

A binary tree

A hash table

The right subtree

The node itself

The left subtree

The leaf nodes only

The list must contain integers

The list must be small

The list must be sorted

The list must be a linked list

$O(n \log n)$

$O(n)$

$O(n^2)$

$O(\log n)$

$O(n^2)$

$O(n)$

$O(\log n)$

$O(n \log n)$

It always sorts the list in place using no extra memory at all beyond the original list

It uses divide and conquer, giving $O(n \log n)$ rather than $O(n^2)$

It is considerably simpler and more straightforward to implement than bubble sort is

It is able to sort the list without ever needing to compare any of the elements at all

The single longest possible path that can be traced between two vertices in a weighted graph

Every distinct cycle that exists anywhere within the structure of a given weighted graph

The shortest (lowest-cost) path from a start vertex to other vertices in a weighted graph

The total number of vertices and edges that together make up a given weighted graph

To store all of the already-visited vertices strictly in the order they were inserted

To sort all of the edges of the graph into alphabetical order before processing begins

To detect and report any cycles that happen to exist within the structure of the graph

To efficiently select the unvisited vertex with the smallest tentative distance

How the time or memory an algorithm needs grows as the input size grows

The exact run time of an algorithm measured precisely in seconds on a given machine

The total number of lines of source code that make up the algorithm's implementation

The particular programming language in which the algorithm has been written and compiled

$O(n^2)$, $O(n)$, $O(\log n)$

$O(\log n)$, $O(n)$, $O(n^2)$

$O(n)$, $O(\log n)$, $O(n^2)$

$O(n^2)$, $O(\log n)$, $O(n)$

$O(1)$

$O(n^2)$

$O(n)$

$O(\log n)$