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

01 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

02 Find a path using the fewest edges in an unweighted graph. Which algorithm is most fit for purpose?

A PageRank Does not fit this requirement.

B breadth-first search BFS explores vertices in increasing edge distance.

C Prim's algorithm Does not fit this requirement.

D depth-first search Does not fit this requirement.

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

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

A Node A: g = 3, h = 7, f = 10 f = 10; this is minimal.

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

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

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

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

04 Which design pattern or algorithm stores solutions of overlapping subproblems to avoid recomputation?

A simulated annealing Does not fit this requirement.

B greedy Does not fit this requirement.

C divide and conquer Does not fit this requirement.

D dynamic programming This is the defining behaviour of dynamic programming.

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

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

A 3 Does not fit this requirement.

B 8 Does not fit this requirement.

C 7 The midpoint trace reaches 127 after 7 inspection(s).

D 4 Does not fit this requirement.

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

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

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

B Node B: g = 8, h = 4, f = 12 f = 12; this is minimal.

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

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

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

07 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

08 A research program must always process the waiting job with the highest urgency. Which ADT is most suitable?

A set Does not fit this requirement.

B priority queue A priority queue removes the highest-priority item.

C queue Does not fit this requirement.

D stack Does not fit this requirement.

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

09 Use the supplied Master Theorem. What is T(n) if \(T(n)=2T(n/4)+O(n^1)\)?

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

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

C \(O(\log n)\) Does not fit this requirement.

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

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

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

A 2 Does not fit this requirement.

B 6 Does not fit this requirement.

C 5 Does not fit this requirement.

D 8 The midpoint trace reaches 1 after 8 inspection(s).

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

11 A council must connect all suburbs while minimising total new cable. Which tool is most fit for purpose?

A Floyd–Warshall algorithm Does not fit this requirement.

B PageRank Does not fit this requirement.

C Prim's algorithm Prim's algorithm directly matches the stated requirement.

D Bellman–Ford algorithm Does not fit this requirement.

Written for icaijy.com · Applied · graph algorithms · answered at 100 ms

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

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

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

C Node C: g = 9, h = 3, f = 12 f = 12; this is minimal.

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

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

13 A school system must store a sequence while preserving duplicates and order. Which ADT is most suitable?

A set Does not fit this requirement.

B priority queue Does not fit this requirement.

C list A list preserves sequence and permits repeated values.

D stack Does not fit this requirement.

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

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

A 6 The midpoint trace reaches 1 after 6 inspection(s).

B 1 Does not fit this requirement.

C 2 Does not fit this requirement.

D 8 Does not fit this requirement.

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

15 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

16 Which term best matches a system that seeks structure in unlabelled data?

A unsupervised learning This describes unsupervised learning.

B supervised learning Does not fit this requirement.

C backtracking Does not fit this requirement.

D formal verification Does not fit this requirement.

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

17 Assume constant-time primitive operations. What is the tightest Big-O bound for: Three nested loops each run from 1 to n.

A \(O(n^3)\) The iteration counts multiply.

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

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

D \(O(3n)\) Does not fit this requirement.

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

18 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

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