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

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

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

B 2 Does not fit this requirement.

C 7 Does not fit this requirement.

D 1 Does not fit this requirement.

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

02 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

03 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

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

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

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

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

D Node D: g = 7, h = 1, f = 8 f = 8; 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…63. How many values are inspected when searching for 47?

A 6 The midpoint trace reaches 47 after 6 inspection(s).

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

06 To show new problem X is NP-Hard using known NP-Hard problem Y, the required polynomial reduction direction is

A P → Y Does not fit this requirement.

B Y → X Solving X would then solve Y.

C X → Y Does not fit this requirement.

D X → P Does not fit this requirement.

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

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

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

B \(O(n)\) 67 is a constant independent of n.

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

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

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

08 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

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

A 11 Does not fit this requirement.

B 10 An unsuccessful search may inspect floor(log₂(512)) + 1 = 10 elements.

C 512 Does not fit this requirement.

D 9 Does not fit this requirement.

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

10 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

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

A about 1 billion Does not fit this requirement.

B about 1 trillion Does not fit this requirement.

C about 1 million Substitute n into the stated growth function.

D about 30 Does not fit this requirement.

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

12 Which design pattern is most clearly used by the standard one-dimensional 0–1 knapsack algorithm?

A brute-force search Does not fit this requirement.

B divide and conquer Does not fit this requirement.

C greedy Does not fit this requirement.

D dynamic programming The standard one-dimensional 0–1 knapsack algorithm uses dynamic programming.

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

13 Which design pattern or algorithm sometimes accepts a worse move according to a temperature parameter?

A binary search Does not fit this requirement.

B backtracking Does not fit this requirement.

C hill climbing Does not fit this requirement.

D simulated annealing This is the defining behaviour of simulated annealing.

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

14 Which design pattern is most clearly used by binary search?

A brute-force search Does not fit this requirement.

B dynamic programming Does not fit this requirement.

C divide and conquer Binary search uses divide and conquer.

D greedy Does not fit this requirement.

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

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

A 2 Does not fit this requirement.

B 5 The midpoint trace reaches 1 after 5 inspection(s).

C 8 Does not fit this requirement.

D 3 Does not fit this requirement.

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…255. How many values are inspected when searching for 1?

A 2 Does not fit this requirement.

B 6 Does not fit this requirement.

C 5 Does not fit this requirement.

D 8 The midpoint trace reaches 1 after 8 inspection(s).

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

17 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

18 Use the supplied Master Theorem. What is T(n) if \(T(n)=1T(n/3)+O(n^0)\)?

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

B \(O(\log n)\) Compare \(a=1\) with \(b^c=1\).

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

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

Written for icaijy.com · U4 AOS1 · Recurrence relations · answered at 100 ms

19 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

20 A classifier learns from emails already labelled spam or not spam. Which concept best matches this situation?

A backtracking Does not fit this requirement.

B PageRank Does not fit this requirement.

C unsupervised learning Does not fit this requirement.

D supervised learning supervised learning directly matches the stated requirement.

Written for icaijy.com · Applied · data-driven algorithms · answered at 100 ms