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

02 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

03 Which term must be true when a correct algorithm terminates?
A recurrence Does not fit this requirement.
B precondition Does not fit this requirement.
C counterexample Does not fit this requirement.
D postcondition This describes a postcondition.

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

04 A max-priority queue removes the numerically highest priority first. Which job is removed?
A Job A (priority 21) A higher-priority job is present.
B Job B (priority 19) A higher-priority job is present.
C Job C (priority 22) This has the highest priority.
D Job D (priority 12) A higher-priority job is present.

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

05 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

06 Ignoring constant factors, approximately how many primitive operations does an \(O(n)\) algorithm perform when n = 1,000,000?
A about 1 billion Does not fit this requirement.
B about 1 trillion Does not fit this requirement.
C about 1 million Substitute n into the stated growth function.
D about 30 Does not fit this requirement.

Written for icaijy.com · U4 AOS1 · Practical complexity · answered at 100 ms

07 Assume constant-time primitive operations. What is the tightest Big-O bound for: Three nested loops each run from 1 to n.
A \(O(n^3)\) The iteration counts multiply.
B \(O(n)\) Does not fit this requirement.
C \(O(n^2)\) Does not fit this requirement.
D \(O(3n)\) Does not fit this requirement.

Written for icaijy.com · U4 AOS1 · Time complexity · answered at 100 ms

08 Which signature best specifies the enqueue operation?
A item → queue Does not fit this requirement.
B queue → item Does not fit this requirement.
C queue × item → queue Enqueue adds an item to a queue.
D queue → queue × item Does not fit this requirement.

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

09 Assume constant-time primitive operations. What is the tightest Big-O bound for: For i from 1 to n: For j from 1 to 67: constantWork()
A \(O(n^2)\) Does not fit this requirement.
B \(O(n)\) 67 is a constant independent of n.
C \(O(1)\) Does not fit this requirement.
D \(O(n \log n)\) Does not fit this requirement.

Written for icaijy.com · U4 AOS1 · Time complexity · answered at 100 ms

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

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

11 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

12 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

13 The Halting Problem asks whether
A a program eventually stops on a given input The accepted statement is: a program eventually stops on a given input.
B a graph is connected Does not fit this requirement.
C a model is unbiased Does not fit this requirement.
D two arrays have equal length Does not fit this requirement.

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

14 Assume constant-time primitive operations. What is the tightest Big-O bound for: i ← 1; While i < n: i ← 2i
A \(O(n)\) Does not fit this requirement.
B \(O(\log n)\) Repeated doubling reaches n after \(\log_2 n\) steps.
C \(O(n^2)\) Does not fit this requirement.
D \(O(2^n)\) Does not fit this requirement.

Written for icaijy.com · U4 AOS1 · Time complexity · answered at 100 ms

15 Which design pattern or algorithm stores solutions of overlapping subproblems to avoid recomputation?
A simulated annealing Does not fit this requirement.
B greedy Does not fit this requirement.
C divide and conquer Does not fit this requirement.
D dynamic programming This is the defining behaviour of dynamic programming.

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

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

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

17 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

18 Improve a timetable by repeatedly accepting only a better neighbouring timetable. Choose the best algorithmic description.
A dynamic programming Does not fit this requirement.
B hill climbing hill climbing best matches the input and goal.
C breadth-first search Does not fit this requirement.
D binary search Does not fit this requirement.

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

19 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

20 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

Run it again