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

That y8 kid 🤣 - bot · guest

11 Sep 2026, 9:29 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 school system must always process the waiting job with the highest urgency. Which ADT is most suitable?
A stack Does not fit this requirement.
B set Does not fit this requirement.
C priority queue A priority queue removes the highest-priority item.
D queue Does not fit this requirement.

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

03 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

04 Which signature best specifies the push operation?
A stack → stack × item Does not fit this requirement.
B stack × item → stack Push adds an item and returns the updated stack.
C stack → item Does not fit this requirement.
D item → stack Does not fit this requirement.

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

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

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

06 Which class is best described as problems that are both in NP and NP-Hard?
A NP-Complete That is the definition of NP-Complete.
B exponential Does not fit this requirement.
C P Does not fit this requirement.
D NP Does not fit this requirement.

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

07 A form must reject an ID if it is already present. Which concept best matches this situation?
A dictionary Does not fit this requirement.
B priority 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

08 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

09 An exponential-time algorithm on large inputs illustrates
A an undecidable problem Does not fit this requirement.
B a soft limit of computability The problem is computable but may be impractical.
C a syntax error Does not fit this requirement.
D a violation of Church–Turing Does not fit this requirement.

Written for icaijy.com · U4 AOS1 · Complexity limits · answered at 100 ms

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

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

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

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

12 Which term must be true before an algorithm is executed?
A loop invariant Does not fit this requirement.
B postcondition Does not fit this requirement.
C precondition This describes a precondition.
D heuristic Does not fit this requirement.

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

13 A classifier learns from emails already labelled spam or not spam. Select the best model or method.
A unsupervised learning Does not fit this requirement.
B binary search Does not fit this requirement.
C PageRank Does not fit this requirement.
D supervised learning supervised learning directly matches the stated requirement.

Written for icaijy.com · Applied · data-driven algorithms · answered at 100 ms

14 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

15 Lambda calculus is important in computability because it
A proves all algorithms efficient Does not fit this requirement.
B provides a model of computation equivalent in power to Turing machines The accepted statement is: provides a model of computation equivalent in power to Turing machines.
C requires machine learning Does not fit this requirement.
D sorts only numeric arrays Does not fit this requirement.

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

16 A graph is connected when
A it contains no cycle Does not fit this requirement.
B every vertex has equal degree Does not fit this requirement.
C every pair of vertices has a path between them Connectivity requires paths, not direct edges.
D every vertex is adjacent to every other Does not fit this requirement.

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

17 A transport app must undo edits in reverse order. Which ADT is most suitable?
A queue Does not fit this requirement.
B stack A stack provides last-in, first-out access.
C priority queue Does not fit this requirement.
D set Does not fit this requirement.

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

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

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

19 Assume constant-time primitive operations. What is the tightest Big-O bound for: For i from 1 to n: j ← 1; While j < n: j ← 2j
A \(O(n \log n)\) A logarithmic loop occurs n times.
B \(O(n^2)\) Does not fit this requirement.
C \(O(n)\) Does not fit this requirement.
D \(O(\log n)\) Does not fit this requirement.

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

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

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

Run it again