AI Agents Professional Practice Exam Questions and Answers – Part 4/6

Answer: B. Configure an external runtime manager that tracks the hash of the tool's input variables and forces a fallback exception if identical input signatures repeat three times.

An external runtime manager breaks execution loops by hashing tool inputs and triggering an exception when repeats occur. Increasing temperature or token limits will not fix deterministic traps; they merely generate variations of the same failed request.

Answer: C. Implementing an external execution manager that hashes the agent's action outputs and injects an explicit corrective steering prompt if an action-error pattern repeats consecutively.

An external execution manager breaks infinite loops by hashing outputs and injecting corrective steering prompts when repetitions occur. Increasing model temperature will not solve structural API error traps.

Answer: A. The system relies entirely on semantic vector similarity without integrating a temporal metadata filter or a time-decay ranking algorithm.

The correct answer works because semantic embeddings capture meaning but lack inherent chronological filtering, requiring temporal metadata to handle time-sensitive data. For the exam, watch for scenarios mixing dates and vector databases; always look for missing metadata filters.

Answer: B. The critique phase generated abstract negative feedback without providing actionable structural constraints or prescriptive adjustments.

The correct answer works because abstract critique fails to guide the generation path away from structural flaws, causing the model to repeat identical mistakes. Distractors like temperature settings or server RAM do not address the lack of prescriptive guidance in the prompt.

Answer: D. The ReAct (Reason + Act) paradigm.

The ReAct paradigm works because it explicitly interleaves internal reasoning steps with external tool executions. Self-consistency and least-to-most prompting lack this tight, sequential integration of tool-calling required for dynamic data retrieval.

Answer: B. Tree-of-Thoughts (ToT) using a customized Depth-First Search (DFS) or Breadth-First Search (BFS) routing script.

Tree-of-Thoughts works because it models reasoning as a searchable tree, allowing agents to evaluate intermediate steps and backtrack from invalid branches. Linear prompting cannot backtrack, making it unsuitable for strict compliance routing.

Answer: B. Graph-of-Thoughts (GoT).

Graph-of-Thoughts is correct because it models reasoning as a directed graph, allowing the agent to cross-link and merge complex data points. For the exam, remember that Chain-of-Thought is strictly linear, while ReAct requires tools to function properly.

Answer: B. A metadata-based temporal filtering layer or a time-weighted decay function within the retrieval algorithm.

Adding temporal metadata filtering is correct because standard vector similarity only measures semantic closeness, not data freshness. A practical exam cue is that if a system retrieves outdated information despite high similarity scores, the pipeline lacks time-based constraints.

Answer: D. The reflection prompt generated an abstract critique instead of a concrete, programmatic constraint or alternative execution path.

Generating an abstract critique is correct because self-correction requires explicit, actionable constraints to override parametric biases. If the reflection prompt only states that code failed without providing specific corrections, the model naturally repeats the error.

Answer: B. The 'Lost in the Middle' phenomenon inherent in long-context transformer attention allocation.

The Lost in the Middle phenomenon is correct because transformer attention allocation prioritizes the beginning and end of long contexts. A solid exam cue is that if models miss details specifically in the center of documents, attention bias is the culprit.

Answer: C. Lost in the Middle' position bias; resolve by implementing a hybrid memory architecture that anchors critical initialization rules in a static system prompt space while dynamically summarizing past chat loops.

Identifying the issue as Lost in the Middle position bias is correct because transformers de-prioritize tokens in the center of the context window. Pinning initialization rules in a static system prompt prevents critical instructions from drifting into low-attention zones.

Answer: C. State-space search depth and evaluation latency versus linear token generation speed.

Evaluating state-space search depth against linear token generation is correct because Tree-of-Thoughts recursively evaluates multiple intermediate steps. Chain-of-Thought generates tokens linearly and quickly, but lacks the lookahead evaluation needed for complex tasks.

Answer: C. Implement an external, persistent Key-Value session cache with an explicit 30-minute Time-To-Live (TTL) tied to the user's distinct Session ID.

Implementing an external persistent cache with a Time-To-Live is correct because it decouples session state from the active reasoning context window. Increasing the model's token generation limit does nothing to prevent short-term memory managers from clearing variables.

Answer: D. Implement Hierarchical Section-Based Chunking coupled with Meta-Data Filtering based on the explicit policy ID.

Implementing hierarchical section-based chunking with metadata filtering is correct because it ensures chunks are structurally grouped and isolated by policy ID. Changing distance metrics will not prevent mismatched clauses if the retrieval pipeline lacks strict filtering boundaries.

Answer: C. ConversationSummaryBufferMemory.

ConversationSummaryBufferMemory fits this design by summarizing older turns while keeping recent messages verbatim. Standard buffer memory lacks summarization, which would quickly exhaust the context window during multi-day operations.