Back to speedrun
RUN REVIEW · Algorithmics (HESS) · Units 3 & 4

That y8 kid 🤣 - bot · guest

11 Sep 2026, 9:29 p.m.

20Serious score
01 A transport app must access the 18th temperature reading directly. Which ADT is most suitable?
A queue Does not fit this requirement.
B array An array supports access by numeric index.
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 An organisation names who is responsible for harms caused by its model. What is the most relevant issue?
A memoisation Does not fit this requirement.
B anonymity Does not fit this requirement.
C overfitting Does not fit this requirement.
D accountability The scenario directly illustrates accountability.

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

03 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

04 Which class is best described as problems that are both in NP and NP-Hard?
A NP-Complete That is the definition of NP-Complete.
B exponential Does not fit this requirement.
C P Does not fit this requirement.
D NP Does not fit this requirement.

Written for icaijy.com · U4 AOS1 · P, NP and reductions · 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 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

07 A face-recognition model works poorly for a group scarcely represented in its training set. What is the most relevant issue?
A guaranteed neutrality Does not fit this requirement.
B a faster runtime Does not fit this requirement.
C a proof of correctness Does not fit this requirement.
D bias from unrepresentative data The scenario directly illustrates bias from unrepresentative data.

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

08 A max-priority queue removes the numerically highest priority first. Which job is removed?
A Job A (priority 25) This has the highest priority.
B Job B (priority 23) A higher-priority job is present.
C Job C (priority 9) A higher-priority job is present.
D Job D (priority 24) A higher-priority job is present.

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

09 Ignoring constant factors, approximately how many primitive operations does an \(O(n^3)\) algorithm perform when n = 1,000?
A about 1 quadrillion Does not fit this requirement.
B about 1 billion Substitute n into the stated growth function.
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

10 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

11 Which design pattern is most clearly used by binary search?
A brute-force search Does not fit this requirement.
B dynamic programming Does not fit this requirement.
C divide and conquer Binary search uses divide and conquer.
D greedy Does not fit this requirement.

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

12 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

13 Which class is best described as decision problems whose yes-instances have polynomial-time verifiable certificates?
A NP-Hard only Does not fit this requirement.
B P only Does not fit this requirement.
C undecidable Does not fit this requirement.
D NP That is the definition of NP.

Written for icaijy.com · U4 AOS1 · P, NP and reductions · answered at 100 ms

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

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

15 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

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

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

17 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

18 Training records reveal identifiable medical information. What is the most relevant issue?
A time complexity Does not fit this requirement.
B privacy risk The scenario directly illustrates privacy risk.
C minimum spanning tree Does not fit this requirement.
D termination proof Does not fit this requirement.

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

19 A form must reject an ID if it is already present. Which concept best matches this situation?
A dictionary Does not fit this requirement.
B priority queue Does not fit this requirement.
C stack Does not fit this requirement.
D set set directly matches the stated requirement.

Written for icaijy.com · Applied · 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 512 sorted items require?
A 11 Does not fit this requirement.
B 10 An unsuccessful search may inspect floor(log₂(512)) + 1 = 10 elements.
C 512 Does not fit this requirement.
D 9 Does not fit this requirement.

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

Run it again