1
AQA A Level Computer Science 7517 :
3 - Fundamentals of Algorithms 2026
Latest Questions and Answers (100%
Expert Answers) A+
Binary Search Tree [ Ans: ] A O(log(n)) algorithm to search a binary tree
for a particular item by traversing the tree in the right direction until the
item is found.
Binary Search [ Ans: ] A O(log(n)) algorithm to search a sorted list for a
particular item by repeatedly halving the sublist which could contain the
item.
Breadth-First Traversal [ Ans: ] A method of traversing a graph by using a
queue to visit all the neighbours of the current node before doing the
same to each of the neighbours until the entire graph has been explored.
© 2026
Bubble Sort [ Ans: ] A O(n2) sorting algorithm that iterates through a list,
comparing each element to its successor and swapping elements if the
successor is greater than the current element. This is repeated until no
more swaps can be made.
Depth-First Traversal [ Ans: ] A method of traversing a graph by using a
stack to travel as far along one route as possible and then backtracking
and doing the same for the remaining routes until the entire graph has
been explored.
Dijkstra's Shortest Path Algorithm [ Ans: ] An algorithm to find the
shortest path between two nodes on a graph by using a priority queue to
keep track of the shortest distance (cost) to each node from the starting
node until the destination node is found.
In-Order Traversal [ Ans: ] A traversal in the order: traverse the left
subtree, visit/pop the node then traverse the right subtree.
AQA A Level Computer Science 7517 :
3 - Fundamentals of Algorithms 2026
Latest Questions and Answers (100%
Expert Answers) A+
Binary Search Tree [ Ans: ] A O(log(n)) algorithm to search a binary tree
for a particular item by traversing the tree in the right direction until the
item is found.
Binary Search [ Ans: ] A O(log(n)) algorithm to search a sorted list for a
particular item by repeatedly halving the sublist which could contain the
item.
Breadth-First Traversal [ Ans: ] A method of traversing a graph by using a
queue to visit all the neighbours of the current node before doing the
same to each of the neighbours until the entire graph has been explored.
© 2026
Bubble Sort [ Ans: ] A O(n2) sorting algorithm that iterates through a list,
comparing each element to its successor and swapping elements if the
successor is greater than the current element. This is repeated until no
more swaps can be made.
Depth-First Traversal [ Ans: ] A method of traversing a graph by using a
stack to travel as far along one route as possible and then backtracking
and doing the same for the remaining routes until the entire graph has
been explored.
Dijkstra's Shortest Path Algorithm [ Ans: ] An algorithm to find the
shortest path between two nodes on a graph by using a priority queue to
keep track of the shortest distance (cost) to each node from the starting
node until the destination node is found.
In-Order Traversal [ Ans: ] A traversal in the order: traverse the left
subtree, visit/pop the node then traverse the right subtree.
