test · 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 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 9991 ms

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

A 5 Does not fit this requirement.

B 7 Does not fit this requirement.

C 6 The midpoint trace reaches 15 after 6 inspection(s).

D 8 Does not fit this requirement.

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

03 How many edges are in an undirected complete graph with 5 vertices?

A 4 Does not fit this requirement.

B 25 Does not fit this requirement.

C 10 There is one edge for each unordered pair: 5×4/2 = 10.

D 20 Does not fit this requirement.

Written for icaijy.com · U3 AOS1 · Graph modelling · answered at 31118 ms

04 One lookup in an unsorted list of five items. Which approach is most suitable?

A PageRank 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 Floyd–Warshall Does not fit this requirement.

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

05 Patients must be treated according to changing urgency scores. Which tool is most fit for purpose?

A stack Does not fit this requirement.

B set Does not fit this requirement.

C priority queue priority queue directly matches the stated requirement.

D queue Does not fit this requirement.

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

06 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 54793 ms