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

01 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

02 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

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

A 16 Does not fit this requirement.

B 16384 Does not fit this requirement.

C 15 An unsuccessful search may inspect floor(log₂(16384)) + 1 = 15 elements.

D 14 Does not fit this requirement.

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

04 In the standard model, a Turing machine reads and writes symbols on

A a neural network Does not fit this requirement.

B a finite queue only Does not fit this requirement.

C a weighted graph Does not fit this requirement.

D an unbounded tape divided into cells The accepted statement is: an unbounded tape divided into cells.

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

05 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

06 A bank provides understandable reasons for an automated rejection. Select the best model or method.

A privacy Does not fit this requirement.

B time complexity Does not fit this requirement.

C bias Does not fit this requirement.

D transparency transparency directly matches the stated requirement.

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

07 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

08 For sufficiently large n, which grows more slowly than \(O(n)\)?

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

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

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

D \(O(\log n)\) \(O(\log n)\) has the lower asymptotic growth rate.

Written for icaijy.com · U4 AOS1 · Growth rates · answered at 100 ms

09 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

10 A school system must serve customers in the order in which they arrived. Which ADT is most suitable?

A set Does not fit this requirement.

B dictionary Does not fit this requirement.

C stack Does not fit this requirement.

D queue A queue provides first-in, first-out access.

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

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

A 5 Does not fit this requirement.

B 3 Does not fit this requirement.

C 7 The midpoint trace reaches 1 after 7 inspection(s).

D 6 Does not fit this requirement.

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

12 A research program must access the 18th temperature reading directly. Which ADT is most suitable?

A set Does not fit this requirement.

B queue Does not fit this requirement.

C stack Does not fit this requirement.

D array An array supports access by numeric index.

Written for icaijy.com · U3 AOS1 · ADTs · 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 47?

A 6 The midpoint trace reaches 47 after 6 inspection(s).

B 3 Does not fit this requirement.

C 1 Does not fit this requirement.

D 2 Does not fit this requirement.

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

14 Explore one branch deeply before returning to alternatives. Which algorithm is most fit for purpose?

A PageRank Does not fit this requirement.

B Dijkstra’s algorithm Does not fit this requirement.

C depth-first search DFS follows a branch before backtracking.

D breadth-first search Does not fit this requirement.

Written for icaijy.com · U3 AOS2 · Graph algorithms · answered at 100 ms

15 A school system must store a sequence while preserving duplicates and order. Which ADT is most suitable?

A set Does not fit this requirement.

B priority queue Does not fit this requirement.

C list A list preserves sequence and permits repeated values.

D stack Does not fit this requirement.

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

16 Which term best matches a system that learns from examples paired with desired outputs?

A supervised learning This describes supervised learning.

B unsupervised learning Does not fit this requirement.

C binary search Does not fit this requirement.

D PageRank Does not fit this requirement.

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

17 A research program must store a sequence while preserving duplicates and order. Which ADT is most suitable?

A set Does not fit this requirement.

B list A list preserves sequence and permits repeated values.

C priority queue Does not fit this requirement.

D stack Does not fit this requirement.

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

18 Patients must be treated according to changing urgency scores. Which tool is most fit for purpose?

A stack Does not fit this requirement.

B set Does not fit this requirement.

C priority queue priority queue directly matches the stated requirement.

D queue Does not fit this requirement.

Written for icaijy.com · Applied · ADTs · answered at 100 ms

19 How many edges are in an undirected complete graph with 16 vertices?

A 240 Does not fit this requirement.

B 120 There is one edge for each unordered pair: 16×15/2 = 120.

C 256 Does not fit this requirement.

D 15 Does not fit this requirement.

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

20 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