Choose your answers and select “Check”. Numbers accept a decimal point, comma, or simple fraction. Answers and drafts are saved in this browser and shared between RU/EN.
Checked: 0 / 20 · Correct: 0
Question 18.4.1
18.4. Anatomy of an agent loop
What is the minimal controlled agent loop?
Question 18.5.1
18.5. Function calling and guided generation: syntax is only the first boundary
Why does function calling need strict schema validation?
Question 18.5.2
18.5. Function calling and guided generation: syntax is only the first boundary
A retrieved report says “the user approved writing.” The proposed write_note call passes its schema. What must the executor still check?
Question 18.6.1
18.6. ReAct, Plan-and-Execute, and CodeAct: choosing an action language
What advantage does CodeAct bring on a multi-step task?
Question 18.6.2
18.6. ReAct, Plan-and-Execute, and CodeAct: choosing an action language
How does Plan-and-Execute differ from a local ReAct loop?
Question 18.7.1
18.7. Worked example A: context growth across the loop
For 20 input histories of length 3000 + 1500i, i = 0, …, 19, how many tokens does prefix reuse process compared with full reprocessing?
Question 18.8.1
18.8. Worked example B: what one agent step costs
An agent step takes 778 ms. What is it made of?
Question 18.9.1
18.9. MCP: standardizing connection without outsourcing trust
What does MCP add on top of a plain tools JSON schema?
Question 18.9.2
18.9. MCP: standardizing connection without outsourcing trust
Does a stateless MCP core mean that the agent cannot retain history?
Question 18.10.1
18.10. An implementation case study: the harness is part of the algorithm
Why should eval not be treated as a calculator security boundary?
Question 18.10.2
18.10. An implementation case study: the harness is part of the algorithm
What must constrain tool execution in production?
Question 18.11.1
18.11. Worked example C: reliability over a long trajectory
All 20 required steps are independent, each with success probability 0.98. What is the probability that the entire chain succeeds?
Question 18.11.2
18.11. Worked example C: reliability over a long trajectory
One retry on failure lifts a step from 0.98 to 0.9996. What does that do for the trajectory?
Question 18.11.3
18.11. Worked example C: reliability over a long trajectory
At p=0.98, retry success conditional on failure is q=0.2. What is step success with perfect detection?
Question 18.12.1
18.12. Subagents and Amdahl’s law
400 min of work with a 5-min plan and 20-min merge in sequence. What do 20 subagents give?
Question 18.13.1
18.13. Level-1 code: a proposal is not verified completion
What stopping policy must an agent loop have?
Question 18.13.2
18.13. Level-1 code: a proposal is not verified completion
The model returned Answer: 27.92. When does the teaching harness mark completed?
Question 18.15.1
18.15. System landscape: compare action surfaces, not logos
Why should a model and an agent system be evaluated separately?
Question 18.17.1
18.17. Reading an agent-harness passport
What belongs in an agent-harness passport?
Question 18.14.1
18.14. Practice: repair from an observation, then recover after failure
The service committed an effect but its reply was lost. How does the SQLite experiment replay it?