Quick Answer
The correct answers are cosine similarity and Euclidean distance, as these are the two standard and valid similarity metrics for vector search in high-dimensional spaces. Cosine similarity measures the angle between two vectors, focusing on orientation rather than magnitude, which makes it ideal for comparing documents or embeddings where relative direction matters. Euclidean distance, on the other hand, calculates the straight-line distance between points, capturing absolute differences in magnitude and position. On the Oracle Cloud Infrastructure Generative AI Professional 1Z0-1127 exam, this question tests your ability to distinguish vector-specific metrics from those designed for other data types—a common trap is confusing Jaccard (for set overlap), Levenshtein (for string edit distance), or Hamming (for bit vectors) with true vector search metrics. A helpful memory tip: think of vectors as arrows in space—cosine cares about which way they point, while Euclidean cares about how far apart their tips are.
This 1Z0-1127 practice question tests your understanding of building llm applications with rag and vector search. Read the scenario carefully and evaluate each option against the stated constraints before committing to an answer. After answering, compare your reasoning against the explanation and wrong-answer breakdown below. Once you have made your selection, read the full explanation to reinforce the concept and understand why each distractor is designed to mislead on exam day.
Which TWO of the following are valid similarity metrics used in vector search?
Levenshtein distance
Why wrong: Edit distance for strings.
Cosine similarity
Commonly used for normalized vectors.
Euclidean distance
Standard distance metric for vectors.
Hamming distance
Why wrong: Used for binary vectors, not typically for dense embeddings.
Jaccard index
Why wrong: Used for set similarity, not vector similarity.
Answer choices
Answer the question above first, then reveal the full breakdown to understand why each option is right or wrong.
Correct answer & explanation
Cosine similarity
Cosine similarity and Euclidean distance are standard metrics for vector search. Jaccard is for sets, Levenshtein for strings, Hamming for bit vectors.
Key principle: Answer the scenario, not the keyword: identify the specific constraint before choosing the most familiar-sounding option.
Answer analysis
For each option: why learners choose it and why it is or isn't the right answer here.
Levenshtein distance
Why it's wrong here
Edit distance for strings.
Cosine similarity
Why this is correct
Commonly used for normalized vectors.
Related concept
Read the scenario before looking for a memorised answer.
Euclidean distance
Hamming distance
Why it's wrong here
Used for binary vectors, not typically for dense embeddings.
Jaccard index
Why it's wrong here
Used for set similarity, not vector similarity.
Common exam traps
Many certification questions include familiar terms but test a specific constraint. Read the exact wording before choosing an answer that is generally true but wrong for this case.
Trap categories for this question
Similar concept trap
Used for set similarity, not vector similarity.
Detailed technical explanation
This question should be treated as a scenario, not a definition check. Identify the problem, the constraint and the best action. Then compare each option against those facts.
Key takeaway
Answer the scenario, not the keyword: identify the specific constraint before choosing the most familiar-sounding option.
Real-world example
A practitioner preparing for the 1Z0-1127 exam encounters this exact type of scenario on the job. The correct answer here is not the most general option — it is the best answer for the specific constraint described. Answer the scenario, not the keyword: identify the specific constraint before choosing the most familiar-sounding option. Real exam questions reward reading the full scenario before eliminating options, because the constraint defines which answer fits.
What to study next
Identify which 1Z0-1127 exam domain this question belongs to, then review the specific concept being tested. Practise related questions in that domain and focus on understanding why each wrong answer is tempting — not just why the correct answer is right.
Building LLM Applications with RAG and Vector Search — study guide chapter
Learn the concepts, then practise the questions
Building LLM Applications with RAG and Vector Search practice questions
Targeted practice on this topic area only
All 1Z0-1127 questions
500 questions across all exam domains
Oracle Cloud Infrastructure Generative AI Professional 1Z0-1127 study guide
Full concept coverage aligned to exam objectives
1Z0-1127 practice test guide
How to use practice tests most effectively before exam day
Related practice questions
Use these pages to review the topic behind this question. This is how one missed question becomes focused revision.
Practise 1Z0-1127 questions linked to Fundamentals of Large Language Models.
Practise 1Z0-1127 questions linked to Using OCI Generative AI Service.
Practise 1Z0-1127 questions linked to Building LLM Applications with RAG and Vector Search.
Practise 1Z0-1127 questions linked to Deploying and Managing Generative AI on OCI.
Practise 1Z0-1127 questions linked to 1Z0-1127 fundamentals.
Practise 1Z0-1127 questions linked to 1Z0-1127 scenario.
Practise 1Z0-1127 questions linked to 1Z0-1127 troubleshooting.
Practice this exam
Short sessions build daily habit. Longer sessions build exam-day stamina. Try a timed session to simulate real conditions.
FAQ
Building LLM Applications with RAG and Vector Search — This question tests Building LLM Applications with RAG and Vector Search — Read the scenario before looking for a memorised answer..
The correct answer is: Cosine similarity — Cosine similarity and Euclidean distance are standard metrics for vector search. Jaccard is for sets, Levenshtein for strings, Hamming for bit vectors.
Identify which 1Z0-1127 exam domain this question belongs to, then review the specific concept being tested. Practise related questions in that domain and focus on understanding why each wrong answer is tempting — not just why the correct answer is right.
Read the scenario before looking for a memorised answer.
About these practice questions
Courseiva creates original exam-style practice questions with explanations and wrong-answer analysis. It does not publish real exam questions, exam dumps, or protected exam content. Learn why practice questions differ from exam dumps →
Last reviewed: Jun 23, 2026
This 1Z0-1127 practice question is part of Courseiva's free Oracle certification practice question bank. Courseiva provides original exam-style practice questions with explanations, topic-based practice, mock exams, readiness tracking, and study analytics to help learners prepare for the 1Z0-1127 exam.
Question Discussion
Share a tip, memory trick, or ask about the reasoning behind this question. Do not post real exam questions, leaked content, braindumps, or copyrighted exam material. Comments are moderated and may be removed without notice.
Sign in to join the discussion.