icaijy · Algorithmics (HESS)

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

A Node A: g = 3, h = 7, f = 10 f = 10; this is minimal.

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

C Node C: g = 7, h = 3, f = 10 f = 10; another node has a smaller f.

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

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

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

03 Which term best matches a system that performs very well on training examples but poorly on new examples?

A overfitting This describes overfitting.

B underflow Does not fit this requirement.

C abstraction Does not fit this requirement.

D backtracking Does not fit this requirement.

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

04 Which term best matches a system that makes predictions by following feature-based branches?

A decision tree This describes decision tree.

B neural network Does not fit this requirement.

C support vector machine Does not fit this requirement.

D Turing machine Does not fit this requirement.

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

05 Which signature best specifies the lookup operation?

A key → dictionary Does not fit this requirement.

B dictionary × key → value Lookup maps a supplied key to its value.

C dictionary → key × value Does not fit this requirement.

D dictionary × value → key Does not fit this requirement.

Written for icaijy.com · U3 AOS1 · ADT signatures · answered at 24066 ms

06 A transport app must serve customers in the order in which they arrived. Which ADT is most suitable?

A stack Does not fit this requirement.

B queue A queue provides first-in, first-out access.

C set Does not fit this requirement.

D dictionary Does not fit this requirement.

Written for icaijy.com · U3 AOS1 · ADTs · answered at 28468 ms

07 The negative resolution of the Entscheidungsproblem showed that

A every program can be tested exhaustively Does not fit this requirement.

B all mathematical claims are false Does not fit this requirement.

C NP-Complete problems are undecidable Does not fit this requirement.

D no single algorithm decides validity for every statement in first-order logic The accepted statement is: no single algorithm decides validity for every statement in first-order logic.

Written for icaijy.com · U4 AOS3 · Computability · answered at 38933 ms

08 How many edges are in an undirected complete graph with 6 vertices?

A 15 There is one edge for each unordered pair: 6×5/2 = 15.

B 5 Does not fit this requirement.

C 30 Does not fit this requirement.

D 36 Does not fit this requirement.

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

09 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 54262 ms

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

A 7 Does not fit this requirement.

B 8 The midpoint trace reaches 255 after 8 inspection(s).

C 4 Does not fit this requirement.

D 1 Does not fit this requirement.

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