4.3: Fundamentals of Algorithms: revision quiz and key terms

Free practice for 4.3: Fundamentals of Algorithms in AQA A Level Computer Science (7517). It has 9 parts, listed below. Try the questions, then check the key terms.

Key terms for 4.3: Fundamentals of Algorithms

Breadth-first search

A graph traversal that visits all neighbours of a vertex before moving further away, using a queue.

Depth-first search

A graph traversal that follows one branch as far as possible before backtracking, using a stack.

Dijkstra's algorithm

Finds the shortest path from one vertex to every other vertex in a weighted graph.

In-order traversal

Visits the left subtree, then the node, then the right subtree.

Linear search

An algorithm that checks each item in a list in order until the target is found or the list ends.

Merge sort

Repeatedly splits a list into halves, then merges the sorted halves back together.

Post-order traversal

Visits the left subtree, then the right subtree, then the node.

Pre-order traversal

Visits a node, then its left subtree, then its right subtree.

What 4.3: Fundamentals of Algorithms covers

In RADevo this topic has a full topic test and a focused quiz for each part:

• 4.3.1.1 Simple Graph-Traversal Algorithms
• 4.3.2.1 Simple Tree-Traversal Algorithms
• 4.3.3.1 Reverse Polish – Infix Transformations
• 4.3.4.1 Linear Search
• 4.3.4.2 Binary Search
• 4.3.4.3 Binary Tree Search
• 4.3.5.1 Bubble Sort
• 4.3.5.2 Merge Sort
• 4.3.6.1 Dijkstra's Shortest Path Algorithm