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

That y8 kid 🤣 - bot · guest

11 Sep 2026, 9:31 p.m.

20Serious score
01 A max-priority queue removes the numerically highest priority first. Which job is removed?
A Job A (priority 2) A higher-priority job is present.
B Job B (priority 9) This has the highest priority.
C Job C (priority 5) 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

02 A bank provides understandable reasons for an automated rejection. Which concept best matches this situation?
A bias Does not fit this requirement.
B time complexity Does not fit this requirement.
C privacy Does not fit this requirement.
D transparency transparency directly matches the stated requirement.

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

03 A browser must return through previously visited pages in reverse order. Which tool is most fit for purpose?
A set Does not fit this requirement.
B stack stack directly matches the stated requirement.
C queue Does not fit this requirement.
D priority queue Does not fit this requirement.

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

04 A research program must look up a student record using a student ID. Which ADT is most suitable?
A stack Does not fit this requirement.
B dictionary A dictionary maps each key to a value.
C set Does not fit this requirement.
D queue Does not fit this requirement.

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

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

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

06 A research program must undo edits in reverse order. Which ADT is most suitable?
A priority queue Does not fit this requirement.
B stack A stack provides last-in, first-out access.
C set Does not fit this requirement.
D queue Does not fit this requirement.

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

07 Improve a timetable by repeatedly accepting only a better neighbouring timetable. Which approach is most suitable?
A dynamic programming Does not fit this requirement.
B breadth-first search Does not fit this requirement.
C binary search Does not fit this requirement.
D hill climbing hill climbing best matches the input and goal.

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

08 A greedy algorithm is claimed to be optimal. Which evidence is strongest?
A It worked on ten random inputs. Does not fit this requirement.
B It uses a priority queue. Does not fit this requirement.
C Its code is short. Does not fit this requirement.
D A proof that every greedy choice can be part of an optimal solution. An exchange-style argument establishes optimality generally.

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

09 The Church–Turing thesis informally claims that
A every true statement is provable Does not fit this requirement.
B every effectively calculable function can be computed by a Turing machine The accepted statement is: every effectively calculable function can be computed by a Turing machine.
C P equals NP Does not fit this requirement.
D all programs halt Does not fit this requirement.

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

10 Explore a game tree and undo choices when a dead end is reached. Which approach is most suitable?
A binary search Does not fit this requirement.
B PageRank Does not fit this requirement.
C backtracking backtracking best matches the input and goal.
D mergesort Does not fit this requirement.

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

11 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 100 ms

12 Tabulation is usually
A randomised backtracking Does not fit this requirement.
B a reduction proof Does not fit this requirement.
C bottom-up evaluation of DP states Tabulation fills a table in dependency order.
D a Turing Test Does not fit this requirement.

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

13 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

14 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

15 Which design pattern or algorithm orders frontier states using cost-so-far plus an estimated remaining cost?
A Prim's algorithm Does not fit this requirement.
B A* This is the defining behaviour of A*.
C Dijkstra’s algorithm Does not fit this requirement.
D PageRank Does not fit this requirement.

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

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

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

17 Which signature best specifies the lookup operation?
A key → dictionary Does not fit this requirement.
B dictionary × key → value Lookup maps a supplied key to its value.
C dictionary → key × value Does not fit this requirement.
D dictionary × value → key Does not fit this requirement.

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

18 A transport app must test quickly whether a username has already been used. Which ADT is most suitable?
A stack Does not fit this requirement.
B priority queue 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

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

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

20 How many edges are in an undirected complete graph with 17 vertices?
A 272 Does not fit this requirement.
B 136 There is one edge for each unordered pair: 17×16/2 = 136.
C 289 Does not fit this requirement.
D 16 Does not fit this requirement.

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

Run it again