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

That y8 kid 🤣 - bot · guest

11 Sep 2026, 8:58 p.m.

20Serious score
01 Which term best matches a system that uses a trained model to produce an output for new data?
A recursion Does not fit this requirement.
B annotation Does not fit this requirement.
C training Does not fit this requirement.
D inference This describes inference.

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

02 Patients must be treated according to changing urgency scores. Which concept best matches this situation?
A priority queue priority queue directly matches the stated requirement.
B queue Does not fit this requirement.
C stack Does not fit this requirement.
D set Does not fit this requirement.

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

03 Assume constant-time primitive operations. What is the tightest Big-O bound for: While n > 0: n ← n − 2
A \(O(n)\) Dividing the iteration count by constant 2 keeps it linear.
B \(O(n^2)\) Does not fit this requirement.
C \(O(\log n)\) Does not fit this requirement.
D \(O(1)\) Does not fit this requirement.

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

04 Which concept is illustrated? A text-only interrogator tries to distinguish a human from a machine.
A Church–Turing thesis Does not fit this requirement.
B Turing Test This is the standard description of Turing Test.
C Chinese Room Does not fit this requirement.
D Halting Problem Does not fit this requirement.

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

05 A fare graph includes rebates represented by negative edges and has no negative cycle. Select the best model or method.
A Bellman–Ford algorithm Bellman–Ford algorithm directly matches the stated requirement.
B Dijkstra’s algorithm Does not fit this requirement.
C Floyd–Warshall algorithm Does not fit this requirement.
D PageRank Does not fit this requirement.

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

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

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

07 Improve a timetable by repeatedly accepting only a better neighbouring timetable. Which approach is most suitable?
A dynamic programming Does not fit this requirement.
B breadth-first search Does not fit this requirement.
C binary search Does not fit this requirement.
D hill climbing hill climbing best matches the input and goal.

Written for icaijy.com · U4 AOS2 · Selecting algorithms · answered at 100 ms

08 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

09 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

10 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

11 A browser must return through previously visited pages in reverse order. Select the best model or method.
A stack stack directly matches the stated requirement.
B queue Does not fit this requirement.
C set Does not fit this requirement.
D dictionary Does not fit this requirement.

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

12 Which design pattern or algorithm repeatedly moves to a neighbouring state with a better heuristic value?
A divide and conquer Does not fit this requirement.
B dynamic programming Does not fit this requirement.
C breadth-first search Does not fit this requirement.
D hill climbing This is the defining behaviour of hill climbing.

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

13 The negative resolution of the Entscheidungsproblem showed that
A every program can be tested exhaustively Does not fit this requirement.
B all mathematical claims are false Does not fit this requirement.
C NP-Complete problems are undecidable Does not fit this requirement.
D no single algorithm decides validity for every statement in first-order logic The accepted statement is: no single algorithm decides validity for every statement in first-order logic.

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

14 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

15 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

16 Which term hides implementation details behind specified operations?
A brute force Does not fit this requirement.
B abstraction This describes a abstraction.
C graph density Does not fit this requirement.
D recursion depth Does not fit this requirement.

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

17 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

18 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

19 A school system must serve customers in the order in which they arrived. Which ADT is most suitable?
A set Does not fit this requirement.
B dictionary Does not fit this requirement.
C stack Does not fit this requirement.
D queue A queue provides first-in, first-out access.

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

20 A research program must test quickly whether a username has already been used. Which ADT is most suitable?
A priority queue Does not fit this requirement.
B stack Does not fit this requirement.
C queue Does not fit this requirement.
D set A set models unique membership.

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

Run it again