icaijy · Algorithmics (HESS)

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

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

B 3 Does not fit this requirement.

C 6 Does not fit this requirement.

D 7 Does not fit this requirement.

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

02 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 7893 ms

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

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

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

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

D \(O(n^3)\) Compare \(a=8\) with \(b^c=4\).

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

04 Which signature best specifies the front operation?

A queue × item → queue Does not fit this requirement.

B queue → queue × item Does not fit this requirement.

C queue → item Front observes the next item without adding one.

D item → queue Does not fit this requirement.

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

05 A transport app must always process the waiting job with the highest urgency. Which ADT is most suitable?

A stack Does not fit this requirement.

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

C queue Does not fit this requirement.

D set Does not fit this requirement.

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

06 An undecidable problem represents

A a poor choice of data structure Does not fit this requirement.

B a hard limit of computability The accepted statement is: a hard limit of computability.

C a constant-factor slowdown Does not fit this requirement.

D an average-case analysis Does not fit this requirement.

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

07 Ignoring constant factors, approximately how many primitive operations does an \(O(\log_2 n)\) algorithm perform when n = 1,000,000,000?

A about 1 million Does not fit this requirement.

B about 1 thousand Does not fit this requirement.

C about 1 billion Does not fit this requirement.

D about 30 Substitute n into the stated growth function.

Written for icaijy.com · U4 AOS1 · Practical complexity · answered at 42110 ms

08 Past biased policing data directs more patrols to the same areas, generating more similar data. What is the most relevant issue?

A a harmful feedback loop The scenario directly illustrates a harmful feedback loop.

B a balanced dataset Does not fit this requirement.

C binary search Does not fit this requirement.

D formal verification Does not fit this requirement.

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

09 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 55126 ms

10 A school system must always process the waiting job with the highest urgency. Which ADT is most suitable?

A stack Does not fit this requirement.

B set Does not fit this requirement.

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

D queue Does not fit this requirement.

Written for icaijy.com · U3 AOS1 · ADTs · answered at 58499 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 59952 ms