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

Answer: A. It systematically breaks down a complex problem into a sequence of dependent sub-problems, solving each one incrementally using the previous solution's output.

Least-to-Most prompting systematically breaks complex tasks into dependent sub-problems, solving each with prior outputs. Chain-of-Thought generates a single continuous reasoning trace without isolating sub-tasks into independent execution steps.

Answer: D. It carries extreme computational and financial overhead for continuous updates and lacks source data lineage tracking.

Relying entirely on fine-tuning for knowledge updates introduces severe compute costs and eliminates data lineage tracking. Use non-parametric memory like RAG for rapid updates, as fine-tuning cannot provide real-time data source citations.

Answer: A. Parent-Child (Small-to-Large) Chunking configurations where small sub-chunks are indexed for vector search, but their larger parent blocks are passed to the model.

Parent-Child chunking solves context loss by indexing small chunks for precise vector matches while passing larger parent blocks to the model. This ensures surrounding context is retained, unlike naive character splitting which fragments documents.

Answer: D. It is slow, computationally expensive, lacks data lineage traceability, and cannot keep pace with high-velocity real-time changes.

Frequent fine-tuning is computationally expensive and inherently lacks the real-time velocity required for inventory tracking. Non-parametric RAG architectures are required here, as they allow immediate updates and clear data lineage.

Answer: A. Transition to a Graph RAG or Hierarchical Agentic RAG system that structures explicitly mapped cross-references between chapters and appendices.

Graph RAG maps explicit relationships between nodes, allowing traversal between main chapters and distant appendices. Simply changing distance metrics or increasing chunk size cannot capture these complex cross-references.

Answer: A. Deploy Graph RAG combined with Entity-Relation indexing and temporal metadata mapping.

Graph RAG with temporal metadata resolves multi-hop queries by mapping semantic edges between entities across time. Simply increasing vector search results lacks the relational structure needed for complex chronological analysis.

Answer: C. A 'Workspace Virtualization' layout where raw code bodies are stored in an ephemeral key-value index while compact structural maps are maintained in the active prompt context.

Workspace virtualization offloads raw code to an external index while keeping structural maps in the prompt. This optimizes context usage, whereas holding entire files in the buffer causes memory exhaustion.

Answer: A. Implement an input/output parsing interceptor that captures empty or anomalous agent cycles and substitutes an explicit system guiding prompt into the context window.

Implementing an interceptor catches empty or anomalous outputs and injects an explicit system guiding prompt to force the model back on track. Options like increasing the context window or fine-tuning do not solve the immediate loop execution failure.

Answer: C. It implements an evaluation loop where a critic module analyzes execution errors, writes a natural language critique, and inserts it into the context workspace for the next trial.

Reflexion uses an evaluation loop where a critic module analyzes execution errors, writes a natural language critique, and stores it in the context for the next trial. It relies on self-evaluative linguistic loops, not inference-time weight modifications.

Answer: A. A dual-tier system mapping a high-speed in-memory Key-Value store (Short-Term) with an external indexed Vector Database (Long-Term).

A dual-tier system provides the best balance, using an in-memory key-value store for instant state access and an external vector database for long-term semantic retrieval. Flat files lack speed, while continuous fine-tuning is computationally unfeasible.

Answer: B. Dynamic Replanning via a closed-loop environmental evaluation mechanism.

Dynamic replanning allows an agent to read unexpected runtime tool failures, invalidate historical sub-goals, and generate an alternative execution pathway on the fly. Static prompting or strict linear processing cannot adapt to unexpected environment changes.

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

Tree-of-Thoughts allows an agent to evaluate discrete steps as tree nodes, using search algorithms like depth-first or breadth-first search to systematically prune failing paths. Linear prompting lacks the branching required to discard failing setups.

Answer: A. The vector retrieval scoring matrix lacks a time-decay metric, causing ancient historical data configurations to match current live telemetry scores equally.

The vector retrieval scoring matrix lacks a time-decay metric, causing outdated historical data to match current telemetry scores equally. Without temporal weight adjustments, semantic searches treat old alerts as current system states, triggering false positives.

Answer: C. Search execution latency under high concurrent load queries versus precision retrieval recall metrics (Recall @ K).

The core trade-off is evaluating search execution latency under high concurrent load against precision retrieval metrics like Recall@K. Selecting index models like HNSW versus IVF-PQ requires balancing search velocity with semantic retrieval accuracy.

Answer: A. Transition the planning structure to a Multi-Agent 'Physician-Critic' loop where a separate agent is explicitly prompted to invalidate the primary agent's hypotheses.

Transitioning to a multi-agent loop with a separate critic forces an independent evaluation of the primary agent's hypotheses, successfully breaking the confirmation bias. Simply increasing temperature or adding static examples does not resolve the echo chamber.