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

01 A bank provides understandable reasons for an automated rejection. Which tool is most fit for purpose?

A privacy Does not fit this requirement.

B transparency transparency directly matches the stated requirement.

C bias Does not fit this requirement.

D time complexity Does not fit this requirement.

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

02 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

03 Assume constant-time primitive operations. What is the tightest Big-O bound for: For i from 1 to n: work(); For j from 1 to n: work()

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

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

C \(O(n)\) Sequential linear loops add, not multiply.

D \(O(1)\) Does not fit this requirement.

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

04 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

05 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

06 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

07 Use the supplied Master Theorem. What is T(n) if \(T(n)=1T(n/3)+O(n^0)\)?

A \(O(n)\) Does not fit this requirement.

B \(O(\log n)\) Compare \(a=1\) with \(b^c=1\).

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

08 Which signature best specifies the lookup operation?

A key → dictionary Does not fit this requirement.

B dictionary × key → value Lookup maps a supplied key to its value.

C dictionary → key × value Does not fit this requirement.

D dictionary × value → key Does not fit this requirement.

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

09 Which term best matches a system that performs very well on training examples but poorly on new examples?

A overfitting This describes overfitting.

B underflow Does not fit this requirement.

C abstraction Does not fit this requirement.

D backtracking Does not fit this requirement.

Written for icaijy.com · U4 AOS3 · Data-driven algorithms · answered at 100 ms

10 One lookup in an unsorted list of five items. Which approach is most suitable?

A PageRank Does not fit this requirement.

B Prim's algorithm Does not fit this requirement.

C linear search linear search best matches the input and goal.

D Floyd–Warshall Does not fit this requirement.

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

11 A tree with n vertices has exactly

A \(n+1\) edges Does not fit this requirement.

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

C n edges Does not fit this requirement.

D \(n-1\) edges A connected acyclic graph has \(n-1\) edges.

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

12 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

13 A classifier learns from emails already labelled spam or not spam. Which tool is most fit for purpose?

A PageRank Does not fit this requirement.

B backtracking Does not fit this requirement.

C supervised learning supervised learning directly matches the stated requirement.

D binary search Does not fit this requirement.

Written for icaijy.com · Applied · data-driven algorithms · answered at 100 ms

14 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

15 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

16 Which term best matches a system that separates classes using a maximum-margin boundary?

A simulated annealing Does not fit this requirement.

B queue Does not fit this requirement.

C support vector machine This describes support vector machine.

D decision tree Does not fit this requirement.

Written for icaijy.com · U4 AOS3 · Data-driven algorithms · answered at 100 ms

17 The general Halting Problem is

A linear time Does not fit this requirement.

B undecidable The accepted statement is: undecidable.

C NP-Complete Does not fit this requirement.

D solved by binary search Does not fit this requirement.

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

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

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

B Node B: g = 3, h = 5, f = 8 f = 8; this is minimal.

C Node C: g = 4, h = 6, f = 10 f = 10; another node has a smaller f.

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

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

19 Use the supplied Master Theorem. What is T(n) if \(T(n)=9T(n/3)+O(n^1)\)?

A \(O(n^2)\) Compare \(a=9\) with \(b^c=3\).

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

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

A Node A: g = 3, h = 15, f = 18 f = 18; another node has a smaller f.

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

C Node C: g = 10, h = 2, f = 12 f = 12; this is minimal.

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

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