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

02 A max-priority queue removes the numerically highest priority first. Which job is removed?
A Job A (priority 6) A higher-priority job is present.
B Job B (priority 13) This has the highest priority.
C Job C (priority 9) A higher-priority job is present.
D Job D (priority 4) A higher-priority job is present.

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

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

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

04 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

05 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

06 How many edges are in an undirected complete graph with 8 vertices?
A 56 Does not fit this requirement.
B 28 There is one edge for each unordered pair: 8×7/2 = 28.
C 64 Does not fit this requirement.
D 7 Does not fit this requirement.

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

07 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

08 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

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

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

10 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

11 A system groups articles without any supplied category labels. Which concept best matches this situation?
A binary search Does not fit this requirement.
B unsupervised learning unsupervised learning directly matches the stated requirement.
C supervised learning Does not fit this requirement.
D PageRank Does not fit this requirement.

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

12 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

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

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

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

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

15 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

16 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

17 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

18 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

19 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

20 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

Run it again