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

Anonymous Student · guest

10 Sep 2026, 6:22 p.m.

11Serious score
01 A* uses f(n) = g(n) + h(n). Which frontier node should it expand next?
A Node A: g = 3, h = 7, f = 10 f = 10; this is minimal.
B Node B: g = 5, h = 6, f = 11 f = 11; another node has a smaller f.
C Node C: g = 7, h = 3, f = 10 f = 10; another node has a smaller f.
D Node D: g = 8, h = 2, f = 10 f = 10; another node has a smaller f.

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

02 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 2272 ms

03 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 3336 ms

04 A* uses f(n) = g(n) + h(n). Which frontier node should it expand next?
A Node A: g = 2, h = 10, f = 12 f = 12; another node has a smaller f.
B Node B: g = 6, h = 5, f = 11 f = 11; another node has a smaller f.
C Node C: g = 9, h = 1, f = 10 f = 10; this is minimal.
D Node D: g = 4, h = 8, f = 12 f = 12; another node has a smaller f.

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

05 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 10124 ms

06 Why can testing many inputs usually not prove that an algorithm is correct for every valid input?
A Untested valid inputs may still fail. A finite test set need not cover the whole input domain.
B Only recursive algorithms can be tested. Does not fit this requirement.
C Big-O notation forbids testing. Does not fit this requirement.
D Testing always changes the algorithm. Does not fit this requirement.

Written for icaijy.com · U3 AOS2 · Correctness · answered at 13001 ms

07 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 14774 ms

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

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

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

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

10 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 24232 ms

11 Memoisation is
A top-down recursion with cached subproblem results Memoisation caches recursive results.
B a greedy proof Does not fit this requirement.
C a graph traversal without storage Does not fit this requirement.
D a hardware optimisation only Does not fit this requirement.

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

12 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 31159 ms

13 Which design pattern or algorithm commits to the locally best available choice at each step?
A divide and conquer Does not fit this requirement.
B dynamic programming Does not fit this requirement.
C backtracking Does not fit this requirement.
D greedy This is the defining behaviour of greedy.

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

14 A system groups articles without any supplied category labels. Which tool is most fit for purpose?
A unsupervised learning unsupervised learning directly matches the stated requirement.
B backtracking Does not fit this requirement.
C supervised learning Does not fit this requirement.
D PageRank Does not fit this requirement.

Written for icaijy.com · Applied · data-driven algorithms · answered at 38306 ms

15 A school system must always process the waiting job with the highest urgency. Which ADT is most suitable?
A stack Does not fit this requirement.
B set Does not fit this requirement.
C priority queue A priority queue removes the highest-priority item.
D queue Does not fit this requirement.

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

16 Lambda calculus is important in computability because it
A proves all algorithms efficient Does not fit this requirement.
B provides a model of computation equivalent in power to Turing machines The accepted statement is: provides a model of computation equivalent in power to Turing machines.
C requires machine learning Does not fit this requirement.
D sorts only numeric arrays Does not fit this requirement.

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

17 A school system must access the 18th temperature reading directly. Which ADT is most suitable?
A queue Does not fit this requirement.
B stack Does not fit this requirement.
C array An array supports access by numeric index.
D set Does not fit this requirement.

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

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

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

19 A* uses f(n) = g(n) + h(n). Which frontier node should it expand next?
A Node A: g = 5, h = 8, f = 13 f = 13; another node has a smaller f.
B Node B: g = 8, h = 4, f = 12 f = 12; this is minimal.
C Node C: g = 4, h = 10, f = 14 f = 14; another node has a smaller f.
D Node D: g = 9, h = 3, f = 12 f = 12; another node has a smaller f.

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

20 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 54686 ms

21 Which term establishes that an algorithm cannot continue forever?
A ADT signature Does not fit this requirement.
B heuristic value Does not fit this requirement.
C termination argument This describes a termination argument.
D test case Does not fit this requirement.

Written for icaijy.com · U3 AOS2 · Correctness and modularity · answered at 56532 ms

22 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 57653 ms

23 A system groups articles without any supplied category labels. Which concept best matches this situation?
A binary search Does not fit this requirement.
B unsupervised learning unsupervised learning directly matches the stated requirement.
C supervised learning Does not fit this requirement.
D PageRank Does not fit this requirement.

Written for icaijy.com · Applied · data-driven algorithms · answered at 58638 ms

Run it again