icaijy · Algorithmics (HESS)

01 How many edges are in an undirected complete graph with 16 vertices?

A 240 Does not fit this requirement.

B 120 There is one edge for each unordered pair: 16×15/2 = 120.

C 256 Does not fit this requirement.

D 15 Does not fit this requirement.

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

02 Which design pattern or algorithm commits to the locally best available choice at each step?

A divide and conquer Does not fit this requirement.

B dynamic programming Does not fit this requirement.

C backtracking Does not fit this requirement.

D greedy This is the defining behaviour of greedy.

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

03 A form must reject an ID if it is already present. Which tool is most fit for purpose?

A dictionary Does not fit this requirement.

B stack Does not fit this requirement.

C priority queue Does not fit this requirement.

D set set directly matches the stated requirement.

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

04 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 26201 ms

05 A graph is connected when

A it contains no cycle Does not fit this requirement.

B every vertex has equal degree Does not fit this requirement.

C every pair of vertices has a path between them Connectivity requires paths, not direct edges.

D every vertex is adjacent to every other Does not fit this requirement.

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

06 A system groups articles without any supplied category labels. Which concept best matches this situation?

A binary search Does not fit this requirement.

B unsupervised learning unsupervised learning directly matches the stated requirement.

C supervised learning Does not fit this requirement.

D PageRank Does not fit this requirement.

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

07 Which term best matches a system that uses a trained model to produce an output for new data?

A recursion Does not fit this requirement.

B annotation Does not fit this requirement.

C training Does not fit this requirement.

D inference This describes inference.

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

08 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 53571 ms

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

A 128 Does not fit this requirement.

B 9 Does not fit this requirement.

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

D 7 Does not fit this requirement.

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

10 Which term best matches a system that seeks structure in unlabelled data?

A unsupervised learning This describes unsupervised learning.

B supervised learning Does not fit this requirement.

C backtracking Does not fit this requirement.

D formal verification Does not fit this requirement.

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