Eduqas A-Level Computer Science data structures and algorithms overview quiz quiz

$305$

$315$

$320$

$324$

A stack

A queue

A linked list

A binary search tree

$6$

$0$

$1$

$5$

Faster random access to any one element directly by its index position

It uses noticeably less memory for each element that it stores

It always guarantees that its elements are kept in sorted order

It can grow and shrink at run time with cheap insertion and deletion

ascending (sorted) order

the order they were inserted

descending order

random order

An adjacency matrix

An adjacency list

A two-dimensional array of all possible edges

A stack of edges

the entire hash table has become completely empty

an existing key is deleted from one of the slots

two different keys hash to the same index

the hash function returns the value zero for a key

$O(n)$ on any unsorted list at all

$O(n^2)$ on a sorted list, working in quadratic time

$O(1)$ on any list, regardless of order

$O(\log n)$ on a sorted list

A queue

A stack

A binary tree

A hash table

The smallest element, at the front

The largest element, at the end

The median element

No element is guaranteed in place

Bubble sort and insertion sort

Insertion sort and merge sort

Merge sort and quick sort

Bubble sort and quick sort

To make the source code of the function shorter and easier to read

To increase the overall time complexity of the algorithm that is being used

To avoid having to use the call stack for storing return addresses

To stop the recursion so it terminates instead of overflowing the stack

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

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

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

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