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

That y8 kid 🤣 - bot · guest

11 Sep 2026, 9:31 p.m.

20Serious score
01 A* uses f(n) = g(n) + h(n). Which frontier node should it expand next?
A Node A: g = 4, h = 11, f = 15 f = 15; another node has a smaller f.
B Node B: g = 6, h = 7, f = 13 f = 13; another node has a smaller f.
C Node C: g = 8, h = 4, f = 12 f = 12; another node has a smaller f.
D Node D: g = 10, h = 1, f = 11 f = 11; this is minimal.

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

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

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

03 Which concept is illustrated? A machine genuinely possesses a mind or understanding.
A graph search Does not fit this requirement.
B supervised learning Does not fit this requirement.
C strong AI This is the standard description of strong AI.
D weak AI Does not fit this requirement.

Written for icaijy.com · U4 AOS3 · Conceptions of AI · answered at 100 ms

04 A transport app must access the 18th temperature reading directly. Which ADT is most suitable?
A queue Does not fit this requirement.
B array An array supports access by numeric index.
C stack Does not fit this requirement.
D set Does not fit this requirement.

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

05 Using the usual inclusive low/high implementation, at most how many element inspections can an unsuccessful binary search of 8 sorted items require?
A 3 Does not fit this requirement.
B 4 An unsuccessful search may inspect floor(log₂(8)) + 1 = 4 elements.
C 8 Does not fit this requirement.
D 5 Does not fit this requirement.

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

06 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 100 ms

07 A campus planner needs shortest walking distances between every pair of buildings. Which concept best matches this situation?
A Bellman–Ford algorithm Does not fit this requirement.
B PageRank Does not fit this requirement.
C Prim's algorithm Does not fit this requirement.
D Floyd–Warshall algorithm Floyd–Warshall algorithm directly matches the stated requirement.

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

08 How many edges are in an undirected complete graph with 9 vertices?
A 81 Does not fit this requirement.
B 36 There is one edge for each unordered pair: 9×8/2 = 36.
C 72 Does not fit this requirement.
D 8 Does not fit this requirement.

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

09 Assume constant-time primitive operations. What is the tightest Big-O bound for: For i from 1 to n: work(); For j from 1 to n: work()
A \(O(\(2n\)^2)\) Does not fit this requirement.
B \(O(n^2)\) Does not fit this requirement.
C \(O(n)\) Sequential linear loops add, not multiply.
D \(O(1)\) Does not fit this requirement.

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

10 Which term is a single valid input that disproves a universal correctness claim?
A base case Does not fit this requirement.
B benchmark Does not fit this requirement.
C postcondition Does not fit this requirement.
D counterexample This describes a counterexample.

Written for icaijy.com · U3 AOS2 · Correctness and modularity · answered at 100 ms

11 A transport app must always process the waiting job with the highest urgency. Which ADT is most suitable?
A stack Does not fit this requirement.
B priority queue A priority queue removes the highest-priority item.
C queue Does not fit this requirement.
D set Does not fit this requirement.

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

12 Which design pattern or algorithm splits a problem into independent smaller instances and combines their answers?
A greedy Does not fit this requirement.
B hill climbing Does not fit this requirement.
C divide and conquer This is the defining behaviour of divide and conquer.
D brute-force search Does not fit this requirement.

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

13 A max-priority queue removes the numerically highest priority first. Which job is removed?
A Job A (priority 17) This has the highest priority.
B Job B (priority 11) A higher-priority job is present.
C Job C (priority 15) A higher-priority job is present.
D Job D (priority 2) A higher-priority job is present.

Written for icaijy.com · U3 AOS1 · Priority queues · answered at 100 ms

14 Which term best matches a system that adjusts a model using data before it is used for predictions?
A training This describes training.
B decomposition Does not fit this requirement.
C halting Does not fit this requirement.
D inference Does not fit this requirement.

Written for icaijy.com · U4 AOS3 · Data-driven algorithms · answered at 100 ms

15 Which term must be true before an algorithm is executed?
A loop invariant Does not fit this requirement.
B postcondition Does not fit this requirement.
C precondition This describes a precondition.
D heuristic Does not fit this requirement.

Written for icaijy.com · U3 AOS2 · Correctness and modularity · answered at 100 ms

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

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

17 Using the usual inclusive low/high implementation, at most how many element inspections can an unsuccessful binary search of 512 sorted items require?
A 11 Does not fit this requirement.
B 10 An unsuccessful search may inspect floor(log₂(512)) + 1 = 10 elements.
C 512 Does not fit this requirement.
D 9 Does not fit this requirement.

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

18 Which term best matches a system that separates classes using a maximum-margin boundary?
A simulated annealing Does not fit this requirement.
B queue Does not fit this requirement.
C support vector machine This describes support vector machine.
D decision tree Does not fit this requirement.

Written for icaijy.com · U4 AOS3 · Data-driven algorithms · answered at 100 ms

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

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

20 A campus planner needs shortest walking distances between every pair of buildings. Which tool is most fit for purpose?
A Floyd–Warshall algorithm Floyd–Warshall algorithm directly matches the stated requirement.
B Prim's algorithm Does not fit this requirement.
C Dijkstra’s algorithm Does not fit this requirement.
D Bellman–Ford algorithm Does not fit this requirement.

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

Run it again