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 For sufficiently large n, which grows more slowly than \(O(2^n)\)?
A \(O(n^3)\) \(O(n^3)\) 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(2^n)\) Does not fit this requirement.

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

02 How many edges are in an undirected complete graph with 10 vertices?
A 100 Does not fit this requirement.
B 9 Does not fit this requirement.
C 90 Does not fit this requirement.
D 45 There is one edge for each unordered pair: 10×9/2 = 45.

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

03 Which design pattern is most clearly used by a recursive maze solver that reverses choices at dead ends?
A backtracking A recursive maze solver that reverses choices at dead ends uses backtracking.
B brute-force search Does not fit this requirement.
C divide and conquer 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

04 Which concept is illustrated? A person follows symbol rules without understanding the language.
A Turing Test Does not fit this requirement.
B Master Theorem Does not fit this requirement.
C Chinese Room argument This is the standard description of Chinese Room argument.
D PageRank Does not fit this requirement.

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

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

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

06 A council must connect all suburbs while minimising total new cable. Which concept best matches this situation?
A Dijkstra’s algorithm Does not fit this requirement.
B Bellman–Ford algorithm Does not fit this requirement.
C Floyd–Warshall algorithm Does not fit this requirement.
D Prim's algorithm Prim's algorithm directly matches the stated requirement.

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

07 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

08 One lookup in an unsorted list of five items. Choose the best algorithmic description.
A Floyd–Warshall Does not fit this requirement.
B Prim's algorithm Does not fit this requirement.
C linear search linear search best matches the input and goal.
D PageRank Does not fit this requirement.

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

09 A browser must return through previously visited pages in reverse order. Which concept best matches this situation?
A queue Does not fit this requirement.
B priority queue Does not fit this requirement.
C dictionary Does not fit this requirement.
D stack stack directly matches the stated requirement.

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

10 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

11 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

12 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

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

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

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

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

15 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

16 A research program must look up a student record using a student ID. Which ADT is most suitable?
A stack Does not fit this requirement.
B dictionary A dictionary maps each key to a value.
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 Connect all offices with minimum total cable length. Which algorithm is most fit for purpose?
A Prim's algorithm This is a minimum spanning tree problem.
B PageRank Does not fit this requirement.
C Dijkstra’s algorithm Does not fit this requirement.
D Floyd–Warshall algorithm Does not fit this requirement.

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

18 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

19 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

20 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

Run it again