- A
It encodes the order of tokens in the sequence
Why wrong: Positional encoding, not self-attention, handles token order.
- B
It computes a weighted sum of all input token representations, where weights depend on pairwise compatibility between tokens
Self-attention calculates attention scores between every pair of tokens and uses them to aggregate information.
- C
It applies a convolutional filter over local windows of tokens
Why wrong: Convolution is not part of self-attention; self-attention considers all tokens globally.
- D
It replaces the need for positional encoding by using recurrence
Why wrong: Self-attention is position-agnostic; positional encoding is still required. It does not use recurrence.
Question 600 of 991
1Z0-1127 LLM Fundamentals Practice Question
This 1Z0-1127 practice question tests your understanding of llm fundamentals. Compare every option against the stated constraints before choosing — the best answer satisfies all requirements, not just the most obvious one. 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 of the following best describes the role of the self-attention mechanism in a Transformer model?
Clue words in this question
Noticing these words before you look at the options changes how you read each choice.
Clue:
"best"Why it matters: Signals that multiple options may be partially correct. Choose the option that most directly solves the exact problem described, not the one that sounds most complete.
Answer choices
Why each option matters
Answer the question above first, then reveal the full breakdown to understand why each option is right or wrong.
Correct answer & explanation
✓
It computes a weighted sum of all input token representations, where weights depend on pairwise compatibility between tokens
The self-attention mechanism computes a weighted sum of all input token representations, where the weights are determined by the pairwise compatibility (attention scores) between tokens. This allows each token to dynamically attend to every other token in the sequence, capturing global dependencies without the limitations of fixed local windows or recurrence.
Key principle: Answer the scenario, not the keyword: identify the specific constraint before choosing the most familiar-sounding option.
Answer analysis
Option-by-option breakdown
For each option: why learners choose it and why it is or isn't the right answer here.
- ✗
It encodes the order of tokens in the sequence
Why it's wrong here
Positional encoding, not self-attention, handles token order.
- ✓
It computes a weighted sum of all input token representations, where weights depend on pairwise compatibility between tokens
Why this is correct
Self-attention calculates attention scores between every pair of tokens and uses them to aggregate information.
Clue confirmation
The clue word "best" in the question point toward this answer.
Related concept
Read the scenario before looking for a memorised answer.
- ✗
It applies a convolutional filter over local windows of tokens
Why it's wrong here
Convolution is not part of self-attention; self-attention considers all tokens globally.
- ✗
It replaces the need for positional encoding by using recurrence
Why it's wrong here
Self-attention is position-agnostic; positional encoding is still required. It does not use recurrence.
Common exam traps
Common exam trap: answer the scenario, not the keyword
Cisco often tests the misconception that self-attention inherently encodes positional information, when in fact it is permutation-invariant and relies on separate positional encodings to maintain sequence order.
Detailed technical explanation
How to think about this question
Under the hood, self-attention computes Query (Q), Key (K), and Value (V) matrices from input embeddings, then calculates attention scores as softmax(QK^T / sqrt(d_k)). This yields a weighted sum where each token's output is a blend of all tokens, with weights reflecting relevance. In practice, multi-head attention runs this process in parallel across multiple representation subspaces, enabling the model to capture diverse relational patterns, such as syntactic and semantic dependencies in long sequences.
KKey Concepts to Remember
- Read the scenario before looking for a memorised answer.
- Find the constraint that changes the correct option.
- Eliminate answers that are true in general but not in this case.
TExam Day Tips
- Watch for words such as best, first, most likely and least administrative effort.
- Review why wrong options are wrong, not only why the correct option is correct.
Key takeaway
Answer the scenario, not the keyword: identify the specific constraint before choosing the most familiar-sounding option.
Real-world example
How this comes up in practice
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
Got this wrong? Here's your next step.
Identify which exam domain this question belongs to, review the core concept, then practise similar questions from the same domain.
- →
LLM Fundamentals — study guide chapter
Learn the concepts, then practise the questions
- →
LLM Fundamentals practice questions
Targeted practice on this topic area only
- →
All 1Z0-1127 questions
991 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
Related 1Z0-1127 practice-question pages
Use these pages to review the topic behind this question. This is how one missed question becomes focused revision.
Prompt Engineering practice questions
Practise 1Z0-1127 questions linked to Prompt Engineering.
OCI Generative AI Service practice questions
Practise 1Z0-1127 questions linked to OCI Generative AI Service.
LLM Fundamentals practice questions
Practise 1Z0-1127 questions linked to LLM Fundamentals.
LangChain and AI Application Development practice questions
Practise 1Z0-1127 questions linked to LangChain and AI Application Development.
Fundamentals of Large Language Models practice questions
Practise 1Z0-1127 questions linked to Fundamentals of Large Language Models.
Using OCI Generative AI Service practice questions
Practise 1Z0-1127 questions linked to Using OCI Generative AI Service.
Building LLM Applications with RAG and Vector Search practice questions
Practise 1Z0-1127 questions linked to Building LLM Applications with RAG and Vector Search.
Deploying and Managing Generative AI on OCI practice questions
Practise 1Z0-1127 questions linked to Deploying and Managing Generative AI on OCI.
1Z0-1127 fundamentals practice questions
Practise 1Z0-1127 questions linked to 1Z0-1127 fundamentals.
1Z0-1127 scenario practice questions
Practise 1Z0-1127 questions linked to 1Z0-1127 scenario.
1Z0-1127 troubleshooting practice questions
Practise 1Z0-1127 questions linked to 1Z0-1127 troubleshooting.
Practice this exam
Start a free 1Z0-1127 practice session
Short sessions build daily habit. Longer sessions build exam-day stamina. Try a timed session to simulate real conditions.
FAQ
Questions learners often ask
What does this 1Z0-1127 question test?
LLM Fundamentals — This question tests LLM Fundamentals — Read the scenario before looking for a memorised answer..
What is the correct answer to this question?
The correct answer is: It computes a weighted sum of all input token representations, where weights depend on pairwise compatibility between tokens — The self-attention mechanism computes a weighted sum of all input token representations, where the weights are determined by the pairwise compatibility (attention scores) between tokens. This allows each token to dynamically attend to every other token in the sequence, capturing global dependencies without the limitations of fixed local windows or recurrence.
What should I do if I get this 1Z0-1127 question wrong?
Identify which exam domain this question belongs to, review the core concept, then practise similar questions from the same domain.
Are there clue words in this question I should notice?
Yes — watch for: "best". Signals that multiple options may be partially correct. Choose the option that most directly solves the exact problem described, not the one that sounds most complete.
What is the key concept behind this question?
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: Jul 4, 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.