Anonymous Student · guest · Algorithmics (HESS)

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

A 3 Does not fit this requirement.

B 8 Does not fit this requirement.

C 7 The midpoint trace reaches 127 after 7 inspection(s).

D 4 Does not fit this requirement.

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

02 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 32978 ms

03 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 36691 ms

04 For sufficiently large n, which grows more slowly than \(O(2^n)\)?

A \(O(n^3)\) \(O(n^3)\) has the lower asymptotic growth rate.

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

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

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

Written for icaijy.com · U4 AOS1 · Growth rates · answered at 48130 ms

05 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 54936 ms

06 If A* uses h(n) = 0 for every node with non-negative edge weights, it behaves like

A depth-first search Does not fit this requirement.

B Dijkstra’s algorithm Then priority is cost-so-far only.

C Prim's algorithm Does not fit this requirement.

D PageRank Does not fit this requirement.

Written for icaijy.com · U4 AOS2 · Advanced design · answered at 58500 ms