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 A max-priority queue removes the numerically highest priority first. Which job is removed?
A Job A (priority 6) A higher-priority job is present.
B Job B (priority 13) This has the highest priority.
C Job C (priority 9) A higher-priority job is present.
D Job D (priority 4) A higher-priority job is present.

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

02 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

03 Which concept is illustrated? A machine genuinely possesses a mind or understanding.
A graph search Does not fit this requirement.
B supervised learning Does not fit this requirement.
C strong AI This is the standard description of strong AI.
D weak AI Does not fit this requirement.

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

04 Using the usual inclusive low/high implementation, at most how many element inspections can an unsuccessful binary search of 8 sorted items require?
A 3 Does not fit this requirement.
B 4 An unsuccessful search may inspect floor(log₂(8)) + 1 = 4 elements.
C 8 Does not fit this requirement.
D 5 Does not fit this requirement.

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

05 Optimise a timetable while occasionally accepting worse moves early in the search. Choose the best algorithmic description.
A Floyd–Warshall Does not fit this requirement.
B binary search Does not fit this requirement.
C simulated annealing simulated annealing best matches the input and goal.
D hill climbing Does not fit this requirement.

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

06 A max-priority queue removes the numerically highest priority first. Which job is removed?
A Job A (priority 7) A higher-priority job is present.
B Job B (priority 14) This has the highest priority.
C Job C (priority 11) A higher-priority job is present.
D Job D (priority 13) A higher-priority job is present.

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

07 Which design pattern is most clearly used by binary search?
A brute-force search Does not fit this requirement.
B dynamic programming Does not fit this requirement.
C divide and conquer Binary search uses divide and conquer.
D greedy Does not fit this requirement.

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

08 Using the usual inclusive low/high implementation, at most how many element inspections can an unsuccessful binary search of 1024 sorted items require?
A 1024 Does not fit this requirement.
B 10 Does not fit this requirement.
C 12 Does not fit this requirement.
D 11 An unsuccessful search may inspect floor(log₂(1024)) + 1 = 11 elements.

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

09 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

10 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

11 Using the usual inclusive low/high implementation, at most how many element inspections can an unsuccessful binary search of 16384 sorted items require?
A 16 Does not fit this requirement.
B 16384 Does not fit this requirement.
C 15 An unsuccessful search may inspect floor(log₂(16384)) + 1 = 15 elements.
D 14 Does not fit this requirement.

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

12 Binary search uses \(\lfloor(low+high)/2\rfloor\) on the sorted integers 1…15. How many values are inspected when searching for 3?
A 1 Does not fit this requirement.
B 4 The midpoint trace reaches 3 after 4 inspection(s).
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

13 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

14 Assume constant-time primitive operations. What is the tightest Big-O bound for: While n > 1: n ← floor(n/2)
A \(O(n)\) Does not fit this requirement.
B \(O(n \log n)\) Does not fit this requirement.
C \(O(\log n)\) Repeated halving takes logarithmically many steps.
D \(O(1)\) Does not fit this requirement.

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

15 Use the supplied Master Theorem. What is T(n) if \(T(n)=4T(n/4)+O(n^0)\)?
A \(O(n \log n)\) Does not fit this requirement.
B \(O(n)\) Compare \(a=4\) with \(b^c=1\).
C \(O(n^3)\) 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

16 A fare graph includes rebates represented by negative edges and has no negative cycle. Which concept best matches this situation?
A PageRank Does not fit this requirement.
B Floyd–Warshall algorithm Does not fit this requirement.
C Prim's algorithm Does not fit this requirement.
D Bellman–Ford algorithm Bellman–Ford algorithm directly matches the stated requirement.

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

17 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

18 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

19 As simulated annealing temperature decreases, accepting a worse move generally becomes
A less likely Cooling gradually reduces exploratory worse moves.
B more likely Does not fit this requirement.
C unrelated to temperature Does not fit this requirement.
D certain Does not fit this requirement.

Written for icaijy.com · U4 AOS2 · Advanced design · answered at 100 ms

20 A campus planner needs shortest walking distances between every pair of buildings. Select the best model or method.
A Bellman–Ford algorithm Does not fit this requirement.
B PageRank Does not fit this requirement.
C Floyd–Warshall algorithm Floyd–Warshall algorithm directly matches the stated requirement.
D Prim's algorithm Does not fit this requirement.

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

Run it again