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

That y8 kid 🤣 - bot · guest

11 Sep 2026, 9:30 p.m.

20Serious score
01 Which term best matches a system that performs very well on training examples but poorly on new examples?
A overfitting This describes overfitting.
B underflow Does not fit this requirement.
C abstraction Does not fit this requirement.
D backtracking Does not fit this requirement.

Written for icaijy.com · U4 AOS3 · Data-driven algorithms · 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 Find a path using the fewest edges in an unweighted graph. Which algorithm is most fit for purpose?
A PageRank Does not fit this requirement.
B breadth-first search BFS explores vertices in increasing edge distance.
C Prim's algorithm Does not fit this requirement.
D depth-first search Does not fit this requirement.

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

04 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

05 Which term best matches a system that uses weighted connections arranged in layers?
A decision tree Does not fit this requirement.
B neural network This describes neural network.
C stack Does not fit this requirement.
D minimum spanning tree Does not fit this requirement.

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

06 Many membership queries on a large sorted array. Choose the best algorithmic description.
A hill climbing Does not fit this requirement.
B depth-first search Does not fit this requirement.
C binary search binary search best matches the input and goal.
D linear search Does not fit this requirement.

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

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

Written for icaijy.com · U3 AOS1 · Priority queues · 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 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

10 A face-recognition model works poorly for a group scarcely represented in its training set. What is the most relevant issue?
A guaranteed neutrality Does not fit this requirement.
B a faster runtime Does not fit this requirement.
C a proof of correctness Does not fit this requirement.
D bias from unrepresentative data The scenario directly illustrates bias from unrepresentative data.

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

11 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

12 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

13 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

14 A Turing machine transition depends on
A a random training label Does not fit this requirement.
B the wall-clock time only Does not fit this requirement.
C the current state and scanned symbol The accepted statement is: the current state and scanned symbol.
D the entire future tape Does not fit this requirement.

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

15 An exponential-time algorithm on large inputs illustrates
A an undecidable problem Does not fit this requirement.
B a soft limit of computability The problem is computable but may be impractical.
C a syntax error Does not fit this requirement.
D a violation of Church–Turing Does not fit this requirement.

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

16 Estimate a web page’s importance from links made by other pages. Which algorithm is most fit for purpose?
A PageRank PageRank estimates importance from incoming links.
B Prim's algorithm Does not fit this requirement.
C binary search 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

17 A max-priority queue removes the numerically highest priority first. Which job is removed?
A Job A (priority 20) This has the highest priority.
B Job B (priority 16) A higher-priority job is present.
C Job C (priority 18) A higher-priority job is present.
D Job D (priority 7) A higher-priority job is present.

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

18 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

19 Assume constant-time primitive operations. What is the tightest Big-O bound for: For i from 1 to n: For j from 1 to i: constantWork()
A \(O(n)\) Does not fit this requirement.
B \(O(n^2)\) \(1+\cdots+n\) is quadratic.
C \(O(\log n)\) Does not fit this requirement.
D \(O(n^3)\) Does not fit this requirement.

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

20 A* uses f(n) = g(n) + h(n). Which frontier node should it expand next?
A Node A: g = 3, h = 15, f = 18 f = 18; another node has a smaller f.
B Node B: g = 7, h = 6, f = 13 f = 13; another node has a smaller f.
C Node C: g = 10, h = 2, f = 12 f = 12; this is minimal.
D Node D: g = 12, h = 1, f = 13 f = 13; another node has a smaller f.

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

Run it again