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

01 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

02 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

03 A bank provides understandable reasons for an automated rejection. Which tool is most fit for purpose?

A privacy Does not fit this requirement.

B transparency transparency directly matches the stated requirement.

C bias Does not fit this requirement.

D time complexity Does not fit this requirement.

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

04 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

05 Use the supplied Master Theorem. What is T(n) if \(T(n)=4T(n/4)+O(n^0)\)?

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

B \(O(n)\) Compare \(a=4\) with \(b^c=1\).

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

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

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

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

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

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

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

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

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

07 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

08 Assume constant-time primitive operations. What is the tightest Big-O bound for: While n > 0: n ← n − 2

A \(O(n)\) Dividing the iteration count by constant 2 keeps it linear.

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

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

D \(O(1)\) Does not fit this requirement.

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

09 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

10 Which design pattern or algorithm sometimes accepts a worse move according to a temperature parameter?

A binary search Does not fit this requirement.

B backtracking Does not fit this requirement.

C hill climbing Does not fit this requirement.

D simulated annealing This is the defining behaviour of simulated annealing.

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

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

A 4 Does not fit this requirement.

B 25 Does not fit this requirement.

C 10 There is one edge for each unordered pair: 5×4/2 = 10.

D 20 Does not fit this requirement.

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

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

A 11 Does not fit this requirement.

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

C 512 Does not fit this requirement.

D 9 Does not fit this requirement.

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

13 A transport app must always process the waiting job with the highest urgency. Which ADT is most suitable?

A stack Does not fit this requirement.

B priority queue A priority queue removes the highest-priority item.

C queue Does not fit this requirement.

D set Does not fit this requirement.

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

14 Assume constant-time primitive operations. What is the tightest Big-O bound for: While n > 1: n ← floor(n/2)

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

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

C \(O(\log n)\) Repeated halving takes logarithmically many steps.

D \(O(1)\) Does not fit this requirement.

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

15 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

16 Estimate a web page’s importance from links made by other pages. Which algorithm is most fit for purpose?

A PageRank PageRank estimates importance from incoming links.

B Prim's algorithm Does not fit this requirement.

C binary search Does not fit this requirement.

D Floyd–Warshall algorithm Does not fit this requirement.

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

17 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

18 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

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

A 3 Does not fit this requirement.

B 7 Does not fit this requirement.

C 6 Does not fit this requirement.

D 5 The midpoint trace reaches 7 after 5 inspection(s).

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

20 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