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

01 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

02 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

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

A 5 An unsuccessful search may inspect floor(log₂(16)) + 1 = 5 elements.

B 4 Does not fit this requirement.

C 6 Does not fit this requirement.

D 16 Does not fit this requirement.

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

04 Which class is best described as decision problems solvable in polynomial time?

A undecidable Does not fit this requirement.

B NP Does not fit this requirement.

C P That is the definition of P.

D NP-Hard Does not fit this requirement.

Written for icaijy.com · U4 AOS1 · P, NP and reductions · answered at 100 ms

05 A form must reject an ID if it is already present. Which concept best matches this situation?

A dictionary Does not fit this requirement.

B priority queue Does not fit this requirement.

C stack Does not fit this requirement.

D set set directly matches the stated requirement.

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

06 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

07 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

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

A about 1 million Does not fit this requirement.

B about 1 thousand Does not fit this requirement.

C about 1 billion Does not fit this requirement.

D about 30 Substitute n into the stated growth function.

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

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

A 100 Does not fit this requirement.

B 9 Does not fit this requirement.

C 90 Does not fit this requirement.

D 45 There is one edge for each unordered pair: 10×9/2 = 45.

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

10 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

11 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

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

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

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

C Node C: g = 4, h = 6, f = 10 f = 10; another node has a smaller f.

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

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

13 Which term remains true before and after every loop iteration?

A input size Does not fit this requirement.

B postcondition Does not fit this requirement.

C loop invariant This describes a loop invariant.

D base case Does not fit this requirement.

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

14 A greedy algorithm is claimed to be optimal. Which evidence is strongest?

A It worked on ten random inputs. Does not fit this requirement.

B It uses a priority queue. Does not fit this requirement.

C Its code is short. Does not fit this requirement.

D A proof that every greedy choice can be part of an optimal solution. An exchange-style argument establishes optimality generally.

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

15 Which design pattern or algorithm repeatedly moves to a neighbouring state with a better heuristic value?

A divide and conquer Does not fit this requirement.

B dynamic programming Does not fit this requirement.

C breadth-first search Does not fit this requirement.

D hill climbing This is the defining behaviour of hill climbing.

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

16 Training records reveal identifiable medical information. What is the most relevant issue?

A time complexity Does not fit this requirement.

B privacy risk The scenario directly illustrates privacy risk.

C minimum spanning tree Does not fit this requirement.

D termination proof Does not fit this requirement.

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

17 One lookup in an unsorted list of five items. Choose the best algorithmic description.

A Floyd–Warshall 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 PageRank Does not fit this requirement.

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

18 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

19 A basic hill-climbing search may stop before the global optimum because of

A the Master Theorem Does not fit this requirement.

B a local optimum No improving neighbour may exist at a non-global optimum.

C a guaranteed negative cycle Does not fit this requirement.

D a queue overflow by definition Does not fit this requirement.

Written for icaijy.com · U4 AOS2 · Advanced design · 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