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

01 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

02 An undirected complete graph with n vertices has

A \(n(n-1)/2\) edges Each unordered pair contributes one edge.

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

C n(\(n+1\))/2 edges Does not fit this requirement.

D \(2n\) edges Does not fit this requirement.

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

03 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

04 Find shortest distances between every pair of vertices. Which algorithm is most fit for purpose?

A depth-first search Does not fit this requirement.

B Bellman–Ford algorithm Does not fit this requirement.

C Floyd–Warshall algorithm Floyd–Warshall solves all-pairs shortest paths.

D Prim's algorithm Does not fit this requirement.

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

05 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

06 A transport app must undo edits in reverse order. Which ADT is most suitable?

A queue Does not fit this requirement.

B stack A stack provides last-in, first-out access.

C priority queue Does not fit this requirement.

D set Does not fit this requirement.

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

07 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

08 Which design pattern is most clearly used by a recursive maze solver that reverses choices at dead ends?

A backtracking A recursive maze solver that reverses choices at dead ends uses backtracking.

B brute-force search Does not fit this requirement.

C divide and conquer 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

09 For a decision version of travelling salesperson, a natural certificate is

A an unsorted list of edge weights Does not fit this requirement.

B a proposed tour whose length can be checked A proposed tour can be verified in polynomial time.

C a proof that P ≠ NP Does not fit this requirement.

D the source code of every algorithm Does not fit this requirement.

Written for icaijy.com · U4 AOS1 · Complexity limits · answered at 100 ms

10 A transport app must look up a student record using a student ID. Which ADT is most suitable?

A stack Does not fit this requirement.

B set Does not fit this requirement.

C queue Does not fit this requirement.

D dictionary A dictionary maps each key to a value.

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

11 Why can testing many inputs usually not prove that an algorithm is correct for every valid input?

A Untested valid inputs may still fail. A finite test set need not cover the whole input domain.

B Only recursive algorithms can be tested. Does not fit this requirement.

C Big-O notation forbids testing. Does not fit this requirement.

D Testing always changes the algorithm. Does not fit this requirement.

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

12 A route finder combines distance travelled with estimated distance remaining. Select the best model or method.

A simulated annealing Does not fit this requirement.

B A* A* directly matches the stated requirement.

C hill climbing Does not fit this requirement.

D dynamic programming Does not fit this requirement.

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

13 A campus planner needs shortest walking distances between every pair of buildings. Which tool is most fit for purpose?

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

B Prim's algorithm Does not fit this requirement.

C Dijkstra’s algorithm Does not fit this requirement.

D Bellman–Ford algorithm Does not fit this requirement.

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

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

A 8 Does not fit this requirement.

B 256 Does not fit this requirement.

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

D 10 Does not fit this requirement.

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

15 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

16 A school system must always process the waiting job with the highest urgency. Which ADT is most suitable?

A stack Does not fit this requirement.

B set Does not fit this requirement.

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

D queue Does not fit this requirement.

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

17 Which design pattern or algorithm abandons a partial candidate as soon as it cannot lead to a valid solution?

A PageRank Does not fit this requirement.

B hill climbing Does not fit this requirement.

C binary search Does not fit this requirement.

D backtracking This is the defining behaviour of backtracking.

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

18 An exponential-time algorithm on large inputs illustrates

A an undecidable problem Does not fit this requirement.

B a soft limit of computability The problem is computable but may be impractical.

C a syntax error Does not fit this requirement.

D a violation of Church–Turing Does not fit this requirement.

Written for icaijy.com · U4 AOS1 · Complexity limits · answered at 100 ms

19 Which term best matches a system that performs very well on training examples but poorly on new examples?

A overfitting This describes overfitting.

B underflow Does not fit this requirement.

C abstraction Does not fit this requirement.

D backtracking Does not fit this requirement.

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

20 A campus planner needs shortest walking distances between every pair of buildings. Select the best model or method.

A Bellman–Ford algorithm Does not fit this requirement.

B PageRank Does not fit this requirement.

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

D Prim's algorithm Does not fit this requirement.

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