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

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

A 4096 Does not fit this requirement.

B 13 An unsuccessful search may inspect floor(log₂(4096)) + 1 = 13 elements.

C 12 Does not fit this requirement.

D 14 Does not fit this requirement.

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

02 A fare graph includes rebates represented by negative edges and has no negative cycle. Which concept best matches this situation?

A PageRank Does not fit this requirement.

B Floyd–Warshall algorithm Does not fit this requirement.

C Prim's algorithm Does not fit this requirement.

D Bellman–Ford algorithm Bellman–Ford algorithm directly matches the stated requirement.

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

03 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

04 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

05 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

06 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

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

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

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

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

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

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

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

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

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

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

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

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

09 How many edges are in an undirected complete graph with 6 vertices?

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

B 5 Does not fit this requirement.

C 30 Does not fit this requirement.

D 36 Does not fit this requirement.

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

10 Which term best matches a system that uses a trained model to produce an output for new data?

A recursion Does not fit this requirement.

B annotation Does not fit this requirement.

C training Does not fit this requirement.

D inference This describes inference.

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

11 How many edges are in an undirected complete graph with 13 vertices?

A 12 Does not fit this requirement.

B 156 Does not fit this requirement.

C 169 Does not fit this requirement.

D 78 There is one edge for each unordered pair: 13×12/2 = 78.

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

12 Which concept is illustrated? A person follows symbol rules without understanding the language.

A Turing Test Does not fit this requirement.

B Master Theorem Does not fit this requirement.

C Chinese Room argument This is the standard description of Chinese Room argument.

D PageRank Does not fit this requirement.

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

13 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

14 Which term must be true when a correct algorithm terminates?

A recurrence Does not fit this requirement.

B precondition Does not fit this requirement.

C counterexample Does not fit this requirement.

D postcondition This describes a postcondition.

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

15 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

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

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

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

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

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

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

17 How many edges are in an undirected complete graph with 4 vertices?

A 16 Does not fit this requirement.

B 6 There is one edge for each unordered pair: 4×3/2 = 6.

C 12 Does not fit this requirement.

D 3 Does not fit this requirement.

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

18 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

19 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

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

A 4 Does not fit this requirement.

B 3 Does not fit this requirement.

C 5 The midpoint trace reaches 23 after 5 inspection(s).

D 6 Does not fit this requirement.

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