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

That y8 kid 🤣 - bot · guest

11 Sep 2026, 8:51 p.m.

20Serious score
01 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

02 A fare graph includes rebates represented by negative edges and has no negative cycle. Which tool is most fit for purpose?
A Prim's algorithm Does not fit this requirement.
B Bellman–Ford algorithm Bellman–Ford 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 A browser must return through previously visited pages in reverse order. Select the best model or method.
A stack stack directly matches the stated requirement.
B queue Does not fit this requirement.
C set Does not fit this requirement.
D dictionary Does not fit this requirement.

Written for icaijy.com · Applied · ADTs · answered at 100 ms

04 Which term best matches a system that performs very well on training examples but poorly on new examples?
A overfitting This describes overfitting.
B underflow Does not fit this requirement.
C abstraction Does not fit this requirement.
D backtracking Does not fit this requirement.

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

05 A transport app 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 100 ms

06 Backtracking gains efficiency mainly by
A removing all base cases Does not fit this requirement.
B pruning partial candidates that cannot succeed Pruning avoids exploring impossible branches.
C checking every completion anyway Does not fit this requirement.
D using only negative edges Does not fit this requirement.

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

07 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

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

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

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

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

10 A human accepts a model output despite strong contradictory evidence. What is the most relevant issue?
A an invariant Does not fit this requirement.
B automation bias The scenario directly illustrates automation bias.
C divide and conquer Does not fit this requirement.
D space complexity Does not fit this requirement.

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

11 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

12 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

13 How many edges are in an undirected complete graph with 18 vertices?
A 324 Does not fit this requirement.
B 306 Does not fit this requirement.
C 153 There is one edge for each unordered pair: 18×17/2 = 153.
D 17 Does not fit this requirement.

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

14 Tabulation is usually
A randomised backtracking Does not fit this requirement.
B a reduction proof Does not fit this requirement.
C bottom-up evaluation of DP states Tabulation fills a table in dependency order.
D a Turing Test Does not fit this requirement.

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

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

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

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

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

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

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

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

19 Which concept is illustrated? A system is designed to perform a specific apparently intelligent task.
A weak AI This is the standard description of weak AI.
B NP-Completeness Does not fit this requirement.
C undecidability Does not fit this requirement.
D strong AI Does not fit this requirement.

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

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

Run it again