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

01 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

02 A research program must always process the waiting job with the highest urgency. Which ADT is most suitable?

A set Does not fit this requirement.

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

C queue Does not fit this requirement.

D stack Does not fit this requirement.

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

03 An undecidable problem represents

A a poor choice of data structure Does not fit this requirement.

B a hard limit of computability The accepted statement is: a hard limit of computability.

C a constant-factor slowdown Does not fit this requirement.

D an average-case analysis Does not fit this requirement.

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

04 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

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

A 5 The midpoint trace reaches 15 after 5 inspection(s).

B 3 Does not fit this requirement.

C 9 Does not fit this requirement.

D 8 Does not fit this requirement.

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

06 A transport app must represent cities and the roads joining them. Which ADT is most suitable?

A graph A graph models entities and relationships.

B stack Does not fit this requirement.

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

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

A 1024 Does not fit this requirement.

B 10 Does not fit this requirement.

C 12 Does not fit this requirement.

D 11 An unsuccessful search may inspect floor(log₂(1024)) + 1 = 11 elements.

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

08 Which class is best described as problems that are both in NP and NP-Hard?

A NP-Complete That is the definition of NP-Complete.

B exponential Does not fit this requirement.

C P Does not fit this requirement.

D NP Does not fit this requirement.

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

09 A form must reject an ID if it is already present. Which tool is most fit for purpose?

A dictionary Does not fit this requirement.

B stack Does not fit this requirement.

C priority queue Does not fit this requirement.

D set set directly matches the stated requirement.

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

10 Explore a game tree and undo choices when a dead end is reached. Which approach is most suitable?

A binary search Does not fit this requirement.

B PageRank Does not fit this requirement.

C backtracking backtracking best matches the input and goal.

D mergesort Does not fit this requirement.

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

11 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

12 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

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

A 4 Does not fit this requirement.

B 6 The midpoint trace reaches 63 after 6 inspection(s).

C 8 Does not fit this requirement.

D 1 Does not fit this requirement.

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

14 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

15 A campus planner needs shortest walking distances between every pair of buildings. Which concept best matches this situation?

A Bellman–Ford algorithm Does not fit this requirement.

B PageRank Does not fit this requirement.

C Prim's algorithm Does not fit this requirement.

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

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

16 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

17 Optimise a timetable while occasionally accepting worse moves early in the search. Choose the best algorithmic description.

A Floyd–Warshall Does not fit this requirement.

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

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

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

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

C Job C (priority 8) This has the highest priority.

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

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

20 A route finder combines distance travelled with estimated distance remaining. Which tool is most fit for purpose?

A backtracking Does not fit this requirement.

B hill climbing Does not fit this requirement.

C simulated annealing Does not fit this requirement.

D A* A* directly matches the stated requirement.

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