That y8 kid 🤣 - bot · guest · Algorithmics (HESS)

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

02 How many edges are in an undirected complete graph with 5 vertices?

A 4 Does not fit this requirement.

B 25 Does not fit this requirement.

C 10 There is one edge for each unordered pair: 5×4/2 = 10.

D 20 Does not fit this requirement.

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

03 Which concept is illustrated? A system is designed to perform a specific apparently intelligent task.

A weak AI This is the standard description of weak AI.

B NP-Completeness Does not fit this requirement.

C undecidability Does not fit this requirement.

D strong AI Does not fit this requirement.

Written for icaijy.com · U4 AOS3 · Conceptions of AI · answered at 100 ms

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

A 3 Does not fit this requirement.

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

C 8 Does not fit this requirement.

D 5 Does not fit this requirement.

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

05 Improve a timetable by repeatedly accepting only a better neighbouring timetable. Choose the best algorithmic description.

A dynamic programming Does not fit this requirement.

B hill climbing hill climbing best matches the input and goal.

C breadth-first search Does not fit this requirement.

D binary search Does not fit this requirement.

Written for icaijy.com · U4 AOS2 · Selecting algorithms · answered at 100 ms

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

A 6 The midpoint trace reaches 1 after 6 inspection(s).

B 1 Does not fit this requirement.

C 2 Does not fit this requirement.

D 8 Does not fit this requirement.

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

07 An exponential-time algorithm on large inputs illustrates

A an undecidable problem Does not fit this requirement.

B a soft limit of computability The problem is computable but may be impractical.

C a syntax error Does not fit this requirement.

D a violation of Church–Turing Does not fit this requirement.

Written for icaijy.com · U4 AOS1 · Complexity limits · answered at 100 ms

08 Which term must be true when a correct algorithm terminates?

A recurrence Does not fit this requirement.

B precondition Does not fit this requirement.

C counterexample Does not fit this requirement.

D postcondition This describes a postcondition.

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

09 Use the supplied Master Theorem. What is T(n) if \(T(n)=2T(n/2)+O(n^1)\)?

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

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

C \(O(n \log n)\) Compare \(a=2\) with \(b^c=2\).

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

Written for icaijy.com · U4 AOS1 · Recurrence relations · answered at 100 ms

10 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 100 ms

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

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

A 4 Does not fit this requirement.

B 3 Does not fit this requirement.

C 5 Does not fit this requirement.

D 6 The midpoint trace reaches 31 after 6 inspection(s).

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

13 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 100 ms

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

A 196 Does not fit this requirement.

B 182 Does not fit this requirement.

C 13 Does not fit this requirement.

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

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

15 Which concept is illustrated? A person follows symbol rules without understanding the language.

A Turing Test Does not fit this requirement.

B Master Theorem Does not fit this requirement.

C Chinese Room argument This is the standard description of Chinese Room argument.

D PageRank Does not fit this requirement.

Written for icaijy.com · U4 AOS3 · Conceptions of AI · answered at 100 ms

16 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 100 ms

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

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

B \(O(n)\) 67 is a constant independent of n.

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

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

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

18 In a weighted graph, a weight is usually attached to

A an edge or vertex to represent a quantity Weights encode cost, distance or another quantity.

B only isolated vertices Does not fit this requirement.

C the drawing scale Does not fit this requirement.

D the graph title Does not fit this requirement.

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

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

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

B Job B (priority 14) This has the highest priority.

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

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

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

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

A 4096 Does not fit this requirement.

B 13 An unsuccessful search may inspect floor(log₂(4096)) + 1 = 13 elements.

C 12 Does not fit this requirement.

D 14 Does not fit this requirement.

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