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

admin who did not log in · guest

10 Sep 2026, 7:48 p.m.

28067 score

8 correct × 35 movement score = 280

67 × VCE evidence60.3 seconds · bandwidth-limited recordingDownload video
01 How many edges are in an undirected complete graph with 8 vertices?
A 56 Does not fit this requirement.
B 28 There is one edge for each unordered pair: 8×7/2 = 28.
C 64 Does not fit this requirement.
D 7 Does not fit this requirement.

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

02 The Church–Turing thesis informally claims that
A every true statement is provable Does not fit this requirement.
B every effectively calculable function can be computed by a Turing machine The accepted statement is: every effectively calculable function can be computed by a Turing machine.
C P equals NP Does not fit this requirement.
D all programs halt Does not fit this requirement.

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

03 A* uses f(n) = g(n) + h(n). Which frontier node should it expand next?
A Node A: g = 1, h = 12, f = 13 f = 13; another node has a smaller f.
B Node B: g = 3, h = 9, f = 12 f = 12; another node has a smaller f.
C Node C: g = 5, h = 5, f = 10 f = 10; another node has a smaller f.
D Node D: g = 7, h = 2, f = 9 f = 9; this is minimal.

Written for icaijy.com · U4 AOS2 · A* search · answered at 15204 ms

04 A research program must undo edits in reverse order. Which ADT is most suitable?
A priority queue Does not fit this requirement.
B stack A stack provides last-in, first-out access.
C set Does not fit this requirement.
D queue Does not fit this requirement.

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

05 Past biased policing data directs more patrols to the same areas, generating more similar data. What is the most relevant issue?
A a harmful feedback loop The scenario directly illustrates a harmful feedback loop.
B a balanced dataset Does not fit this requirement.
C binary search Does not fit this requirement.
D formal verification Does not fit this requirement.

Written for icaijy.com · U4 AOS3 · AI ethics · answered at 33804 ms

06 A subgraph may contain
A edges absent from the original graph Does not fit this requirement.
B new vertices only Does not fit this requirement.
C every original edge only Does not fit this requirement.
D subsets of the original vertices and edges A subgraph uses only original vertices and edges.

Written for icaijy.com · U3 AOS1 · Graphs · answered at 43663 ms

07 Which design pattern is most clearly used by mergesort?
A brute-force search Does not fit this requirement.
B greedy Does not fit this requirement.
C divide and conquer Mergesort uses divide and conquer.
D dynamic programming Does not fit this requirement.

Written for icaijy.com · U3/U4 · Algorithm design patterns · answered at 48012 ms

08 As simulated annealing temperature decreases, accepting a worse move generally becomes
A less likely Cooling gradually reduces exploratory worse moves.
B more likely Does not fit this requirement.
C unrelated to temperature Does not fit this requirement.
D certain Does not fit this requirement.

Written for icaijy.com · U4 AOS2 · Advanced design · answered at 54414 ms

09 Which design pattern is most clearly used by a recursive maze solver that reverses choices at dead ends?
A backtracking A recursive maze solver that reverses choices at dead ends uses backtracking.
B brute-force search Does not fit this requirement.
C divide and conquer Does not fit this requirement.
D greedy Does not fit this requirement.

Written for icaijy.com · U3/U4 · Algorithm design patterns · answered at 57599 ms

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

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

Run it again