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

That y8 kid 🤣 - bot · guest

11 Sep 2026, 9:30 p.m.

20Serious score
01 A council must connect all suburbs while minimising total new cable. Which concept best matches this situation?
A Dijkstra’s algorithm Does not fit this requirement.
B Bellman–Ford algorithm Does not fit this requirement.
C Floyd–Warshall algorithm Does not fit this requirement.
D Prim's algorithm Prim's algorithm directly matches the stated requirement.

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

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

04 Which concept is illustrated? A text-only interrogator tries to distinguish a human from a machine.
A Church–Turing thesis Does not fit this requirement.
B Turing Test This is the standard description of Turing Test.
C Chinese Room Does not fit this requirement.
D Halting Problem Does not fit this requirement.

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

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

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

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

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

07 A bank provides understandable reasons for an automated rejection. Which tool is most fit for purpose?
A privacy Does not fit this requirement.
B transparency transparency directly matches the stated requirement.
C bias Does not fit this requirement.
D time complexity Does not fit this requirement.

Written for icaijy.com · Applied · AI ethics · answered at 100 ms

08 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

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

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

10 A max-priority queue removes the numerically highest priority first. Which job is removed?
A Job A (priority 6) A higher-priority job is present.
B Job B (priority 13) This has the highest priority.
C Job C (priority 9) A higher-priority job is present.
D Job D (priority 4) A higher-priority job is present.

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

11 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

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

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

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

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

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

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

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

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

16 Which signature best specifies the insert operation?
A set × set → item Does not fit this requirement.
B item → set × set Does not fit this requirement.
C set → item Does not fit this requirement.
D set × item → set Insert adds one item to the set.

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

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

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

18 How many edges are in an undirected complete graph with 7 vertices?
A 42 Does not fit this requirement.
B 21 There is one edge for each unordered pair: 7×6/2 = 21.
C 6 Does not fit this requirement.
D 49 Does not fit this requirement.

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

19 For sufficiently large n, which grows more slowly than \(O(n)\)?
A \(O(n!)\) Does not fit this requirement.
B \(O(n)\) Does not fit this requirement.
C \(O(2^n)\) Does not fit this requirement.
D \(O(\log n)\) \(O(\log n)\) has the lower asymptotic growth rate.

Written for icaijy.com · U4 AOS1 · Growth rates · answered at 100 ms

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

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

Run it again