Back to speedrun
RUN REVIEW · Algorithmics (HESS) · Units 3 & 4

henry · guest

11 Sep 2026, 10:30 a.m.

211267 score

11 correct × 192 movement score = 2112

67 × VCE evidence60.4 seconds · bandwidth-limited recordingDownload video
01 A council must connect all suburbs while minimising total new cable. Select the best model or method.
A Bellman–Ford algorithm Does not fit this requirement.
B Prim's algorithm Prim's algorithm directly matches the stated requirement.
C Dijkstra’s algorithm Does not fit this requirement.
D PageRank Does not fit this requirement.

Written for icaijy.com · Applied · graph algorithms · answered at 5329 ms

02 A transport app must test quickly whether a username has already been used. Which ADT is most suitable?
A stack Does not fit this requirement.
B priority queue Does not fit this requirement.
C queue Does not fit this requirement.
D set A set models unique membership.

Written for icaijy.com · U3 AOS1 · ADTs · answered at 10487 ms

03 Many membership queries on a large sorted array. Which approach is most suitable?
A linear search Does not fit this requirement.
B depth-first search Does not fit this requirement.
C hill climbing Does not fit this requirement.
D binary search binary search best matches the input and goal.

Written for icaijy.com · U4 AOS2 · Selecting algorithms · answered at 19766 ms

04 Assume constant-time primitive operations. What is the tightest Big-O bound for: For i from 1 to n: constantWork()
A \(O(1)\) Does not fit this requirement.
B \(O(n)\) The body runs n times.
C \(O(\log n)\) Does not fit this requirement.
D \(O(n^2)\) Does not fit this requirement.

Written for icaijy.com · U4 AOS1 · Time complexity · answered at 24322 ms

05 A research program must serve customers in the order in which they arrived. Which ADT is most suitable?
A stack Does not fit this requirement.
B queue A queue provides first-in, first-out access.
C set Does not fit this requirement.
D dictionary Does not fit this requirement.

Written for icaijy.com · U3 AOS1 · ADTs · answered at 29911 ms

06 Explore a game tree and undo choices when a dead end is reached. Which approach is most suitable?
A binary search Does not fit this requirement.
B PageRank Does not fit this requirement.
C backtracking backtracking best matches the input and goal.
D mergesort Does not fit this requirement.

Written for icaijy.com · U4 AOS2 · Selecting algorithms · answered at 34138 ms

07 Binary search uses \(\lfloor(low+high)/2\rfloor\) on the sorted integers 1…255. How many values are inspected when searching for 63?
A 8 The midpoint trace reaches 63 after 8 inspection(s).
B 1 Does not fit this requirement.
C 4 Does not fit this requirement.
D 2 Does not fit this requirement.

Written for icaijy.com · U4 AOS2 · Binary search · answered at 40299 ms

08 Binary search uses \(\lfloor(low+high)/2\rfloor\) on the sorted integers 1…15. How many values are inspected when searching for 11?
A 4 The midpoint trace reaches 11 after 4 inspection(s).
B 7 Does not fit this requirement.
C 1 Does not fit this requirement.
D 2 Does not fit this requirement.

Written for icaijy.com · U4 AOS2 · Binary search · answered at 47080 ms

09 Many membership queries on a large sorted array. Choose the best algorithmic description.
A hill climbing Does not fit this requirement.
B depth-first search Does not fit this requirement.
C binary search binary search best matches the input and goal.
D linear search Does not fit this requirement.

Written for icaijy.com · U4 AOS2 · Selecting algorithms · answered at 51646 ms

10 In the standard model, a Turing machine reads and writes symbols on
A a neural network Does not fit this requirement.
B a finite queue only Does not fit this requirement.
C a weighted graph Does not fit this requirement.
D an unbounded tape divided into cells The accepted statement is: an unbounded tape divided into cells.

Written for icaijy.com · U4 AOS3 · Computability · answered at 55236 ms

11 How many edges are in an undirected complete graph with 11 vertices?
A 110 Does not fit this requirement.
B 55 There is one edge for each unordered pair: 11×10/2 = 55.
C 10 Does not fit this requirement.
D 121 Does not fit this requirement.

Written for icaijy.com · U3 AOS1 · Graph modelling · answered at 59176 ms

12 Ignoring constant factors, approximately how many primitive operations does an \(O(n^2)\) algorithm perform when n = 1,000,000?
A about 20 million Does not fit this requirement.
B about 1 trillion Substitute n into the stated growth function.
C about 1 quadrillion Does not fit this requirement.
D about 30 Does not fit this requirement.

Written for icaijy.com · U4 AOS1 · Practical complexity · answered at 60000 ms

Run it again