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

03 An exponential-time algorithm on large inputs illustrates

A an undecidable problem Does not fit this requirement.

B a soft limit of computability The problem is computable but may be impractical.

C a syntax error Does not fit this requirement.

D a violation of Church–Turing Does not fit this requirement.

Written for icaijy.com · U4 AOS1 · Complexity limits · 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 = 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

05 Personal messages are used as training data without users being informed. What is the most relevant issue?

A a complete graph Does not fit this requirement.

B dynamic programming Does not fit this requirement.

C lack of informed consent The scenario directly illustrates lack of informed consent.

D a polynomial reduction Does not fit this requirement.

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

06 Lambda calculus is important in computability because it

A proves all algorithms efficient Does not fit this requirement.

B provides a model of computation equivalent in power to Turing machines The accepted statement is: provides a model of computation equivalent in power to Turing machines.

C requires machine learning Does not fit this requirement.

D sorts only numeric arrays Does not fit this requirement.

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

07 Which term best matches a system that separates classes using a maximum-margin boundary?

A simulated annealing Does not fit this requirement.

B queue Does not fit this requirement.

C support vector machine This describes support vector machine.

D decision tree Does not fit this requirement.

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

08 A research program must test quickly whether a username has already been used. Which ADT is most suitable?

A priority queue Does not fit this requirement.

B stack Does not fit this requirement.

C queue Does not fit this requirement.

D set A set models unique membership.

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

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

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

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

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

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

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

10 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

11 One lookup in an unsorted list of five items. Which approach is most suitable?

A PageRank Does not fit this requirement.

B Prim's algorithm Does not fit this requirement.

C linear search linear search best matches the input and goal.

D Floyd–Warshall Does not fit this requirement.

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

12 A campus planner needs shortest walking distances between every pair of buildings. Which tool is most fit for purpose?

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

B Prim's algorithm Does not fit this requirement.

C Dijkstra’s algorithm Does not fit this requirement.

D Bellman–Ford algorithm Does not fit this requirement.

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

13 Many membership queries on a large sorted array. Which approach is most suitable?

A linear search Does not fit this requirement.

B depth-first search Does not fit this requirement.

C hill climbing Does not fit this requirement.

D binary search binary search best matches the input and goal.

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

14 A route finder combines distance travelled with estimated distance remaining. Which concept best matches this situation?

A A* A* directly matches the stated requirement.

B simulated annealing Does not fit this requirement.

C dynamic programming Does not fit this requirement.

D hill climbing Does not fit this requirement.

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

15 A school system must represent cities and the roads joining them. Which ADT is most suitable?

A stack Does not fit this requirement.

B graph A graph models entities and relationships.

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

16 A subgraph may contain

A edges absent from the original graph Does not fit this requirement.

B new vertices only Does not fit this requirement.

C every original edge only Does not fit this requirement.

D subsets of the original vertices and edges A subgraph uses only original vertices and edges.

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

17 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

18 If A* uses h(n) = 0 for every node with non-negative edge weights, it behaves like

A depth-first search Does not fit this requirement.

B Dijkstra’s algorithm Then priority is cost-so-far only.

C Prim's algorithm Does not fit this requirement.

D PageRank Does not fit this requirement.

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

19 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

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

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

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

C \(O(n \log n)\) Compare \(a=2\) with \(b^c=2\).

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

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