That y8 kid 🤣 - bot · guest · Algorithmics (HESS)

01 For a decision version of travelling salesperson, a natural certificate is

A an unsorted list of edge weights Does not fit this requirement.

B a proposed tour whose length can be checked A proposed tour can be verified in polynomial time.

C a proof that P ≠ NP Does not fit this requirement.

D the source code of every algorithm Does not fit this requirement.

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

02 Binary search uses \(\lfloor(low+high)/2\rfloor\) on the sorted integers 1…255. How many values are inspected when searching for 63?

A 8 The midpoint trace reaches 63 after 8 inspection(s).

B 1 Does not fit this requirement.

C 4 Does not fit this requirement.

D 2 Does not fit this requirement.

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

03 For sufficiently large n, which grows more slowly than \(O(n^2)\)?

A \(O(n \log n)\) \(O(n \log n)\) has the lower asymptotic growth rate.

B \(O(2^n)\) Does not fit this requirement.

C \(O(n^2)\) 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

04 A* uses f(n) = g(n) + h(n). Which frontier node should it expand next?

A Node A: g = 2, h = 10, f = 12 f = 12; another node has a smaller f.

B Node B: g = 6, h = 5, f = 11 f = 11; another node has a smaller f.

C Node C: g = 9, h = 1, f = 10 f = 10; this is minimal.

D Node D: g = 4, h = 8, f = 12 f = 12; another node has a smaller f.

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

05 Using the usual inclusive low/high implementation, at most how many element inspections can an unsuccessful binary search of 64 sorted items require?

A 6 Does not fit this requirement.

B 8 Does not fit this requirement.

C 64 Does not fit this requirement.

D 7 An unsuccessful search may inspect floor(log₂(64)) + 1 = 7 elements.

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

06 Binary search uses \(\lfloor(low+high)/2\rfloor\) on the sorted integers 1…63. How many values are inspected when searching for 63?

A 4 Does not fit this requirement.

B 6 The midpoint trace reaches 63 after 6 inspection(s).

C 8 Does not fit this requirement.

D 1 Does not fit this requirement.

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

07 Explore one branch deeply before returning to alternatives. Which algorithm is most fit for purpose?

A PageRank Does not fit this requirement.

B Dijkstra’s algorithm Does not fit this requirement.

C depth-first search DFS follows a branch before backtracking.

D breadth-first search Does not fit this requirement.

Written for icaijy.com · U3 AOS2 · Graph algorithms · answered at 100 ms

08 Using the usual inclusive low/high implementation, at most how many element inspections can an unsuccessful binary search of 1024 sorted items require?

A 1024 Does not fit this requirement.

B 10 Does not fit this requirement.

C 12 Does not fit this requirement.

D 11 An unsuccessful search may inspect floor(log₂(1024)) + 1 = 11 elements.

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

09 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

10 Which concept is illustrated? A system is designed to perform a specific apparently intelligent task.

A weak AI This is the standard description of weak AI.

B NP-Completeness Does not fit this requirement.

C undecidability Does not fit this requirement.

D strong AI Does not fit this requirement.

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

11 Which design pattern or algorithm repeatedly moves to a neighbouring state with a better heuristic value?

A divide and conquer Does not fit this requirement.

B dynamic programming Does not fit this requirement.

C breadth-first search Does not fit this requirement.

D hill climbing This is the defining behaviour of hill climbing.

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

12 Estimate a web page’s importance from links made by other pages. Which algorithm is most fit for purpose?

A PageRank PageRank estimates importance from incoming links.

B Prim's algorithm Does not fit this requirement.

C binary search Does not fit this requirement.

D Floyd–Warshall algorithm Does not fit this requirement.

Written for icaijy.com · U3 AOS2 · Graph algorithms · answered at 100 ms

13 A browser must return through previously visited pages in reverse order. Which tool is most fit for purpose?

A set Does not fit this requirement.

B stack stack directly matches the stated requirement.

C queue Does not fit this requirement.

D priority queue Does not fit this requirement.

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

14 A school system must represent cities and the roads joining them. Which ADT is most suitable?

A stack Does not fit this requirement.

B graph A graph models entities and relationships.

C dictionary Does not fit this requirement.

D set Does not fit this requirement.

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

15 A human accepts a model output despite strong contradictory evidence. What is the most relevant issue?

A an invariant Does not fit this requirement.

B automation bias The scenario directly illustrates automation bias.

C divide and conquer Does not fit this requirement.

D space complexity Does not fit this requirement.

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

16 Which design pattern or algorithm sometimes accepts a worse move according to a temperature parameter?

A binary search Does not fit this requirement.

B backtracking Does not fit this requirement.

C hill climbing Does not fit this requirement.

D simulated annealing This is the defining behaviour of simulated annealing.

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

17 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

18 A max-priority queue removes the numerically highest priority first. Which job is removed?

A Job A (priority 2) A higher-priority job is present.

B Job B (priority 9) This has the highest priority.

C Job C (priority 5) A higher-priority job is present.

D Job D (priority 7) A higher-priority job is present.

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

19 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

20 Patients must be treated according to changing urgency scores. Which concept best matches this situation?

A priority queue priority queue directly matches the stated requirement.

B queue Does not fit this requirement.

C stack Does not fit this requirement.

D set Does not fit this requirement.

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