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

That y8 kid 🤣 - bot · guest

11 Sep 2026, 8:55 p.m.

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

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

02 A face-recognition model works poorly for a group scarcely represented in its training set. What is the most relevant issue?
A guaranteed neutrality Does not fit this requirement.
B a faster runtime Does not fit this requirement.
C a proof of correctness Does not fit this requirement.
D bias from unrepresentative data The scenario directly illustrates bias from unrepresentative data.

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

03 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

04 A bank provides understandable reasons for an automated rejection. Select the best model or method.
A privacy Does not fit this requirement.
B time complexity Does not fit this requirement.
C bias Does not fit this requirement.
D transparency transparency directly matches the stated requirement.

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

05 Which term establishes that an algorithm cannot continue forever?
A ADT signature Does not fit this requirement.
B heuristic value Does not fit this requirement.
C termination argument This describes a termination argument.
D test case Does not fit this requirement.

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

06 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

07 Which design pattern is most clearly used by the standard one-dimensional 0–1 knapsack algorithm?
A brute-force search Does not fit this requirement.
B divide and conquer Does not fit this requirement.
C greedy Does not fit this requirement.
D dynamic programming The standard one-dimensional 0–1 knapsack algorithm uses dynamic programming.

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

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

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

09 Which design pattern or algorithm systematically examines every candidate solution?
A divide and conquer Does not fit this requirement.
B brute-force search This is the defining behaviour of brute-force search.
C dynamic programming Does not fit this requirement.
D greedy Does not fit this requirement.

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

10 A form must reject an ID if it is already present. Select the best model or method.
A dictionary Does not fit this requirement.
B queue Does not fit this requirement.
C stack Does not fit this requirement.
D set set directly matches the stated requirement.

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

11 Which design pattern or algorithm orders frontier states using cost-so-far plus an estimated remaining cost?
A Prim's algorithm Does not fit this requirement.
B A* This is the defining behaviour of A*.
C Dijkstra’s algorithm Does not fit this requirement.
D PageRank Does not fit this requirement.

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

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

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

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

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

14 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

15 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

16 Which term best matches a system that uses weighted connections arranged in layers?
A decision tree Does not fit this requirement.
B neural network This describes neural network.
C stack Does not fit this requirement.
D minimum spanning tree Does not fit this requirement.

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

17 The Church–Turing thesis informally claims that
A every true statement is provable Does not fit this requirement.
B every effectively calculable function can be computed by a Turing machine The accepted statement is: every effectively calculable function can be computed by a Turing machine.
C P equals NP Does not fit this requirement.
D all programs halt Does not fit this requirement.

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

18 A subgraph may contain
A edges absent from the original graph Does not fit this requirement.
B new vertices only Does not fit this requirement.
C every original edge only Does not fit this requirement.
D subsets of the original vertices and edges A subgraph uses only original vertices and edges.

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

19 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

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

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

Run it again