Scott · guest · Algorithmics (HESS)

01 A school system must always process the waiting job with the highest urgency. Which ADT is most suitable?

A stack Does not fit this requirement.

B set Does not fit this requirement.

C priority queue A priority queue removes the highest-priority item.

D queue Does not fit this requirement.

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

02 A research program must represent cities and the roads joining them. Which ADT is most suitable?

A graph A graph models entities and relationships.

B dictionary Does not fit this requirement.

C stack Does not fit this requirement.

D set Does not fit this requirement.

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

03 A research program must store a sequence while preserving duplicates and order. Which ADT is most suitable?

A set Does not fit this requirement.

B list A list preserves sequence and permits repeated values.

C priority queue Does not fit this requirement.

D stack Does not fit this requirement.

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

04 Past biased policing data directs more patrols to the same areas, generating more similar data. What is the most relevant issue?

A a harmful feedback loop The scenario directly illustrates a harmful feedback loop.

B a balanced dataset Does not fit this requirement.

C binary search Does not fit this requirement.

D formal verification Does not fit this requirement.

Written for icaijy.com · U4 AOS3 · AI ethics · answered at 24610 ms

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

06 A research program must undo edits in reverse order. Which ADT is most suitable?

A priority queue Does not fit this requirement.

B stack A stack provides last-in, first-out access.

C set Does not fit this requirement.

D queue Does not fit this requirement.

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

07 A research program 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 37135 ms

08 In the standard model, a Turing machine reads and writes symbols on

A a neural network Does not fit this requirement.

B a finite queue only Does not fit this requirement.

C a weighted graph Does not fit this requirement.

D an unbounded tape divided into cells The accepted statement is: an unbounded tape divided into cells.

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

09 Assume constant-time primitive operations. What is the tightest Big-O bound for: For i from 1 to n: For j from 1 to i: constantWork()

A \(O(n)\) Does not fit this requirement.

B \(O(n^2)\) \(1+\cdots+n\) is quadratic.

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

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

Written for icaijy.com · U4 AOS1 · Time complexity · answered at 52803 ms

10 Assume constant-time primitive operations. What is the tightest Big-O bound for: For i from 1 to n: For j from 1 to n: constantWork()

A \(O(n^2)\) There are n × n iterations.

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

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

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

Written for icaijy.com · U4 AOS1 · Time complexity · answered at 55449 ms