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

01 Many membership queries on a large sorted array. Which approach is most suitable?

A linear search Does not fit this requirement.

B depth-first search Does not fit this requirement.

C hill climbing Does not fit this requirement.

D binary search binary search best matches the input and goal.

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

02 A fare graph includes rebates represented by negative edges and has no negative cycle. Select the best model or method.

A Bellman–Ford algorithm Bellman–Ford algorithm directly matches the stated requirement.

B Dijkstra’s algorithm Does not fit this requirement.

C Floyd–Warshall algorithm Does not fit this requirement.

D PageRank Does not fit this requirement.

Written for icaijy.com · Applied · graph algorithms · 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 research program must store a sequence while preserving duplicates and order. Which ADT is most suitable?

A set Does not fit this requirement.

B list A list preserves sequence and permits repeated values.

C priority queue Does not fit this requirement.

D stack Does not fit this requirement.

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

05 Assume constant-time primitive operations. What is the tightest Big-O bound for: For i from 1 to n: j ← 1; While j < n: j ← 2j

A \(O(n \log n)\) A logarithmic loop occurs n times.

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

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

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

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

06 A transport app must test quickly whether a username has already been used. Which ADT is most suitable?

A stack Does not fit this requirement.

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

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

A 4 Does not fit this requirement.

B 3 Does not fit this requirement.

C 5 Does not fit this requirement.

D 6 The midpoint trace reaches 31 after 6 inspection(s).

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

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

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

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

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

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

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

09 Assume constant-time primitive operations. What is the tightest Big-O bound for: For i from 1 to n: constantWork()

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

B \(O(n)\) The body runs n times.

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

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

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

10 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

11 Which term best matches a system that separates classes using a maximum-margin boundary?

A simulated annealing Does not fit this requirement.

B queue Does not fit this requirement.

C support vector machine This describes support vector machine.

D decision tree Does not fit this requirement.

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

12 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

13 A council must connect all suburbs while minimising total new cable. Select the best model or method.

A Bellman–Ford algorithm Does not fit this requirement.

B Prim's algorithm Prim's algorithm directly matches the stated requirement.

C Dijkstra’s algorithm Does not fit this requirement.

D PageRank Does not fit this requirement.

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

14 Which signature best specifies the push operation?

A stack → stack × item Does not fit this requirement.

B stack × item → stack Push adds an item and returns the updated stack.

C stack → item Does not fit this requirement.

D item → stack Does not fit this requirement.

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

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

A 15 Does not fit this requirement.

B 8192 Does not fit this requirement.

C 13 Does not fit this requirement.

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

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

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

A 4 Does not fit this requirement.

B 3 Does not fit this requirement.

C 5 The midpoint trace reaches 23 after 5 inspection(s).

D 6 Does not fit this requirement.

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

17 A council must connect all suburbs while minimising total new cable. Which concept best matches this situation?

A Dijkstra’s algorithm Does not fit this requirement.

B Bellman–Ford algorithm Does not fit this requirement.

C Floyd–Warshall algorithm Does not fit this requirement.

D Prim's algorithm Prim's algorithm directly matches the stated requirement.

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

18 Assume constant-time primitive operations. What is the tightest Big-O bound for: For i from 1 to n: For j from 1 to i: constantWork()

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

B \(O(n^2)\) \(1+\cdots+n\) is quadratic.

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

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

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

19 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

20 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