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

02 Which signature best specifies the pop operation?
A stack → stack Pop removes the top item and returns the updated stack in this specification.
B item → stack Does not fit this requirement.
C stack × item → stack Does not fit this requirement.
D stack → item × item Does not fit this requirement.

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

03 Which design pattern or algorithm abandons a partial candidate as soon as it cannot lead to a valid solution?
A PageRank Does not fit this requirement.
B hill climbing Does not fit this requirement.
C binary search Does not fit this requirement.
D backtracking This is the defining behaviour of backtracking.

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

04 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

05 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

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

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

07 A max-priority queue removes the numerically highest priority first. Which job is removed?
A Job A (priority 1) A higher-priority job is present.
B Job B (priority 4) A higher-priority job is present.
C Job C (priority 12) This has the highest priority.
D Job D (priority 10) A higher-priority job is present.

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

08 Which signature best specifies the enqueue operation?
A item → queue Does not fit this requirement.
B queue → item Does not fit this requirement.
C queue × item → queue Enqueue adds an item to a queue.
D queue → queue × item Does not fit this requirement.

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

09 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

10 A council must connect all suburbs while minimising total new cable. Which tool is most fit for purpose?
A Floyd–Warshall algorithm Does not fit this requirement.
B PageRank Does not fit this requirement.
C Prim's algorithm Prim's algorithm directly matches the stated requirement.
D Bellman–Ford algorithm Does not fit this requirement.

Written for icaijy.com · Applied · graph algorithms · answered at 100 ms

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

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

12 Assume constant-time primitive operations. What is the tightest Big-O bound for: For i from 1 to n: For j from 1 to 67: constantWork()
A \(O(n^2)\) Does not fit this requirement.
B \(O(n)\) 67 is a constant independent of n.
C \(O(1)\) Does not fit this requirement.
D \(O(n \log n)\) Does not fit this requirement.

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

13 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

14 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

15 A school system must represent cities and the roads joining them. Which ADT is most suitable?
A stack Does not fit this requirement.
B graph A graph models entities and relationships.
C dictionary Does not fit this requirement.
D set Does not fit this requirement.

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

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

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

17 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

18 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

19 Find shortest distances from one depot when all edge weights are non-negative. Which algorithm is most fit for purpose?
A PageRank Does not fit this requirement.
B Floyd–Warshall algorithm Does not fit this requirement.
C Dijkstra’s algorithm Dijkstra solves non-negative single-source shortest paths.
D Prim's algorithm Does not fit this requirement.

Written for icaijy.com · U3 AOS2 · Graph algorithms · answered at 100 ms

20 Which design pattern or algorithm sometimes accepts a worse move according to a temperature parameter?
A binary search Does not fit this requirement.
B backtracking Does not fit this requirement.
C hill climbing Does not fit this requirement.
D simulated annealing This is the defining behaviour of simulated annealing.

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

Run it again