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 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

02 Why can testing many inputs usually not prove that an algorithm is correct for every valid input?
A Untested valid inputs may still fail. A finite test set need not cover the whole input domain.
B Only recursive algorithms can be tested. Does not fit this requirement.
C Big-O notation forbids testing. Does not fit this requirement.
D Testing always changes the algorithm. Does not fit this requirement.

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

03 How many edges are in an undirected complete graph with 15 vertices?
A 105 There is one edge for each unordered pair: 15×14/2 = 105.
B 210 Does not fit this requirement.
C 14 Does not fit this requirement.
D 225 Does not fit this requirement.

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

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

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

05 A campus planner needs shortest walking distances between every pair of buildings. Select the best model or method.
A Bellman–Ford algorithm Does not fit this requirement.
B PageRank Does not fit this requirement.
C Floyd–Warshall algorithm Floyd–Warshall algorithm directly matches the stated requirement.
D Prim's algorithm Does not fit this requirement.

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

06 If A* uses h(n) = 0 for every node with non-negative edge weights, it behaves like
A depth-first search Does not fit this requirement.
B Dijkstra’s algorithm Then priority is cost-so-far only.
C Prim's algorithm Does not fit this requirement.
D PageRank Does not fit this requirement.

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

07 A research program must store a sequence while preserving duplicates and order. Which ADT is most suitable?
A set Does not fit this requirement.
B list A list preserves sequence and permits repeated values.
C priority queue Does not fit this requirement.
D stack Does not fit this requirement.

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

08 How many edges are in an undirected complete graph with 13 vertices?
A 12 Does not fit this requirement.
B 156 Does not fit this requirement.
C 169 Does not fit this requirement.
D 78 There is one edge for each unordered pair: 13×12/2 = 78.

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

10 A bank provides understandable reasons for an automated rejection. Which concept best matches this situation?
A bias Does not fit this requirement.
B time complexity Does not fit this requirement.
C privacy Does not fit this requirement.
D transparency transparency directly matches the stated requirement.

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

11 Which signature best specifies the enqueue operation?
A item → queue Does not fit this requirement.
B queue → item Does not fit this requirement.
C queue × item → queue Enqueue adds an item to a queue.
D queue → queue × item Does not fit this requirement.

Written for icaijy.com · U3 AOS1 · ADT signatures · 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 Connect all offices with minimum total cable length. Which algorithm is most fit for purpose?
A Prim's algorithm This is a minimum spanning tree problem.
B PageRank Does not fit this requirement.
C Dijkstra’s algorithm Does not fit this requirement.
D Floyd–Warshall algorithm Does not fit this requirement.

Written for icaijy.com · U3 AOS2 · Graph algorithms · answered at 100 ms

14 A transport app must store a sequence while preserving duplicates and order. Which ADT is most suitable?
A priority queue Does not fit this requirement.
B set Does not fit this requirement.
C stack Does not fit this requirement.
D list A list preserves sequence and permits repeated values.

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

15 Training records reveal identifiable medical information. What is the most relevant issue?
A time complexity Does not fit this requirement.
B privacy risk The scenario directly illustrates privacy risk.
C minimum spanning tree Does not fit this requirement.
D termination proof Does not fit this requirement.

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

16 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

17 A council must connect all suburbs while minimising total new cable. Which tool is most fit for purpose?
A Floyd–Warshall algorithm Does not fit this requirement.
B PageRank Does not fit this requirement.
C Prim's algorithm Prim's algorithm directly matches the stated requirement.
D Bellman–Ford algorithm Does not fit this requirement.

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

18 In a weighted graph, a weight is usually attached to
A an edge or vertex to represent a quantity Weights encode cost, distance or another quantity.
B only isolated vertices Does not fit this requirement.
C the drawing scale Does not fit this requirement.
D the graph title Does not fit this requirement.

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

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

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

20 Which concept is illustrated? A person follows symbol rules without understanding the language.
A Turing Test Does not fit this requirement.
B Master Theorem Does not fit this requirement.
C Chinese Room argument This is the standard description of Chinese Room argument.
D PageRank Does not fit this requirement.

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

Run it again