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

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

A 5 The midpoint trace reaches 15 after 5 inspection(s).

B 3 Does not fit this requirement.

C 9 Does not fit this requirement.

D 8 Does not fit this requirement.

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

02 Which term is a single valid input that disproves a universal correctness claim?

A base case Does not fit this requirement.

B benchmark Does not fit this requirement.

C postcondition Does not fit this requirement.

D counterexample This describes a counterexample.

Written for icaijy.com · U3 AOS2 · Correctness and modularity · answered at 100 ms

03 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

04 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

05 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 100 ms

06 How many edges are in an undirected complete graph with 15 vertices?

A 105 There is one edge for each unordered pair: 15×14/2 = 105.

B 210 Does not fit this requirement.

C 14 Does not fit this requirement.

D 225 Does not fit this requirement.

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

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

A Job A (priority 20) This has the highest priority.

B Job B (priority 16) A higher-priority job is present.

C Job C (priority 18) 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

08 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

09 In a weighted graph, a weight is usually attached to

A an edge or vertex to represent a quantity Weights encode cost, distance or another quantity.

B only isolated vertices Does not fit this requirement.

C the drawing scale Does not fit this requirement.

D the graph title Does not fit this requirement.

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

10 Improve a timetable by repeatedly accepting only a better neighbouring timetable. Which approach is most suitable?

A dynamic programming Does not fit this requirement.

B breadth-first search Does not fit this requirement.

C binary search Does not fit this requirement.

D hill climbing hill climbing best matches the input and goal.

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

11 A loan applicant is told what major factors affected an automated decision. What is the most relevant issue?

A recursion Does not fit this requirement.

B transparency The scenario directly illustrates transparency.

C graph connectivity Does not fit this requirement.

D data compression Does not fit this requirement.

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

12 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 100 ms

13 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

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

A about 1 billion Does not fit this requirement.

B about 1 trillion Does not fit this requirement.

C about 1 million Substitute n into the stated growth function.

D about 30 Does not fit this requirement.

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

15 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

16 A basic hill-climbing search may stop before the global optimum because of

A the Master Theorem Does not fit this requirement.

B a local optimum No improving neighbour may exist at a non-global optimum.

C a guaranteed negative cycle Does not fit this requirement.

D a queue overflow by definition Does not fit this requirement.

Written for icaijy.com · U4 AOS2 · Advanced design · answered at 100 ms

17 A route finder combines distance travelled with estimated distance remaining. Which tool is most fit for purpose?

A backtracking Does not fit this requirement.

B hill climbing Does not fit this requirement.

C simulated annealing Does not fit this requirement.

D A* A* directly matches the stated requirement.

Written for icaijy.com · Applied · advanced design · answered at 100 ms

18 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

19 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

20 A classifier learns from emails already labelled spam or not spam. Select the best model or method.

A unsupervised learning Does not fit this requirement.

B binary search Does not fit this requirement.

C PageRank Does not fit this requirement.

D supervised learning supervised learning directly matches the stated requirement.

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