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

That y8 kid 🤣 - bot · guest

11 Sep 2026, 8:56 p.m.

20Serious score
01 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

02 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

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

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

04 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

05 A max-priority queue removes the numerically highest priority first. Which job is removed?
A Job A (priority 14) This has the highest priority.
B Job B (priority 3) A higher-priority job is present.
C Job C (priority 8) A higher-priority job is present.
D Job D (priority 6) A higher-priority job is present.

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

06 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

07 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

08 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

09 Assume constant-time primitive operations. What is the tightest Big-O bound for: For i from 1 to n: constantWork()
A \(O(1)\) Does not fit this requirement.
B \(O(n)\) The body runs n times.
C \(O(\log n)\) Does not fit this requirement.
D \(O(n^2)\) Does not fit this requirement.

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

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

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

11 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

12 A fare graph includes rebates represented by negative edges and has no negative cycle. Which tool is most fit for purpose?
A Prim's algorithm Does not fit this requirement.
B Bellman–Ford algorithm Bellman–Ford 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

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

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

14 A max-priority queue removes the numerically highest priority first. Which job is removed?
A Job A (priority 25) This has the highest priority.
B Job B (priority 23) A higher-priority job is present.
C Job C (priority 9) A higher-priority job is present.
D Job D (priority 24) A higher-priority job is present.

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

15 Which signature best specifies the front operation?
A queue × item → queue Does not fit this requirement.
B queue → queue × item Does not fit this requirement.
C queue → item Front observes the next item without adding one.
D item → queue Does not fit this requirement.

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

16 In the standard model, a Turing machine reads and writes symbols on
A a neural network Does not fit this requirement.
B a finite queue only Does not fit this requirement.
C a weighted graph Does not fit this requirement.
D an unbounded tape divided into cells The accepted statement is: an unbounded tape divided into cells.

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

17 Which term best matches a system that separates classes using a maximum-margin boundary?
A simulated annealing Does not fit this requirement.
B queue Does not fit this requirement.
C support vector machine This describes support vector machine.
D decision tree Does not fit this requirement.

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

18 Training records reveal identifiable medical information. What is the most relevant issue?
A time complexity Does not fit this requirement.
B privacy risk The scenario directly illustrates privacy risk.
C minimum spanning tree Does not fit this requirement.
D termination proof Does not fit this requirement.

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

19 Which class is best described as decision problems solvable in polynomial time?
A undecidable Does not fit this requirement.
B NP Does not fit this requirement.
C P That is the definition of P.
D NP-Hard Does not fit this requirement.

Written for icaijy.com · U4 AOS1 · P, NP and reductions · answered at 100 ms

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

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

Run it again