algo67goat · guest · Algorithmics (HESS)

01 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 3395 ms

02 A school system must serve customers in the order in which they arrived. Which ADT is most suitable?

A set Does not fit this requirement.

B dictionary Does not fit this requirement.

C stack Does not fit this requirement.

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

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

03 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 12479 ms

04 Assume constant-time primitive operations. What is the tightest Big-O bound for: While n > 0: n ← n − 2

A \(O(n)\) Dividing the iteration count by constant 2 keeps it linear.

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

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

D \(O(1)\) Does not fit this requirement.

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

05 Which signature best specifies the pop operation?

A stack → stack Pop removes the top item and returns the updated stack in this specification.

B item → stack Does not fit this requirement.

C stack × item → stack Does not fit this requirement.

D stack → item × item Does not fit this requirement.

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

06 Which class is best described as problems that are both in NP and NP-Hard?

A NP-Complete That is the definition of NP-Complete.

B exponential Does not fit this requirement.

C P Does not fit this requirement.

D NP Does not fit this requirement.

Written for icaijy.com · U4 AOS1 · P, NP and reductions · answered at 27651 ms

07 A school system must store a sequence while preserving duplicates and order. Which ADT is most suitable?

A set Does not fit this requirement.

B priority queue Does not fit this requirement.

C list A list preserves sequence and permits repeated values.

D stack Does not fit this requirement.

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

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

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

A 1 Does not fit this requirement.

B 4 The midpoint trace reaches 3 after 4 inspection(s).

C 6 Does not fit this requirement.

D 7 Does not fit this requirement.

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

10 Which term best matches a system that separates classes using a maximum-margin boundary?

A simulated annealing Does not fit this requirement.

B queue Does not fit this requirement.

C support vector machine This describes support vector machine.

D decision tree Does not fit this requirement.

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

11 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 57183 ms

12 A Turing machine transition depends on

A a random training label Does not fit this requirement.

B the wall-clock time only Does not fit this requirement.

C the current state and scanned symbol The accepted statement is: the current state and scanned symbol.

D the entire future tape Does not fit this requirement.

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

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

A 4 Does not fit this requirement.

B 3 Does not fit this requirement.

C 5 The midpoint trace reaches 23 after 5 inspection(s).

D 6 Does not fit this requirement.

Written for icaijy.com · U4 AOS2 · Binary search · not answered before time expired