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

01 Which term best matches a system that makes predictions by following feature-based branches?

A decision tree This describes decision tree.

B neural network Does not fit this requirement.

C support vector machine Does not fit this requirement.

D Turing machine Does not fit this requirement.

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

02 Which design pattern or algorithm commits to the locally best available choice at each step?

A divide and conquer Does not fit this requirement.

B dynamic programming Does not fit this requirement.

C backtracking Does not fit this requirement.

D greedy This is the defining behaviour of greedy.

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

03 A council must connect all suburbs while minimising total new cable. Which concept best matches this situation?

A Dijkstra’s algorithm Does not fit this requirement.

B Bellman–Ford algorithm Does not fit this requirement.

C Floyd–Warshall algorithm Does not fit this requirement.

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

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

04 A school system must test quickly whether a username has already been used. Which ADT is most suitable?

A stack Does not fit this requirement.

B queue Does not fit this requirement.

C priority queue Does not fit this requirement.

D set A set models unique membership.

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

05 Which design pattern is most clearly used by the standard earliest-finish-time interval scheduler?

A dynamic programming Does not fit this requirement.

B divide and conquer Does not fit this requirement.

C brute-force search Does not fit this requirement.

D greedy The standard earliest-finish-time interval scheduler uses greedy.

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

06 A transport app must represent cities and the roads joining them. Which ADT is most suitable?

A graph A graph models entities and relationships.

B stack Does not fit this requirement.

C dictionary Does not fit this requirement.

D set Does not fit this requirement.

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

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

A 8 The midpoint trace reaches 127 after 8 inspection(s).

B 2 Does not fit this requirement.

C 6 Does not fit this requirement.

D 5 Does not fit this requirement.

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

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

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

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

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

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

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

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

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

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

C Node C: g = 9, h = 1, f = 10 f = 10; this is minimal.

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

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

10 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

11 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

12 Which design pattern or algorithm systematically examines every candidate solution?

A divide and conquer Does not fit this requirement.

B brute-force search This is the defining behaviour of brute-force search.

C dynamic programming Does not fit this requirement.

D greedy Does not fit this requirement.

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

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

A 4 Does not fit this requirement.

B 3 Does not fit this requirement.

C 5 Does not fit this requirement.

D 6 The midpoint trace reaches 31 after 6 inspection(s).

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

14 A campus planner needs shortest walking distances between every pair of buildings. Select the best model or method.

A Bellman–Ford algorithm Does not fit this requirement.

B PageRank Does not fit this requirement.

C Floyd–Warshall algorithm Floyd–Warshall algorithm directly matches the stated requirement.

D Prim's algorithm Does not fit this requirement.

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

15 A useful dynamic-programming state should contain

A every line of source code Does not fit this requirement.

B enough information to determine future transitions The state summarises relevant history.

C only the final answer Does not fit this requirement.

D a random heuristic Does not fit this requirement.

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

16 A fare graph includes rebates represented by negative edges and has no negative cycle. Select the best model or method.

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

B Dijkstra’s algorithm Does not fit this requirement.

C Floyd–Warshall algorithm Does not fit this requirement.

D PageRank Does not fit this requirement.

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

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

A \(O(n^2)\) There are n × n iterations.

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

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

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

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

18 Which design pattern is most clearly used by a recursive maze solver that reverses choices at dead ends?

A backtracking A recursive maze solver that reverses choices at dead ends uses backtracking.

B brute-force search Does not fit this requirement.

C divide and conquer Does not fit this requirement.

D greedy Does not fit this requirement.

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

19 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

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

A about 20 million Substitute n into the stated growth function.

B about 1 quadrillion Does not fit this requirement.

C about 1 thousand Does not fit this requirement.

D about 1 million Does not fit this requirement.

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