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

That y8 kid 🤣 - bot · guest

11 Sep 2026, 9:28 p.m.

20Serious score
01 A postcode indirectly encodes socioeconomic or ethnic background. What is the most relevant issue?
A a proxy variable may reproduce discrimination The scenario directly illustrates a proxy variable may reproduce discrimination.
B the algorithm becomes undecidable Does not fit this requirement.
C the feature is automatically fair Does not fit this requirement.
D the model becomes unsupervised Does not fit this requirement.

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

02 Which term best matches a system that makes predictions by following feature-based branches?
A decision tree This describes decision tree.
B neural network Does not fit this requirement.
C support vector machine Does not fit this requirement.
D Turing machine Does not fit this requirement.

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

03 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

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

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

05 How many edges are in an undirected complete graph with 5 vertices?
A 4 Does not fit this requirement.
B 25 Does not fit this requirement.
C 10 There is one edge for each unordered pair: 5×4/2 = 10.
D 20 Does not fit this requirement.

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

06 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

07 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

08 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

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

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

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

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

11 The general Halting Problem is
A linear time Does not fit this requirement.
B undecidable The accepted statement is: undecidable.
C NP-Complete Does not fit this requirement.
D solved by binary search Does not fit this requirement.

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

12 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

13 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

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

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

15 Which term must be true when a correct algorithm terminates?
A recurrence Does not fit this requirement.
B precondition Does not fit this requirement.
C counterexample Does not fit this requirement.
D postcondition This describes a postcondition.

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…15. How many values are inspected when searching for 11?
A 4 The midpoint trace reaches 11 after 4 inspection(s).
B 7 Does not fit this requirement.
C 1 Does not fit this requirement.
D 2 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 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

18 Use the supplied Master Theorem. What is T(n) if \(T(n)=9T(n/3)+O(n^1)\)?
A \(O(n^2)\) Compare \(a=9\) with \(b^c=3\).
B \(O(n \log n)\) Does not fit this requirement.
C \(O(\log n)\) Does not fit this requirement.
D \(O(n)\) Does not fit this requirement.

Written for icaijy.com · U4 AOS1 · Recurrence relations · answered at 100 ms

19 Which class is best described as decision problems solvable in polynomial time?
A undecidable Does not fit this requirement.
B NP Does not fit this requirement.
C P That is the definition of P.
D NP-Hard Does not fit this requirement.

Written for icaijy.com · U4 AOS1 · P, NP and reductions · answered at 100 ms

20 A basic hill-climbing search may stop before the global optimum because of
A the Master Theorem Does not fit this requirement.
B a local optimum No improving neighbour may exist at a non-global optimum.
C a guaranteed negative cycle Does not fit this requirement.
D a queue overflow by definition Does not fit this requirement.

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

Run it again