Albert · guest · 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 2119 ms

02 A route finder combines distance travelled with estimated distance remaining. Select the best model or method.

A simulated annealing Does not fit this requirement.

B A* A* directly matches the stated requirement.

C hill climbing Does not fit this requirement.

D dynamic programming Does not fit this requirement.

Written for icaijy.com · Applied · advanced design · answered at 4335 ms

03 Which term must be true before an algorithm is executed?

A loop invariant Does not fit this requirement.

B postcondition Does not fit this requirement.

C precondition This describes a precondition.

D heuristic Does not fit this requirement.

Written for icaijy.com · U3 AOS2 · Correctness and modularity · answered at 8789 ms

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

05 Find shortest distances between every pair of vertices. Which algorithm is most fit for purpose?

A depth-first search Does not fit this requirement.

B Bellman–Ford algorithm Does not fit this requirement.

C Floyd–Warshall algorithm Floyd–Warshall solves all-pairs shortest paths.

D Prim's algorithm Does not fit this requirement.

Written for icaijy.com · U3 AOS2 · Graph algorithms · answered at 18820 ms

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

A Node A: g = 4, h = 11, f = 15 f = 15; another node has a smaller f.

B Node B: g = 6, h = 7, f = 13 f = 13; another node has a smaller f.

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

D Node D: g = 10, h = 1, f = 11 f = 11; this is minimal.

Written for icaijy.com · U4 AOS2 · A* search · answered at 24487 ms

07 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 29357 ms

08 A classifier learns from emails already labelled spam or not spam. Select the best model or method.

A unsupervised learning Does not fit this requirement.

B binary search Does not fit this requirement.

C PageRank 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 36139 ms

09 An undirected complete graph with n vertices has

A \(n(n-1)/2\) edges Each unordered pair contributes one edge.

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

C n(\(n+1\))/2 edges Does not fit this requirement.

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

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

10 How many edges are in an undirected complete graph with 9 vertices?

A 81 Does not fit this requirement.

B 36 There is one edge for each unordered pair: 9×8/2 = 36.

C 72 Does not fit this requirement.

D 8 Does not fit this requirement.

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

11 Tabulation is usually

A randomised backtracking Does not fit this requirement.

B a reduction proof Does not fit this requirement.

C bottom-up evaluation of DP states Tabulation fills a table in dependency order.

D a Turing Test Does not fit this requirement.

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

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

A Job A (priority 20) This has the highest priority.

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

C Job C (priority 18) A higher-priority job is present.

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

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

13 How many edges are in an undirected complete graph with 8 vertices?

A 56 Does not fit this requirement.

B 28 There is one edge for each unordered pair: 8×7/2 = 28.

C 64 Does not fit this requirement.

D 7 Does not fit this requirement.

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

14 How many edges are in an undirected complete graph with 13 vertices?

A 12 Does not fit this requirement.

B 156 Does not fit this requirement.

C 169 Does not fit this requirement.

D 78 There is one edge for each unordered pair: 13×12/2 = 78.

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