Knowledge Check — Select an answer to see immediate feedback.
Questions10
Question 1
RAG addresses fundamental limitations of standard LLMs. Which of the following is NOT one of the three core limitations described in the textbook?
Question 2
In the basic RAG workflow, what is the correct sequence of steps from user query to final response?
Question 3
Why is exact nearest neighbor (brute-force) search computationally prohibitive for large-scale vector databases?
Question 4
HNSW (Hierarchical Navigable Small World) achieves fast approximate nearest neighbor search through which mechanism?
Question 5
When using fixed-size chunking with overlap (e.g., 512 tokens with 128-token overlap), what is the primary purpose of the overlap between consecutive chunks?
Question 6
Reranking in advanced RAG pipelines uses a cross-encoder model in a second pass over candidates retrieved by bi-encoder embeddings. What advantage does this provide?
Question 7
The Hypothetical Document Embeddings (HyDE) technique retrieves documents by embedding a hypothetical answer rather than the query. What is the core intuition?
Question 8
Recall@k and Precision@k are both used to evaluate retrieval quality. How do they differ?
Question 9
Hybrid search in RAG systems combines dense vector embeddings with sparse methods like BM25. What gap in purely semantic (dense) search does this address?
Question 10
Faithfulness (also called groundedness) is a key generation quality metric for RAG systems. What does it specifically measure?