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

That y8 kid 🤣 - bot · guest

11 Sep 2026, 9:33 p.m.

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

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

02 For a decision version of travelling salesperson, a natural certificate is
A an unsorted list of edge weights Does not fit this requirement.
B a proposed tour whose length can be checked A proposed tour can be verified in polynomial time.
C a proof that P ≠ NP Does not fit this requirement.
D the source code of every algorithm Does not fit this requirement.

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

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

Written for icaijy.com · U4 AOS1 · Recurrence relations · 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 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

06 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

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

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

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

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

09 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

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

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

11 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

12 Patients must be treated according to changing urgency scores. Select the best model or method.
A dictionary Does not fit this requirement.
B queue Does not fit this requirement.
C set Does not fit this requirement.
D priority queue priority queue directly matches the stated requirement.

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

13 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

14 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

15 A school system must store a sequence while preserving duplicates and order. Which ADT is most suitable?
A set Does not fit this requirement.
B priority queue Does not fit this requirement.
C list A list preserves sequence and permits repeated values.
D stack Does not fit this requirement.

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

16 A council must connect all suburbs while minimising total new cable. Select the best model or method.
A Bellman–Ford algorithm Does not fit this requirement.
B Prim's algorithm Prim's algorithm directly matches the stated requirement.
C Dijkstra’s algorithm Does not fit this requirement.
D PageRank Does not fit this requirement.

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

17 How many edges are in an undirected complete graph with 12 vertices?
A 132 Does not fit this requirement.
B 11 Does not fit this requirement.
C 66 There is one edge for each unordered pair: 12×11/2 = 66.
D 144 Does not fit this requirement.

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

18 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

19 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

20 A tree with n vertices has exactly
A \(n+1\) edges Does not fit this requirement.
B \(2n\) edges Does not fit this requirement.
C n edges Does not fit this requirement.
D \(n-1\) edges A connected acyclic graph has \(n-1\) edges.

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

Run it again