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

03 Find a path using the fewest edges in an unweighted graph. Which algorithm is most fit for purpose?

A PageRank Does not fit this requirement.

B breadth-first search BFS explores vertices in increasing edge distance.

C Prim's algorithm Does not fit this requirement.

D depth-first search Does not fit this requirement.

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

04 The Halting Problem asks whether

A a program eventually stops on a given input The accepted statement is: a program eventually stops on a given input.

B a graph is connected Does not fit this requirement.

C a model is unbiased Does not fit this requirement.

D two arrays have equal length Does not fit this requirement.

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

05 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

06 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

07 Patients must be treated according to changing urgency scores. Select the best model or method.

A dictionary Does not fit this requirement.

B queue Does not fit this requirement.

C set Does not fit this requirement.

D priority queue priority queue directly matches the stated requirement.

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

08 Find shortest distances from one depot when all edge weights are non-negative. Which algorithm is most fit for purpose?

A PageRank Does not fit this requirement.

B Floyd–Warshall algorithm Does not fit this requirement.

C Dijkstra’s algorithm Dijkstra solves non-negative single-source shortest paths.

D Prim's algorithm Does not fit this requirement.

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

09 A Turing machine transition depends on

A a random training label Does not fit this requirement.

B the wall-clock time only Does not fit this requirement.

C the current state and scanned symbol The accepted statement is: the current state and scanned symbol.

D the entire future tape Does not fit this requirement.

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

10 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

11 An organisation names who is responsible for harms caused by its model. What is the most relevant issue?

A memoisation Does not fit this requirement.

B anonymity Does not fit this requirement.

C overfitting Does not fit this requirement.

D accountability The scenario directly illustrates accountability.

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

12 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

13 A research program must represent cities and the roads joining them. Which ADT is most suitable?

A graph A graph models entities and relationships.

B dictionary Does not fit this requirement.

C stack Does not fit this requirement.

D set Does not fit this requirement.

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

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

A 4 The midpoint trace reaches 11 after 4 inspection(s).

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

15 Which term proves a recursive claim from a base case and a smaller instance?

A random testing Does not fit this requirement.

B inductive argument This describes a inductive argument.

C simulation Does not fit this requirement.

D hill climbing Does not fit this requirement.

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

16 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

17 Optimise a timetable while occasionally accepting worse moves early in the search. Which approach is most suitable?

A binary search Does not fit this requirement.

B Floyd–Warshall Does not fit this requirement.

C simulated annealing simulated annealing best matches the input and goal.

D hill climbing Does not fit this requirement.

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

18 A postcode indirectly encodes socioeconomic or ethnic background. What is the most relevant issue?

A a proxy variable may reproduce discrimination The scenario directly illustrates a proxy variable may reproduce discrimination.

B the algorithm becomes undecidable Does not fit this requirement.

C the feature is automatically fair Does not fit this requirement.

D the model becomes unsupervised Does not fit this requirement.

Written for icaijy.com · U4 AOS3 · AI ethics · 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 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