That y8 kid 🤣 - bot · guest
11 Sep 2026, 9:30 p.m.
01 How many edges are in an undirected complete graph with 17 vertices?
Written for icaijy.com · U3 AOS1 · Graph modelling · answered at 100 ms
02 Binary search uses \(\lfloor(low+high)/2\rfloor\) on the sorted integers 1…31. How many values are inspected when searching for 1?
Written for icaijy.com · U4 AOS2 · Binary search · answered at 100 ms
03 Using the usual inclusive low/high implementation, at most how many element inspections can an unsuccessful binary search of 4096 sorted items require?
Written for icaijy.com · U4 AOS2 · Binary search · answered at 100 ms
04 In a directed graph, an edge from u to v
Written for icaijy.com · U3 AOS1 · Graphs · answered at 100 ms
05 Which class is best described as problems at least as hard as every problem in NP, without a requirement that they be in NP?
Written for icaijy.com · U4 AOS1 · P, NP and reductions · answered at 100 ms
06 A system groups articles without any supplied category labels. Select the best model or method.
Written for icaijy.com · Applied · data-driven algorithms · 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 191?
Written for icaijy.com · U4 AOS2 · Binary search · answered at 100 ms
08 A campus planner needs shortest walking distances between every pair of buildings. Which concept best matches this situation?
Written for icaijy.com · Applied · graph algorithms · answered at 100 ms
09 A route finder combines distance travelled with estimated distance remaining. Which concept best matches this situation?
Written for icaijy.com · Applied · advanced design · answered at 100 ms
10 An organisation names who is responsible for harms caused by its model. What is the most relevant issue?
Written for icaijy.com · U4 AOS3 · AI ethics · answered at 100 ms
11 A max-priority queue removes the numerically highest priority first. Which job is removed?
Written for icaijy.com · U3 AOS1 · Priority queues · answered at 100 ms
12 Assume constant-time primitive operations. What is the tightest Big-O bound for: While n > 0: n ← n − 2
Written for icaijy.com · U4 AOS1 · Time complexity · answered at 100 ms
13 How many edges are in an undirected complete graph with 9 vertices?
Written for icaijy.com · U3 AOS1 · Graph modelling · answered at 100 ms
14 Which class is best described as decision problems whose yes-instances have polynomial-time verifiable certificates?
Written for icaijy.com · U4 AOS1 · P, NP and reductions · answered at 100 ms
15 A school system must look up a student record using a student ID. Which ADT is most suitable?
Written for icaijy.com · U3 AOS1 · ADTs · answered at 100 ms
16 Which design pattern or algorithm abandons a partial candidate as soon as it cannot lead to a valid solution?
Written for icaijy.com · U3/U4 · Algorithm design patterns · answered at 100 ms
17 If one NP-Complete problem is shown to have a polynomial-time algorithm, then
Written for icaijy.com · U4 AOS1 · Complexity limits · answered at 100 ms
18 A bank provides understandable reasons for an automated rejection. Select the best model or method.
Written for icaijy.com · Applied · AI ethics · answered at 100 ms
19 Ignoring constant factors, approximately how many primitive operations does an \(O(\log_2 n)\) algorithm perform when n = 1,000,000,000?
Written for icaijy.com · U4 AOS1 · Practical complexity · answered at 100 ms
20 For sufficiently large n, which grows more slowly than \(O(n^3)\)?
Written for icaijy.com · U4 AOS1 · Growth rates · answered at 100 ms