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 Patients must be treated according to changing urgency scores. Select the best model or method.
A dictionary Does not fit this requirement.
B queue Does not fit this requirement.
C set Does not fit this requirement.
D priority queue priority queue directly matches the stated requirement.

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

02 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

03 A route finder combines distance travelled with estimated distance remaining. Select the best model or method.
A simulated annealing Does not fit this requirement.
B A* A* directly matches the stated requirement.
C hill climbing Does not fit this requirement.
D dynamic programming Does not fit this requirement.

Written for icaijy.com · Applied · advanced design · answered at 100 ms

04 A basic hill-climbing search may stop before the global optimum because of
A the Master Theorem Does not fit this requirement.
B a local optimum No improving neighbour may exist at a non-global optimum.
C a guaranteed negative cycle Does not fit this requirement.
D a queue overflow by definition Does not fit this requirement.

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

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

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

06 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

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

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

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

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

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

10 How many edges are in an undirected complete graph with 14 vertices?
A 196 Does not fit this requirement.
B 182 Does not fit this requirement.
C 13 Does not fit this requirement.
D 91 There is one edge for each unordered pair: 14×13/2 = 91.

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

11 Which signature best specifies the pop operation?
A stack → stack Pop removes the top item and returns the updated stack in this specification.
B item → stack Does not fit this requirement.
C stack × item → stack Does not fit this requirement.
D stack → item × item Does not fit this requirement.

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

12 A loan applicant is told what major factors affected an automated decision. What is the most relevant issue?
A recursion Does not fit this requirement.
B transparency The scenario directly illustrates transparency.
C graph connectivity Does not fit this requirement.
D data compression Does not fit this requirement.

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

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

14 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

15 A postcode indirectly encodes socioeconomic or ethnic background. What is the most relevant issue?
A a proxy variable may reproduce discrimination The scenario directly illustrates a proxy variable may reproduce discrimination.
B the algorithm becomes undecidable Does not fit this requirement.
C the feature is automatically fair Does not fit this requirement.
D the model becomes unsupervised Does not fit this requirement.

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

16 Which design pattern is most clearly used by the standard one-dimensional 0–1 knapsack algorithm?
A brute-force search Does not fit this requirement.
B divide and conquer Does not fit this requirement.
C greedy Does not fit this requirement.
D dynamic programming The standard one-dimensional 0–1 knapsack algorithm uses dynamic programming.

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

17 A useful dynamic-programming state should contain
A every line of source code Does not fit this requirement.
B enough information to determine future transitions The state summarises relevant history.
C only the final answer Does not fit this requirement.
D a random heuristic Does not fit this requirement.

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

18 A tree with n vertices has exactly
A \(n+1\) edges Does not fit this requirement.
B \(2n\) edges Does not fit this requirement.
C n edges Does not fit this requirement.
D \(n-1\) edges A connected acyclic graph has \(n-1\) edges.

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

19 A school system must test quickly whether a username has already been used. Which ADT is most suitable?
A stack Does not fit this requirement.
B queue Does not fit this requirement.
C priority queue Does not fit this requirement.
D set A set models unique membership.

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

20 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

Run it again