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 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

02 For sufficiently large n, which grows more slowly than \(O(n \log n)\)?
A \(O(2^n)\) Does not fit this requirement.
B \(O(n)\) \(O(n)\) has the lower asymptotic growth rate.
C \(O(n \log n)\) Does not fit this requirement.
D \(O(n!)\) Does not fit this requirement.

Written for icaijy.com · U4 AOS1 · Growth rates · answered at 100 ms

03 A fare graph includes rebates represented by negative edges and has no negative cycle. Which tool is most fit for purpose?
A Prim's algorithm Does not fit this requirement.
B Bellman–Ford algorithm Bellman–Ford algorithm directly matches the stated requirement.
C Dijkstra’s algorithm Does not fit this requirement.
D PageRank Does not fit this requirement.

Written for icaijy.com · Applied · graph algorithms · answered at 100 ms

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

05 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

06 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

07 A max-priority queue removes the numerically highest priority first. Which job is removed?
A Job A (priority 7) A higher-priority job is present.
B Job B (priority 14) This has the highest priority.
C Job C (priority 11) A higher-priority job is present.
D Job D (priority 13) A higher-priority job is present.

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

08 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

09 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

10 Find shortest distances between every pair of vertices. Which algorithm is most fit for purpose?
A depth-first search Does not fit this requirement.
B Bellman–Ford algorithm Does not fit this requirement.
C Floyd–Warshall algorithm Floyd–Warshall solves all-pairs shortest paths.
D Prim's algorithm Does not fit this requirement.

Written for icaijy.com · U3 AOS2 · Graph algorithms · answered at 100 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 100 ms

12 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

13 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

14 A form must reject an ID if it is already present. Which tool is most fit for purpose?
A dictionary Does not fit this requirement.
B stack Does not fit this requirement.
C priority queue Does not fit this requirement.
D set set directly matches the stated requirement.

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

15 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

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

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

17 Which term best matches a system that learns from examples paired with desired outputs?
A supervised learning This describes supervised learning.
B unsupervised learning Does not fit this requirement.
C binary search Does not fit this requirement.
D PageRank Does not fit this requirement.

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

18 Which design pattern or algorithm splits a problem into independent smaller instances and combines their answers?
A greedy Does not fit this requirement.
B hill climbing Does not fit this requirement.
C divide and conquer This is the defining behaviour of divide and conquer.
D brute-force search Does not fit this requirement.

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

19 A campus planner needs shortest walking distances between every pair of buildings. Which concept best matches this situation?
A Bellman–Ford algorithm Does not fit this requirement.
B PageRank Does not fit this requirement.
C Prim's algorithm Does not fit this requirement.
D Floyd–Warshall algorithm Floyd–Warshall algorithm directly matches the stated requirement.

Written for icaijy.com · Applied · graph algorithms · answered at 100 ms

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

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

Run it again