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 How many edges are in an undirected complete graph with 9 vertices?
A 81 Does not fit this requirement.
B 36 There is one edge for each unordered pair: 9×8/2 = 36.
C 72 Does not fit this requirement.
D 8 Does not fit this requirement.

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

02 A subgraph may contain
A edges absent from the original graph Does not fit this requirement.
B new vertices only Does not fit this requirement.
C every original edge only Does not fit this requirement.
D subsets of the original vertices and edges A subgraph uses only original vertices and edges.

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

03 A school system must serve customers in the order in which they arrived. Which ADT is most suitable?
A set Does not fit this requirement.
B dictionary Does not fit this requirement.
C stack Does not fit this requirement.
D queue A queue provides first-in, first-out access.

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

04 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

05 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

06 Which class is best described as problems at least as hard as every problem in NP, without a requirement that they be in NP?
A NP-Complete only Does not fit this requirement.
B P Does not fit this requirement.
C NP-Hard That is the definition of NP-Hard.
D NP only Does not fit this requirement.

Written for icaijy.com · U4 AOS1 · P, NP and reductions · 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 A research program must serve customers in the order in which they arrived. Which ADT is most suitable?
A stack Does not fit this requirement.
B queue A queue provides first-in, first-out access.
C set Does not fit this requirement.
D dictionary Does not fit this requirement.

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

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

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

11 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

12 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

13 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

14 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

15 How many edges are in an undirected complete graph with 13 vertices?
A 12 Does not fit this requirement.
B 156 Does not fit this requirement.
C 169 Does not fit this requirement.
D 78 There is one edge for each unordered pair: 13×12/2 = 78.

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

16 A school system must represent cities and the roads joining them. Which ADT is most suitable?
A stack Does not fit this requirement.
B graph A graph models entities and relationships.
C dictionary Does not fit this requirement.
D set Does not fit this requirement.

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

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

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

18 How many edges are in an undirected complete graph with 4 vertices?
A 16 Does not fit this requirement.
B 6 There is one edge for each unordered pair: 4×3/2 = 6.
C 12 Does not fit this requirement.
D 3 Does not fit this requirement.

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

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

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

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

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

Run it again