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

02 A transport app 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

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

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

04 Use the supplied Master Theorem. What is T(n) if \(T(n)=4T(n/2)+O(n^1)\)?
A \(O(\log n)\) Does not fit this requirement.
B \(O(n^2)\) Compare \(a=4\) with \(b^c=2\).
C \(O(n)\) Does not fit this requirement.
D \(O(n^3)\) Does not fit this requirement.

Written for icaijy.com · U4 AOS1 · Recurrence relations · answered at 100 ms

05 Use the supplied Master Theorem. What is T(n) if \(T(n)=16T(n/4)+O(n^2)\)?
A \(O(n^2 \log n)\) Compare \(a=16\) with \(b^c=16\).
B \(O(n \log n)\) Does not fit this requirement.
C \(O(\log n)\) Does not fit this requirement.
D \(O(n)\) Does not fit this requirement.

Written for icaijy.com · U4 AOS1 · Recurrence relations · answered at 100 ms

06 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

07 A transport app must always process the waiting job with the highest urgency. Which ADT is most suitable?
A stack Does not fit this requirement.
B priority queue A priority queue removes the highest-priority item.
C queue Does not fit this requirement.
D set Does not fit this requirement.

Written for icaijy.com · U3 AOS1 · ADTs · 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 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

10 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

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

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

12 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

13 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

14 Optimise a timetable while occasionally accepting worse moves early in the search. Choose the best algorithmic description.
A Floyd–Warshall Does not fit this requirement.
B binary search Does not fit this requirement.
C simulated annealing simulated annealing best matches the input and goal.
D hill climbing Does not fit this requirement.

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

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

16 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

17 If one NP-Complete problem is shown to have a polynomial-time algorithm, then
A only that problem enters P Does not fit this requirement.
B P ≠ NP Does not fit this requirement.
C P = NP Every NP problem reduces to that NP-Complete problem.
D all NP-Hard problems become decidable Does not fit this requirement.

Written for icaijy.com · U4 AOS1 · Complexity limits · answered at 100 ms

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

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

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

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

20 Which term remains true before and after every loop iteration?
A input size Does not fit this requirement.
B postcondition Does not fit this requirement.
C loop invariant This describes a loop invariant.
D base case Does not fit this requirement.

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

Run it again